/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:17:31,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:17:31,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:17:31,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:17:31,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:17:31,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:17:31,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:17:31,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:17:31,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:17:31,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:17:31,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:17:31,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:17:31,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:17:31,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:17:31,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:17:31,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:17:31,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:17:31,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:17:31,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:17:31,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:17:31,752 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:17:31,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:17:31,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:17:31,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:17:31,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:17:31,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:17:31,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:17:31,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:17:31,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:17:31,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:17:31,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:17:31,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:17:31,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:17:31,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:17:31,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:17:31,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:17:31,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:17:31,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:17:31,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:17:31,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:17:31,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:17:31,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:17:31,771 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:17:31,781 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:17:31,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:17:31,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:17:31,782 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:17:31,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:17:31,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:17:31,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:17:31,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:17:31,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:17:31,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:17:31,783 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:17:31,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:17:31,784 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:17:31,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:17:31,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:17:31,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:17:31,784 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:17:31,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:17:31,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:17:31,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:17:31,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:17:31,785 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:17:31,785 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:17:31,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:17:31,786 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:17:31,786 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:17:31,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:17:32,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:17:32,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:17:32,014 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:17:32,015 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:17:32,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2022-04-08 08:17:32,078 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/016fef413/0637bb022110443cbdd12a2bd8d135d9/FLAG571cb31c5 [2022-04-08 08:17:32,432 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:17:32,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2022-04-08 08:17:32,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/016fef413/0637bb022110443cbdd12a2bd8d135d9/FLAG571cb31c5 [2022-04-08 08:17:32,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/016fef413/0637bb022110443cbdd12a2bd8d135d9 [2022-04-08 08:17:32,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:17:32,869 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:17:32,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:17:32,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:17:32,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:17:32,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:17:32" (1/1) ... [2022-04-08 08:17:32,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40749816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:32, skipping insertion in model container [2022-04-08 08:17:32,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:17:32" (1/1) ... [2022-04-08 08:17:32,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:17:32,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:17:33,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c[4591,4604] [2022-04-08 08:17:33,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:17:33,064 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:17:33,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c[4591,4604] [2022-04-08 08:17:33,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:17:33,100 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:17:33,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:33 WrapperNode [2022-04-08 08:17:33,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:17:33,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:17:33,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:17:33,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:17:33,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:33" (1/1) ... [2022-04-08 08:17:33,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:33" (1/1) ... [2022-04-08 08:17:33,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:33" (1/1) ... [2022-04-08 08:17:33,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:33" (1/1) ... [2022-04-08 08:17:33,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:33" (1/1) ... [2022-04-08 08:17:33,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:33" (1/1) ... [2022-04-08 08:17:33,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:33" (1/1) ... [2022-04-08 08:17:33,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:17:33,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:17:33,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:17:33,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:17:33,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:33" (1/1) ... [2022-04-08 08:17:33,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:17:33,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:17:33,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:17:33,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:17:33,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:17:33,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:17:33,207 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:17:33,207 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:17:33,207 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:17:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:17:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:17:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:17:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:17:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:17:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:17:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:17:33,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:17:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:17:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:17:33,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:17:33,259 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:17:33,260 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:17:33,497 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:17:33,506 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:17:33,506 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:17:33,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:17:33 BoogieIcfgContainer [2022-04-08 08:17:33,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:17:33,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:17:33,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:17:33,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:17:33,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:17:32" (1/3) ... [2022-04-08 08:17:33,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f76649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:17:33, skipping insertion in model container [2022-04-08 08:17:33,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:33" (2/3) ... [2022-04-08 08:17:33,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f76649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:17:33, skipping insertion in model container [2022-04-08 08:17:33,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:17:33" (3/3) ... [2022-04-08 08:17:33,519 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2022-04-08 08:17:33,523 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:17:33,523 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:17:33,570 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:17:33,575 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:17:33,576 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:17:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:17:33,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:17:33,603 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:33,603 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:33,604 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:33,608 INFO L85 PathProgramCache]: Analyzing trace with hash 88534809, now seen corresponding path program 1 times [2022-04-08 08:17:33,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:33,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [22142654] [2022-04-08 08:17:33,624 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:33,625 INFO L85 PathProgramCache]: Analyzing trace with hash 88534809, now seen corresponding path program 2 times [2022-04-08 08:17:33,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:33,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631022495] [2022-04-08 08:17:33,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:33,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:33,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:33,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {54#true} is VALID [2022-04-08 08:17:33,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-08 08:17:33,876 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #234#return; {54#true} is VALID [2022-04-08 08:17:33,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:33,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {54#true} is VALID [2022-04-08 08:17:33,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-08 08:17:33,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #234#return; {54#true} is VALID [2022-04-08 08:17:33,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret17 := main(); {54#true} is VALID [2022-04-08 08:17:33,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {54#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {54#true} is VALID [2022-04-08 08:17:33,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {54#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {54#true} is VALID [2022-04-08 08:17:33,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {54#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {54#true} is VALID [2022-04-08 08:17:33,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {54#true} assume 0 != ~p1~0;~lk1~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:33,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {59#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {59#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:33,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:33,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:33,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:33,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:33,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:33,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:33,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:33,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {59#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {59#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:33,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:33,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:33,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p1~0; {59#(= main_~lk1~0 1)} is VALID [2022-04-08 08:17:33,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {59#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {55#false} is VALID [2022-04-08 08:17:33,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {55#false} assume !false; {55#false} is VALID [2022-04-08 08:17:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:33,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:33,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631022495] [2022-04-08 08:17:33,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631022495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:33,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:33,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:33,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:33,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [22142654] [2022-04-08 08:17:33,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [22142654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:33,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:33,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:33,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763204687] [2022-04-08 08:17:33,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:33,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:17:33,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:33,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:33,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:33,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:33,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:33,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:33,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:33,987 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:34,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:34,398 INFO L93 Difference]: Finished difference Result 100 states and 175 transitions. [2022-04-08 08:17:34,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:34,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:17:34,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-08 08:17:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-08 08:17:34,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-08 08:17:34,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:34,613 INFO L225 Difference]: With dead ends: 100 [2022-04-08 08:17:34,613 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 08:17:34,616 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:34,618 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 208 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:34,619 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 101 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:34,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 08:17:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2022-04-08 08:17:34,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:34,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:34,654 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:34,655 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:34,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:34,662 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-08 08:17:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-08 08:17:34,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:34,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:34,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-08 08:17:34,664 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-08 08:17:34,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:34,670 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-08 08:17:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-08 08:17:34,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:34,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:34,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:34,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:34,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2022-04-08 08:17:34,677 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 23 [2022-04-08 08:17:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:34,677 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2022-04-08 08:17:34,677 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:34,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 106 transitions. [2022-04-08 08:17:34,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2022-04-08 08:17:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:17:34,790 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:34,790 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:34,791 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:17:34,791 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:34,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:34,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1191328869, now seen corresponding path program 1 times [2022-04-08 08:17:34,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:34,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [294421276] [2022-04-08 08:17:34,796 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:34,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1191328869, now seen corresponding path program 2 times [2022-04-08 08:17:34,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:34,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875629270] [2022-04-08 08:17:34,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:34,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:34,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:34,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {554#true} is VALID [2022-04-08 08:17:34,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-08 08:17:34,929 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {554#true} {554#true} #234#return; {554#true} is VALID [2022-04-08 08:17:34,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:34,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {554#true} is VALID [2022-04-08 08:17:34,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-08 08:17:34,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #234#return; {554#true} is VALID [2022-04-08 08:17:34,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret17 := main(); {554#true} is VALID [2022-04-08 08:17:34,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {554#true} is VALID [2022-04-08 08:17:34,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {554#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {554#true} is VALID [2022-04-08 08:17:34,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {554#true} is VALID [2022-04-08 08:17:34,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 != ~p1~0); {559#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:34,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {559#(= main_~p1~0 0)} assume !(0 != ~p2~0); {559#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:34,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:34,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:34,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:34,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:34,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:34,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:34,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:34,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {559#(= main_~p1~0 0)} assume !(0 != ~p10~0); {559#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:34,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:34,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-08 08:17:34,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p1~0; {555#false} is VALID [2022-04-08 08:17:34,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {555#false} assume 1 != ~lk1~0; {555#false} is VALID [2022-04-08 08:17:34,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-08 08:17:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:34,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:34,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875629270] [2022-04-08 08:17:34,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875629270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:34,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:34,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:34,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:34,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [294421276] [2022-04-08 08:17:34,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [294421276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:34,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:34,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:34,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268407609] [2022-04-08 08:17:34,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:34,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:17:34,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:34,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:34,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:34,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:34,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:34,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:34,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:34,967 INFO L87 Difference]: Start difference. First operand 59 states and 106 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:35,244 INFO L93 Difference]: Finished difference Result 138 states and 253 transitions. [2022-04-08 08:17:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:35,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:17:35,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:35,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-08 08:17:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-08 08:17:35,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 228 transitions. [2022-04-08 08:17:35,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:35,427 INFO L225 Difference]: With dead ends: 138 [2022-04-08 08:17:35,427 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 08:17:35,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:35,432 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:35,433 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 111 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:35,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 08:17:35,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-04-08 08:17:35,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:35,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,452 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,452 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:35,459 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-08 08:17:35,459 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-08 08:17:35,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:35,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:35,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-08 08:17:35,467 INFO L87 Difference]: Start difference. First operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-08 08:17:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:35,473 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-08 08:17:35,473 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-08 08:17:35,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:35,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:35,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:35,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 150 transitions. [2022-04-08 08:17:35,477 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 150 transitions. Word has length 23 [2022-04-08 08:17:35,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:35,478 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 150 transitions. [2022-04-08 08:17:35,478 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 150 transitions. [2022-04-08 08:17:35,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 150 transitions. [2022-04-08 08:17:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:17:35,626 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:35,626 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:35,626 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:17:35,626 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:35,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1550175482, now seen corresponding path program 1 times [2022-04-08 08:17:35,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:35,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [958004947] [2022-04-08 08:17:35,628 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:35,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1550175482, now seen corresponding path program 2 times [2022-04-08 08:17:35,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:35,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451333074] [2022-04-08 08:17:35,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:35,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:35,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:35,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1178#true} is VALID [2022-04-08 08:17:35,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 08:17:35,687 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1178#true} {1178#true} #234#return; {1178#true} is VALID [2022-04-08 08:17:35,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:35,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1178#true} is VALID [2022-04-08 08:17:35,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 08:17:35,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #234#return; {1178#true} is VALID [2022-04-08 08:17:35,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret17 := main(); {1178#true} is VALID [2022-04-08 08:17:35,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {1178#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {1178#true} is VALID [2022-04-08 08:17:35,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {1178#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {1178#true} is VALID [2022-04-08 08:17:35,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {1178#true} is VALID [2022-04-08 08:17:35,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#true} assume 0 != ~p1~0;~lk1~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:35,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1183#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:35,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:35,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:35,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:35,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:35,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:35,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:35,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:35,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {1183#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1183#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:35,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:35,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:17:35,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {1183#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1179#false} is VALID [2022-04-08 08:17:35,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#false} assume 0 != ~p2~0; {1179#false} is VALID [2022-04-08 08:17:35,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {1179#false} assume 1 != ~lk2~0; {1179#false} is VALID [2022-04-08 08:17:35,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-08 08:17:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:35,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:35,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451333074] [2022-04-08 08:17:35,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451333074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:35,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:35,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:35,696 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:35,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [958004947] [2022-04-08 08:17:35,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [958004947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:35,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:35,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:35,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424535713] [2022-04-08 08:17:35,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:35,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:17:35,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:35,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:35,714 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:35,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:35,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:35,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:35,715 INFO L87 Difference]: Start difference. First operand 83 states and 150 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:35,957 INFO L93 Difference]: Finished difference Result 127 states and 226 transitions. [2022-04-08 08:17:35,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:35,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:17:35,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-08 08:17:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-08 08:17:35,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 223 transitions. [2022-04-08 08:17:36,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:36,153 INFO L225 Difference]: With dead ends: 127 [2022-04-08 08:17:36,153 INFO L226 Difference]: Without dead ends: 88 [2022-04-08 08:17:36,154 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:36,155 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:36,155 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 133 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:36,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-08 08:17:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2022-04-08 08:17:36,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:36,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,166 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,167 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:36,170 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-08 08:17:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-08 08:17:36,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:36,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:36,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-08 08:17:36,171 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-08 08:17:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:36,174 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-08 08:17:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-08 08:17:36,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:36,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:36,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:36,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 152 transitions. [2022-04-08 08:17:36,178 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 152 transitions. Word has length 24 [2022-04-08 08:17:36,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:36,178 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 152 transitions. [2022-04-08 08:17:36,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 152 transitions. [2022-04-08 08:17:36,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:36,312 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 152 transitions. [2022-04-08 08:17:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:17:36,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:36,313 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:36,313 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:17:36,315 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:36,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:36,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1723723460, now seen corresponding path program 1 times [2022-04-08 08:17:36,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:36,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2429691] [2022-04-08 08:17:36,320 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:36,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1723723460, now seen corresponding path program 2 times [2022-04-08 08:17:36,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:36,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2730259] [2022-04-08 08:17:36,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:36,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:36,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:36,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {1798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1792#true} is VALID [2022-04-08 08:17:36,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 08:17:36,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1792#true} {1792#true} #234#return; {1792#true} is VALID [2022-04-08 08:17:36,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {1792#true} call ULTIMATE.init(); {1798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:36,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {1798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1792#true} is VALID [2022-04-08 08:17:36,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 08:17:36,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1792#true} {1792#true} #234#return; {1792#true} is VALID [2022-04-08 08:17:36,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {1792#true} call #t~ret17 := main(); {1792#true} is VALID [2022-04-08 08:17:36,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {1792#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {1792#true} is VALID [2022-04-08 08:17:36,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {1792#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {1792#true} is VALID [2022-04-08 08:17:36,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {1792#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {1792#true} is VALID [2022-04-08 08:17:36,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {1792#true} assume !(0 != ~p1~0); {1792#true} is VALID [2022-04-08 08:17:36,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {1792#true} assume !(0 != ~p2~0); {1797#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:36,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:36,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:36,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:36,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:36,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:36,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:36,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:36,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {1797#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1797#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:36,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:36,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:36,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {1797#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1797#(= main_~p2~0 0)} is VALID [2022-04-08 08:17:36,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p2~0; {1793#false} is VALID [2022-04-08 08:17:36,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#false} assume 1 != ~lk2~0; {1793#false} is VALID [2022-04-08 08:17:36,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2022-04-08 08:17:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:36,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:36,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2730259] [2022-04-08 08:17:36,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2730259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:36,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:36,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:36,421 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:36,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2429691] [2022-04-08 08:17:36,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2429691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:36,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:36,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:36,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100679506] [2022-04-08 08:17:36,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:36,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:17:36,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:36,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:36,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:36,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:36,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:36,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:36,439 INFO L87 Difference]: Start difference. First operand 86 states and 152 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:36,664 INFO L93 Difference]: Finished difference Result 238 states and 432 transitions. [2022-04-08 08:17:36,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:36,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:17:36,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-08 08:17:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-08 08:17:36,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 226 transitions. [2022-04-08 08:17:36,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:36,845 INFO L225 Difference]: With dead ends: 238 [2022-04-08 08:17:36,845 INFO L226 Difference]: Without dead ends: 161 [2022-04-08 08:17:36,846 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:36,847 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 197 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:36,847 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 91 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-08 08:17:36,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-04-08 08:17:36,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:36,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,865 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,865 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:36,873 INFO L93 Difference]: Finished difference Result 161 states and 286 transitions. [2022-04-08 08:17:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 286 transitions. [2022-04-08 08:17:36,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:36,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:36,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-08 08:17:36,875 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-08 08:17:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:36,883 INFO L93 Difference]: Finished difference Result 161 states and 286 transitions. [2022-04-08 08:17:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 286 transitions. [2022-04-08 08:17:36,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:36,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:36,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:36,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 285 transitions. [2022-04-08 08:17:36,892 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 285 transitions. Word has length 24 [2022-04-08 08:17:36,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:36,892 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 285 transitions. [2022-04-08 08:17:36,893 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:36,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 285 transitions. [2022-04-08 08:17:37,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 285 transitions. [2022-04-08 08:17:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:17:37,155 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:37,155 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:37,155 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:17:37,155 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:37,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:37,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1291380158, now seen corresponding path program 1 times [2022-04-08 08:17:37,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:37,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1501191783] [2022-04-08 08:17:37,157 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1291380158, now seen corresponding path program 2 times [2022-04-08 08:17:37,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:37,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067730288] [2022-04-08 08:17:37,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:37,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:37,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:37,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {2926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2920#true} is VALID [2022-04-08 08:17:37,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {2920#true} assume true; {2920#true} is VALID [2022-04-08 08:17:37,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2920#true} {2920#true} #234#return; {2920#true} is VALID [2022-04-08 08:17:37,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {2920#true} call ULTIMATE.init(); {2926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:37,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {2926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2920#true} is VALID [2022-04-08 08:17:37,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {2920#true} assume true; {2920#true} is VALID [2022-04-08 08:17:37,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2920#true} {2920#true} #234#return; {2920#true} is VALID [2022-04-08 08:17:37,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {2920#true} call #t~ret17 := main(); {2920#true} is VALID [2022-04-08 08:17:37,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {2920#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {2920#true} is VALID [2022-04-08 08:17:37,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {2920#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {2920#true} is VALID [2022-04-08 08:17:37,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {2920#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {2920#true} is VALID [2022-04-08 08:17:37,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {2920#true} assume !(0 != ~p1~0); {2920#true} is VALID [2022-04-08 08:17:37,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {2920#true} assume 0 != ~p2~0;~lk2~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:37,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:37,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:37,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:37,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:37,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:37,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:37,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:37,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {2925#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2925#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:37,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:37,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:37,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {2925#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2925#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:37,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2925#(= main_~lk2~0 1)} is VALID [2022-04-08 08:17:37,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {2925#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2921#false} is VALID [2022-04-08 08:17:37,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {2921#false} assume !false; {2921#false} is VALID [2022-04-08 08:17:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:37,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:37,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067730288] [2022-04-08 08:17:37,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067730288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:37,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:37,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:37,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:37,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1501191783] [2022-04-08 08:17:37,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1501191783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:37,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:37,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:37,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004505388] [2022-04-08 08:17:37,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:37,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:17:37,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:37,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:37,247 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:37,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:37,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:37,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:37,248 INFO L87 Difference]: Start difference. First operand 159 states and 285 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:37,465 INFO L93 Difference]: Finished difference Result 207 states and 371 transitions. [2022-04-08 08:17:37,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:37,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:17:37,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-08 08:17:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-08 08:17:37,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-08 08:17:37,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:37,586 INFO L225 Difference]: With dead ends: 207 [2022-04-08 08:17:37,586 INFO L226 Difference]: Without dead ends: 205 [2022-04-08 08:17:37,586 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:37,587 INFO L913 BasicCegarLoop]: 145 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:37,588 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 152 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-08 08:17:37,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 159. [2022-04-08 08:17:37,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:37,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,604 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,604 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:37,611 INFO L93 Difference]: Finished difference Result 205 states and 368 transitions. [2022-04-08 08:17:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 368 transitions. [2022-04-08 08:17:37,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:37,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:37,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 205 states. [2022-04-08 08:17:37,612 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 205 states. [2022-04-08 08:17:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:37,618 INFO L93 Difference]: Finished difference Result 205 states and 368 transitions. [2022-04-08 08:17:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 368 transitions. [2022-04-08 08:17:37,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:37,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:37,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:37,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 283 transitions. [2022-04-08 08:17:37,627 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 283 transitions. Word has length 24 [2022-04-08 08:17:37,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:37,627 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 283 transitions. [2022-04-08 08:17:37,627 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:37,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 283 transitions. [2022-04-08 08:17:37,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 283 transitions. [2022-04-08 08:17:37,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:17:37,929 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:37,929 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:37,930 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:17:37,930 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:37,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:37,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1896032784, now seen corresponding path program 1 times [2022-04-08 08:17:37,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:37,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [152429656] [2022-04-08 08:17:37,931 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1896032784, now seen corresponding path program 2 times [2022-04-08 08:17:37,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:37,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994823586] [2022-04-08 08:17:37,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:37,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:37,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:38,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {4080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4074#true} is VALID [2022-04-08 08:17:38,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {4074#true} assume true; {4074#true} is VALID [2022-04-08 08:17:38,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4074#true} {4074#true} #234#return; {4074#true} is VALID [2022-04-08 08:17:38,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {4074#true} call ULTIMATE.init(); {4080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:38,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {4080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4074#true} is VALID [2022-04-08 08:17:38,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {4074#true} assume true; {4074#true} is VALID [2022-04-08 08:17:38,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4074#true} {4074#true} #234#return; {4074#true} is VALID [2022-04-08 08:17:38,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {4074#true} call #t~ret17 := main(); {4074#true} is VALID [2022-04-08 08:17:38,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {4074#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {4074#true} is VALID [2022-04-08 08:17:38,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {4074#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {4074#true} is VALID [2022-04-08 08:17:38,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {4074#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {4074#true} is VALID [2022-04-08 08:17:38,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {4074#true} assume !(0 != ~p1~0); {4074#true} is VALID [2022-04-08 08:17:38,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {4074#true} assume !(0 != ~p2~0); {4074#true} is VALID [2022-04-08 08:17:38,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {4074#true} assume 0 != ~p3~0;~lk3~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:38,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:38,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:38,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:38,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:38,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:38,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:38,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {4079#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4079#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:38,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:38,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:38,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {4079#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4079#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:38,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {4079#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4079#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:38,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4079#(= main_~lk3~0 1)} is VALID [2022-04-08 08:17:38,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {4079#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4075#false} is VALID [2022-04-08 08:17:38,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {4075#false} assume !false; {4075#false} is VALID [2022-04-08 08:17:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:38,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:38,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994823586] [2022-04-08 08:17:38,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994823586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:38,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:38,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:38,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:38,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [152429656] [2022-04-08 08:17:38,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [152429656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:38,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:38,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:38,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671296162] [2022-04-08 08:17:38,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:38,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 08:17:38,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:38,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:38,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:38,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:38,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:38,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:38,032 INFO L87 Difference]: Start difference. First operand 159 states and 283 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:38,273 INFO L93 Difference]: Finished difference Result 299 states and 539 transitions. [2022-04-08 08:17:38,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:38,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 08:17:38,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-08 08:17:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-08 08:17:38,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-08 08:17:38,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:38,399 INFO L225 Difference]: With dead ends: 299 [2022-04-08 08:17:38,399 INFO L226 Difference]: Without dead ends: 297 [2022-04-08 08:17:38,400 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:38,401 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:38,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-08 08:17:38,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 215. [2022-04-08 08:17:38,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:38,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,422 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,423 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:38,432 INFO L93 Difference]: Finished difference Result 297 states and 534 transitions. [2022-04-08 08:17:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 534 transitions. [2022-04-08 08:17:38,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:38,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:38,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 297 states. [2022-04-08 08:17:38,434 INFO L87 Difference]: Start difference. First operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 297 states. [2022-04-08 08:17:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:38,445 INFO L93 Difference]: Finished difference Result 297 states and 534 transitions. [2022-04-08 08:17:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 534 transitions. [2022-04-08 08:17:38,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:38,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:38,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:38,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 381 transitions. [2022-04-08 08:17:38,453 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 381 transitions. Word has length 25 [2022-04-08 08:17:38,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:38,454 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 381 transitions. [2022-04-08 08:17:38,454 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 215 states and 381 transitions. [2022-04-08 08:17:38,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:38,808 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 381 transitions. [2022-04-08 08:17:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:17:38,809 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:38,809 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:38,809 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:17:38,809 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:38,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:38,810 INFO L85 PathProgramCache]: Analyzing trace with hash 616169106, now seen corresponding path program 1 times [2022-04-08 08:17:38,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:38,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [6106317] [2022-04-08 08:17:38,810 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:38,810 INFO L85 PathProgramCache]: Analyzing trace with hash 616169106, now seen corresponding path program 2 times [2022-04-08 08:17:38,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:38,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849527152] [2022-04-08 08:17:38,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:38,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:38,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:38,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {5714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5708#true} is VALID [2022-04-08 08:17:38,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {5708#true} assume true; {5708#true} is VALID [2022-04-08 08:17:38,903 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5708#true} {5708#true} #234#return; {5708#true} is VALID [2022-04-08 08:17:38,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {5708#true} call ULTIMATE.init(); {5714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:38,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {5714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5708#true} is VALID [2022-04-08 08:17:38,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {5708#true} assume true; {5708#true} is VALID [2022-04-08 08:17:38,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5708#true} {5708#true} #234#return; {5708#true} is VALID [2022-04-08 08:17:38,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {5708#true} call #t~ret17 := main(); {5708#true} is VALID [2022-04-08 08:17:38,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {5708#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {5708#true} is VALID [2022-04-08 08:17:38,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {5708#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {5708#true} is VALID [2022-04-08 08:17:38,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {5708#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {5708#true} is VALID [2022-04-08 08:17:38,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {5708#true} assume !(0 != ~p1~0); {5708#true} is VALID [2022-04-08 08:17:38,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {5708#true} assume !(0 != ~p2~0); {5708#true} is VALID [2022-04-08 08:17:38,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {5708#true} assume !(0 != ~p3~0); {5713#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:38,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:38,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:38,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:38,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:38,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:38,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:38,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {5713#(= main_~p3~0 0)} assume !(0 != ~p10~0); {5713#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:38,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:38,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:38,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {5713#(= main_~p3~0 0)} assume !(0 != ~p1~0); {5713#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:38,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {5713#(= main_~p3~0 0)} assume !(0 != ~p2~0); {5713#(= main_~p3~0 0)} is VALID [2022-04-08 08:17:38,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p3~0; {5709#false} is VALID [2022-04-08 08:17:38,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {5709#false} assume 1 != ~lk3~0; {5709#false} is VALID [2022-04-08 08:17:38,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {5709#false} assume !false; {5709#false} is VALID [2022-04-08 08:17:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:38,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:38,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849527152] [2022-04-08 08:17:38,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849527152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:38,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:38,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:38,923 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:38,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [6106317] [2022-04-08 08:17:38,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [6106317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:38,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:38,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:38,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857344302] [2022-04-08 08:17:38,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:38,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 08:17:38,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:38,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:38,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:38,942 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:38,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:38,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:38,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:38,943 INFO L87 Difference]: Start difference. First operand 215 states and 381 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:39,192 INFO L93 Difference]: Finished difference Result 511 states and 915 transitions. [2022-04-08 08:17:39,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:39,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 08:17:39,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-08 08:17:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-08 08:17:39,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 222 transitions. [2022-04-08 08:17:39,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:39,372 INFO L225 Difference]: With dead ends: 511 [2022-04-08 08:17:39,372 INFO L226 Difference]: Without dead ends: 305 [2022-04-08 08:17:39,373 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:39,374 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:39,374 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 115 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-04-08 08:17:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2022-04-08 08:17:39,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:39,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 305 states. Second operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,401 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,402 INFO L87 Difference]: Start difference. First operand 305 states. Second operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:39,410 INFO L93 Difference]: Finished difference Result 305 states and 536 transitions. [2022-04-08 08:17:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 536 transitions. [2022-04-08 08:17:39,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:39,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:39,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 305 states. [2022-04-08 08:17:39,413 INFO L87 Difference]: Start difference. First operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 305 states. [2022-04-08 08:17:39,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:39,421 INFO L93 Difference]: Finished difference Result 305 states and 536 transitions. [2022-04-08 08:17:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 536 transitions. [2022-04-08 08:17:39,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:39,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:39,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:39,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 535 transitions. [2022-04-08 08:17:39,432 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 535 transitions. Word has length 25 [2022-04-08 08:17:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:39,433 INFO L478 AbstractCegarLoop]: Abstraction has 303 states and 535 transitions. [2022-04-08 08:17:39,433 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:39,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 303 states and 535 transitions. [2022-04-08 08:17:39,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:39,942 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 535 transitions. [2022-04-08 08:17:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:17:39,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:39,943 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:39,943 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:17:39,943 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:39,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:39,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1352312423, now seen corresponding path program 1 times [2022-04-08 08:17:39,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:39,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [294108134] [2022-04-08 08:17:39,944 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:39,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1352312423, now seen corresponding path program 2 times [2022-04-08 08:17:39,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:39,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366823962] [2022-04-08 08:17:39,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:39,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:39,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:39,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {7964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7958#true} is VALID [2022-04-08 08:17:39,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {7958#true} assume true; {7958#true} is VALID [2022-04-08 08:17:39,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7958#true} {7958#true} #234#return; {7958#true} is VALID [2022-04-08 08:17:40,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {7958#true} call ULTIMATE.init(); {7964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:40,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {7964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7958#true} is VALID [2022-04-08 08:17:40,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {7958#true} assume true; {7958#true} is VALID [2022-04-08 08:17:40,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7958#true} {7958#true} #234#return; {7958#true} is VALID [2022-04-08 08:17:40,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {7958#true} call #t~ret17 := main(); {7958#true} is VALID [2022-04-08 08:17:40,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {7958#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {7958#true} is VALID [2022-04-08 08:17:40,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {7958#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {7958#true} is VALID [2022-04-08 08:17:40,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {7958#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {7958#true} is VALID [2022-04-08 08:17:40,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {7958#true} assume !(0 != ~p1~0); {7958#true} is VALID [2022-04-08 08:17:40,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {7958#true} assume !(0 != ~p2~0); {7958#true} is VALID [2022-04-08 08:17:40,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {7958#true} assume 0 != ~p3~0;~lk3~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:40,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:40,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:40,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:40,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:40,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:40,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:40,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {7963#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:40,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:40,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:40,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {7963#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:40,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {7963#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:17:40,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {7959#false} is VALID [2022-04-08 08:17:40,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {7959#false} assume 0 != ~p4~0; {7959#false} is VALID [2022-04-08 08:17:40,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {7959#false} assume 1 != ~lk4~0; {7959#false} is VALID [2022-04-08 08:17:40,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {7959#false} assume !false; {7959#false} is VALID [2022-04-08 08:17:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:40,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:40,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366823962] [2022-04-08 08:17:40,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366823962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:40,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:40,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:40,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:40,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [294108134] [2022-04-08 08:17:40,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [294108134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:40,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:40,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:40,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263246092] [2022-04-08 08:17:40,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:40,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:17:40,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:40,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:40,039 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:40,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:40,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:40,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:40,040 INFO L87 Difference]: Start difference. First operand 303 states and 535 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:40,277 INFO L93 Difference]: Finished difference Result 457 states and 805 transitions. [2022-04-08 08:17:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:17:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-08 08:17:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-08 08:17:40,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 217 transitions. [2022-04-08 08:17:40,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:40,430 INFO L225 Difference]: With dead ends: 457 [2022-04-08 08:17:40,430 INFO L226 Difference]: Without dead ends: 311 [2022-04-08 08:17:40,431 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:40,431 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:40,432 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 127 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:17:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-04-08 08:17:40,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2022-04-08 08:17:40,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:40,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,456 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,457 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:40,465 INFO L93 Difference]: Finished difference Result 311 states and 540 transitions. [2022-04-08 08:17:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 540 transitions. [2022-04-08 08:17:40,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:40,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:40,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 311 states. [2022-04-08 08:17:40,468 INFO L87 Difference]: Start difference. First operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 311 states. [2022-04-08 08:17:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:40,476 INFO L93 Difference]: Finished difference Result 311 states and 540 transitions. [2022-04-08 08:17:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 540 transitions. [2022-04-08 08:17:40,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:40,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:40,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:40,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 539 transitions. [2022-04-08 08:17:40,487 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 539 transitions. Word has length 26 [2022-04-08 08:17:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:40,487 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 539 transitions. [2022-04-08 08:17:40,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:40,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 539 transitions. [2022-04-08 08:17:40,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 539 edges. 539 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 539 transitions. [2022-04-08 08:17:40,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:17:40,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:40,943 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:40,943 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:17:40,944 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:40,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:40,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1921586519, now seen corresponding path program 1 times [2022-04-08 08:17:40,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:40,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [733469384] [2022-04-08 08:17:40,945 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:40,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1921586519, now seen corresponding path program 2 times [2022-04-08 08:17:40,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:40,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046256911] [2022-04-08 08:17:40,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:40,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:40,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:40,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {10130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10124#true} is VALID [2022-04-08 08:17:40,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 08:17:40,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10124#true} {10124#true} #234#return; {10124#true} is VALID [2022-04-08 08:17:41,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {10124#true} call ULTIMATE.init(); {10130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:41,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {10130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10124#true} is VALID [2022-04-08 08:17:41,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 08:17:41,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10124#true} {10124#true} #234#return; {10124#true} is VALID [2022-04-08 08:17:41,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {10124#true} call #t~ret17 := main(); {10124#true} is VALID [2022-04-08 08:17:41,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {10124#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {10124#true} is VALID [2022-04-08 08:17:41,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {10124#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {10124#true} is VALID [2022-04-08 08:17:41,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {10124#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {10124#true} is VALID [2022-04-08 08:17:41,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {10124#true} assume !(0 != ~p1~0); {10124#true} is VALID [2022-04-08 08:17:41,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {10124#true} assume !(0 != ~p2~0); {10124#true} is VALID [2022-04-08 08:17:41,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {10124#true} assume !(0 != ~p3~0); {10124#true} is VALID [2022-04-08 08:17:41,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {10124#true} assume 0 != ~p4~0;~lk4~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:41,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:41,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:41,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:41,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:41,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:41,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {10129#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {10129#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:41,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:41,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:41,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {10129#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {10129#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:41,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {10129#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {10129#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:41,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {10129#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {10129#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:41,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p4~0; {10129#(= main_~lk4~0 1)} is VALID [2022-04-08 08:17:41,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {10129#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {10125#false} is VALID [2022-04-08 08:17:41,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {10125#false} assume !false; {10125#false} is VALID [2022-04-08 08:17:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:41,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:41,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046256911] [2022-04-08 08:17:41,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046256911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:41,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:41,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:41,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:41,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [733469384] [2022-04-08 08:17:41,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [733469384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:41,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:41,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:41,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393449125] [2022-04-08 08:17:41,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:41,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:17:41,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:41,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:41,030 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:41,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:41,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:41,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:41,031 INFO L87 Difference]: Start difference. First operand 309 states and 539 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:41,274 INFO L93 Difference]: Finished difference Result 573 states and 1013 transitions. [2022-04-08 08:17:41,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:41,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:17:41,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-08 08:17:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-08 08:17:41,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 143 transitions. [2022-04-08 08:17:41,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:41,394 INFO L225 Difference]: With dead ends: 573 [2022-04-08 08:17:41,394 INFO L226 Difference]: Without dead ends: 571 [2022-04-08 08:17:41,394 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:41,395 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:41,395 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 87 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:17:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-04-08 08:17:41,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 425. [2022-04-08 08:17:41,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:41,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,427 INFO L74 IsIncluded]: Start isIncluded. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,428 INFO L87 Difference]: Start difference. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:41,448 INFO L93 Difference]: Finished difference Result 571 states and 1004 transitions. [2022-04-08 08:17:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1004 transitions. [2022-04-08 08:17:41,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:41,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:41,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 571 states. [2022-04-08 08:17:41,451 INFO L87 Difference]: Start difference. First operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 571 states. [2022-04-08 08:17:41,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:41,471 INFO L93 Difference]: Finished difference Result 571 states and 1004 transitions. [2022-04-08 08:17:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1004 transitions. [2022-04-08 08:17:41,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:41,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:41,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:41,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 731 transitions. [2022-04-08 08:17:41,490 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 731 transitions. Word has length 26 [2022-04-08 08:17:41,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:41,490 INFO L478 AbstractCegarLoop]: Abstraction has 425 states and 731 transitions. [2022-04-08 08:17:41,490 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:41,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 425 states and 731 transitions. [2022-04-08 08:17:42,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 731 edges. 731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:42,199 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 731 transitions. [2022-04-08 08:17:42,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:17:42,200 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:42,200 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:42,200 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:17:42,200 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:42,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:42,201 INFO L85 PathProgramCache]: Analyzing trace with hash 641722841, now seen corresponding path program 1 times [2022-04-08 08:17:42,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:42,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1046139186] [2022-04-08 08:17:42,201 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:42,201 INFO L85 PathProgramCache]: Analyzing trace with hash 641722841, now seen corresponding path program 2 times [2022-04-08 08:17:42,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:42,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971818197] [2022-04-08 08:17:42,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:42,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:42,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:42,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {13280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {13274#true} is VALID [2022-04-08 08:17:42,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {13274#true} assume true; {13274#true} is VALID [2022-04-08 08:17:42,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13274#true} {13274#true} #234#return; {13274#true} is VALID [2022-04-08 08:17:42,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {13274#true} call ULTIMATE.init(); {13280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:42,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {13280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {13274#true} is VALID [2022-04-08 08:17:42,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {13274#true} assume true; {13274#true} is VALID [2022-04-08 08:17:42,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13274#true} {13274#true} #234#return; {13274#true} is VALID [2022-04-08 08:17:42,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {13274#true} call #t~ret17 := main(); {13274#true} is VALID [2022-04-08 08:17:42,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {13274#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {13274#true} is VALID [2022-04-08 08:17:42,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {13274#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {13274#true} is VALID [2022-04-08 08:17:42,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {13274#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {13274#true} is VALID [2022-04-08 08:17:42,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {13274#true} assume !(0 != ~p1~0); {13274#true} is VALID [2022-04-08 08:17:42,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {13274#true} assume !(0 != ~p2~0); {13274#true} is VALID [2022-04-08 08:17:42,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {13274#true} assume !(0 != ~p3~0); {13274#true} is VALID [2022-04-08 08:17:42,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {13274#true} assume !(0 != ~p4~0); {13279#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:42,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:42,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:42,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:42,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:42,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:42,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {13279#(= main_~p4~0 0)} assume !(0 != ~p10~0); {13279#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:42,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:42,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:42,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {13279#(= main_~p4~0 0)} assume !(0 != ~p1~0); {13279#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:42,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {13279#(= main_~p4~0 0)} assume !(0 != ~p2~0); {13279#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:42,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {13279#(= main_~p4~0 0)} assume !(0 != ~p3~0); {13279#(= main_~p4~0 0)} is VALID [2022-04-08 08:17:42,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p4~0; {13275#false} is VALID [2022-04-08 08:17:42,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {13275#false} assume 1 != ~lk4~0; {13275#false} is VALID [2022-04-08 08:17:42,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {13275#false} assume !false; {13275#false} is VALID [2022-04-08 08:17:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:42,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:42,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971818197] [2022-04-08 08:17:42,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971818197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:42,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:42,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:42,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:42,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1046139186] [2022-04-08 08:17:42,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1046139186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:42,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:42,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:42,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905892205] [2022-04-08 08:17:42,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:42,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:17:42,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:42,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:42,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:42,267 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:42,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:42,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:42,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:42,268 INFO L87 Difference]: Start difference. First operand 425 states and 731 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:42,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:42,583 INFO L93 Difference]: Finished difference Result 1005 states and 1741 transitions. [2022-04-08 08:17:42,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:42,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 08:17:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2022-04-08 08:17:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2022-04-08 08:17:42,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 219 transitions. [2022-04-08 08:17:42,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:42,781 INFO L225 Difference]: With dead ends: 1005 [2022-04-08 08:17:42,781 INFO L226 Difference]: Without dead ends: 595 [2022-04-08 08:17:42,783 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:42,784 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:42,785 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 117 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-04-08 08:17:42,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2022-04-08 08:17:42,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:42,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:42,859 INFO L74 IsIncluded]: Start isIncluded. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:42,861 INFO L87 Difference]: Start difference. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:42,883 INFO L93 Difference]: Finished difference Result 595 states and 1016 transitions. [2022-04-08 08:17:42,883 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1016 transitions. [2022-04-08 08:17:42,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:42,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:42,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 595 states. [2022-04-08 08:17:42,886 INFO L87 Difference]: Start difference. First operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 595 states. [2022-04-08 08:17:42,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:42,907 INFO L93 Difference]: Finished difference Result 595 states and 1016 transitions. [2022-04-08 08:17:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1016 transitions. [2022-04-08 08:17:42,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:42,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:42,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:42,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 1015 transitions. [2022-04-08 08:17:42,935 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 1015 transitions. Word has length 26 [2022-04-08 08:17:42,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:42,935 INFO L478 AbstractCegarLoop]: Abstraction has 593 states and 1015 transitions. [2022-04-08 08:17:42,935 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:42,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 593 states and 1015 transitions. [2022-04-08 08:17:43,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1015 edges. 1015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 1015 transitions. [2022-04-08 08:17:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:17:43,906 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:43,906 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:43,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:17:43,907 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:43,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:43,907 INFO L85 PathProgramCache]: Analyzing trace with hash -560146297, now seen corresponding path program 1 times [2022-04-08 08:17:43,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:43,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1166388331] [2022-04-08 08:17:43,908 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:43,908 INFO L85 PathProgramCache]: Analyzing trace with hash -560146297, now seen corresponding path program 2 times [2022-04-08 08:17:43,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:43,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896261270] [2022-04-08 08:17:43,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:43,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:43,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:43,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {17678#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {17672#true} is VALID [2022-04-08 08:17:43,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {17672#true} assume true; {17672#true} is VALID [2022-04-08 08:17:43,954 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17672#true} {17672#true} #234#return; {17672#true} is VALID [2022-04-08 08:17:43,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {17672#true} call ULTIMATE.init(); {17678#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:43,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {17678#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {17672#true} is VALID [2022-04-08 08:17:43,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {17672#true} assume true; {17672#true} is VALID [2022-04-08 08:17:43,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17672#true} {17672#true} #234#return; {17672#true} is VALID [2022-04-08 08:17:43,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {17672#true} call #t~ret17 := main(); {17672#true} is VALID [2022-04-08 08:17:43,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {17672#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {17672#true} is VALID [2022-04-08 08:17:43,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {17672#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {17672#true} is VALID [2022-04-08 08:17:43,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {17672#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {17672#true} is VALID [2022-04-08 08:17:43,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {17672#true} assume !(0 != ~p1~0); {17672#true} is VALID [2022-04-08 08:17:43,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {17672#true} assume !(0 != ~p2~0); {17672#true} is VALID [2022-04-08 08:17:43,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {17672#true} assume !(0 != ~p3~0); {17672#true} is VALID [2022-04-08 08:17:43,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {17672#true} assume 0 != ~p4~0;~lk4~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:43,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:43,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:43,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:43,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:43,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:43,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {17677#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:43,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:43,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:43,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {17677#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:43,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {17677#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:43,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {17677#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:17:43,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {17673#false} is VALID [2022-04-08 08:17:43,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {17673#false} assume 0 != ~p5~0; {17673#false} is VALID [2022-04-08 08:17:43,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {17673#false} assume 1 != ~lk5~0; {17673#false} is VALID [2022-04-08 08:17:43,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {17673#false} assume !false; {17673#false} is VALID [2022-04-08 08:17:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:43,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:43,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896261270] [2022-04-08 08:17:43,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896261270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:43,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:43,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:43,962 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:43,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1166388331] [2022-04-08 08:17:43,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1166388331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:43,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:43,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:43,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379064460] [2022-04-08 08:17:43,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:43,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:17:43,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:43,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:43,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:43,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:43,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:43,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:43,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:43,981 INFO L87 Difference]: Start difference. First operand 593 states and 1015 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:44,256 INFO L93 Difference]: Finished difference Result 889 states and 1517 transitions. [2022-04-08 08:17:44,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:44,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:17:44,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2022-04-08 08:17:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2022-04-08 08:17:44,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 214 transitions. [2022-04-08 08:17:44,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:44,443 INFO L225 Difference]: With dead ends: 889 [2022-04-08 08:17:44,443 INFO L226 Difference]: Without dead ends: 603 [2022-04-08 08:17:44,444 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:44,445 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:44,445 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 124 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:17:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-08 08:17:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-08 08:17:44,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:44,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,494 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,496 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:44,519 INFO L93 Difference]: Finished difference Result 603 states and 1016 transitions. [2022-04-08 08:17:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1016 transitions. [2022-04-08 08:17:44,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:44,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:44,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states. [2022-04-08 08:17:44,522 INFO L87 Difference]: Start difference. First operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states. [2022-04-08 08:17:44,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:44,543 INFO L93 Difference]: Finished difference Result 603 states and 1016 transitions. [2022-04-08 08:17:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1016 transitions. [2022-04-08 08:17:44,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:44,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:44,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:44,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:44,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1015 transitions. [2022-04-08 08:17:44,605 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1015 transitions. Word has length 27 [2022-04-08 08:17:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:44,605 INFO L478 AbstractCegarLoop]: Abstraction has 601 states and 1015 transitions. [2022-04-08 08:17:44,605 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:44,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 601 states and 1015 transitions. [2022-04-08 08:17:45,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1015 edges. 1015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1015 transitions. [2022-04-08 08:17:45,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:17:45,624 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:45,624 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:45,624 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:17:45,625 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:45,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1581214651, now seen corresponding path program 1 times [2022-04-08 08:17:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:45,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [565962173] [2022-04-08 08:17:45,626 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1581214651, now seen corresponding path program 2 times [2022-04-08 08:17:45,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:45,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450607409] [2022-04-08 08:17:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:45,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:45,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {21876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {21870#true} is VALID [2022-04-08 08:17:45,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {21870#true} assume true; {21870#true} is VALID [2022-04-08 08:17:45,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21870#true} {21870#true} #234#return; {21870#true} is VALID [2022-04-08 08:17:45,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {21870#true} call ULTIMATE.init(); {21876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:45,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {21876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {21870#true} is VALID [2022-04-08 08:17:45,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {21870#true} assume true; {21870#true} is VALID [2022-04-08 08:17:45,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21870#true} {21870#true} #234#return; {21870#true} is VALID [2022-04-08 08:17:45,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {21870#true} call #t~ret17 := main(); {21870#true} is VALID [2022-04-08 08:17:45,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {21870#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {21870#true} is VALID [2022-04-08 08:17:45,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {21870#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {21870#true} is VALID [2022-04-08 08:17:45,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {21870#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {21870#true} is VALID [2022-04-08 08:17:45,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {21870#true} assume !(0 != ~p1~0); {21870#true} is VALID [2022-04-08 08:17:45,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {21870#true} assume !(0 != ~p2~0); {21870#true} is VALID [2022-04-08 08:17:45,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {21870#true} assume !(0 != ~p3~0); {21870#true} is VALID [2022-04-08 08:17:45,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {21870#true} assume !(0 != ~p4~0); {21870#true} is VALID [2022-04-08 08:17:45,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {21870#true} assume 0 != ~p5~0;~lk5~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:45,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:45,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:45,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:45,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:45,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {21875#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:45,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:45,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:45,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {21875#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:45,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {21875#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:45,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {21875#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:45,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {21875#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:45,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p5~0; {21875#(= main_~lk5~0 1)} is VALID [2022-04-08 08:17:45,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {21875#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {21871#false} is VALID [2022-04-08 08:17:45,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {21871#false} assume !false; {21871#false} is VALID [2022-04-08 08:17:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:45,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:45,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450607409] [2022-04-08 08:17:45,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450607409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:45,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:45,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:45,670 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:45,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [565962173] [2022-04-08 08:17:45,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [565962173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:45,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:45,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:45,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720450661] [2022-04-08 08:17:45,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:45,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:17:45,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:45,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:45,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:45,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:45,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:45,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:45,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:45,689 INFO L87 Difference]: Start difference. First operand 601 states and 1015 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:46,050 INFO L93 Difference]: Finished difference Result 1101 states and 1889 transitions. [2022-04-08 08:17:46,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:46,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:17:46,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-08 08:17:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-08 08:17:46,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-08 08:17:46,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:46,244 INFO L225 Difference]: With dead ends: 1101 [2022-04-08 08:17:46,244 INFO L226 Difference]: Without dead ends: 1099 [2022-04-08 08:17:46,245 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:46,246 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 174 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:46,246 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 86 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:17:46,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2022-04-08 08:17:46,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 841. [2022-04-08 08:17:46,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:46,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,315 INFO L74 IsIncluded]: Start isIncluded. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,316 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:46,378 INFO L93 Difference]: Finished difference Result 1099 states and 1872 transitions. [2022-04-08 08:17:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1872 transitions. [2022-04-08 08:17:46,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:46,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:46,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1099 states. [2022-04-08 08:17:46,385 INFO L87 Difference]: Start difference. First operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1099 states. [2022-04-08 08:17:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:46,446 INFO L93 Difference]: Finished difference Result 1099 states and 1872 transitions. [2022-04-08 08:17:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1872 transitions. [2022-04-08 08:17:46,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:46,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:46,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:46,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1391 transitions. [2022-04-08 08:17:46,540 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1391 transitions. Word has length 27 [2022-04-08 08:17:46,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:46,540 INFO L478 AbstractCegarLoop]: Abstraction has 841 states and 1391 transitions. [2022-04-08 08:17:46,540 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:46,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 841 states and 1391 transitions. [2022-04-08 08:17:48,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1391 edges. 1391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1391 transitions. [2022-04-08 08:17:48,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 08:17:48,015 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:48,015 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:48,015 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:17:48,015 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:48,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:48,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1433888967, now seen corresponding path program 1 times [2022-04-08 08:17:48,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:48,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [588365515] [2022-04-08 08:17:48,016 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:48,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1433888967, now seen corresponding path program 2 times [2022-04-08 08:17:48,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:48,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166247787] [2022-04-08 08:17:48,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:48,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:48,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:48,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {27970#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {27964#true} is VALID [2022-04-08 08:17:48,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {27964#true} assume true; {27964#true} is VALID [2022-04-08 08:17:48,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27964#true} {27964#true} #234#return; {27964#true} is VALID [2022-04-08 08:17:48,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {27964#true} call ULTIMATE.init(); {27970#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:48,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {27970#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {27964#true} is VALID [2022-04-08 08:17:48,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {27964#true} assume true; {27964#true} is VALID [2022-04-08 08:17:48,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27964#true} {27964#true} #234#return; {27964#true} is VALID [2022-04-08 08:17:48,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {27964#true} call #t~ret17 := main(); {27964#true} is VALID [2022-04-08 08:17:48,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {27964#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {27964#true} is VALID [2022-04-08 08:17:48,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {27964#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {27964#true} is VALID [2022-04-08 08:17:48,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {27964#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {27964#true} is VALID [2022-04-08 08:17:48,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {27964#true} assume !(0 != ~p1~0); {27964#true} is VALID [2022-04-08 08:17:48,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {27964#true} assume !(0 != ~p2~0); {27964#true} is VALID [2022-04-08 08:17:48,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {27964#true} assume !(0 != ~p3~0); {27964#true} is VALID [2022-04-08 08:17:48,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {27964#true} assume !(0 != ~p4~0); {27964#true} is VALID [2022-04-08 08:17:48,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {27964#true} assume !(0 != ~p5~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:48,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:48,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:48,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:48,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:48,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p10~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:48,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:48,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:48,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p1~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:48,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p2~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:48,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p3~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:48,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p4~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-08 08:17:48,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p5~0; {27965#false} is VALID [2022-04-08 08:17:48,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {27965#false} assume 1 != ~lk5~0; {27965#false} is VALID [2022-04-08 08:17:48,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {27965#false} assume !false; {27965#false} is VALID [2022-04-08 08:17:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:48,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:48,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166247787] [2022-04-08 08:17:48,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166247787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:48,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:48,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:48,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:48,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [588365515] [2022-04-08 08:17:48,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [588365515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:48,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:48,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:48,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529862856] [2022-04-08 08:17:48,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:48,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:17:48,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:48,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:48,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:48,075 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:48,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:48,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:48,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:48,076 INFO L87 Difference]: Start difference. First operand 841 states and 1391 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:48,649 INFO L93 Difference]: Finished difference Result 1981 states and 3297 transitions. [2022-04-08 08:17:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:48,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 08:17:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:48,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2022-04-08 08:17:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:48,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2022-04-08 08:17:48,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 216 transitions. [2022-04-08 08:17:48,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:48,922 INFO L225 Difference]: With dead ends: 1981 [2022-04-08 08:17:48,923 INFO L226 Difference]: Without dead ends: 1163 [2022-04-08 08:17:48,924 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:48,926 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:48,926 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 119 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:17:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-04-08 08:17:49,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1161. [2022-04-08 08:17:49,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:49,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:49,028 INFO L74 IsIncluded]: Start isIncluded. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:49,030 INFO L87 Difference]: Start difference. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:49,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:49,096 INFO L93 Difference]: Finished difference Result 1163 states and 1912 transitions. [2022-04-08 08:17:49,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1912 transitions. [2022-04-08 08:17:49,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:49,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:49,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1163 states. [2022-04-08 08:17:49,102 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1163 states. [2022-04-08 08:17:49,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:49,168 INFO L93 Difference]: Finished difference Result 1163 states and 1912 transitions. [2022-04-08 08:17:49,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1912 transitions. [2022-04-08 08:17:49,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:49,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:49,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:49,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1911 transitions. [2022-04-08 08:17:49,280 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1911 transitions. Word has length 27 [2022-04-08 08:17:49,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:49,281 INFO L478 AbstractCegarLoop]: Abstraction has 1161 states and 1911 transitions. [2022-04-08 08:17:49,284 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:49,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1161 states and 1911 transitions. [2022-04-08 08:17:51,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1911 edges. 1911 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1911 transitions. [2022-04-08 08:17:51,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:17:51,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:51,214 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:51,214 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:17:51,215 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:51,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:51,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1772799826, now seen corresponding path program 1 times [2022-04-08 08:17:51,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:51,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [618666929] [2022-04-08 08:17:51,216 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:51,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1772799826, now seen corresponding path program 2 times [2022-04-08 08:17:51,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:51,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513833035] [2022-04-08 08:17:51,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:51,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:51,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:51,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {36592#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {36586#true} is VALID [2022-04-08 08:17:51,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {36586#true} assume true; {36586#true} is VALID [2022-04-08 08:17:51,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36586#true} {36586#true} #234#return; {36586#true} is VALID [2022-04-08 08:17:51,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {36586#true} call ULTIMATE.init(); {36592#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:51,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {36592#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {36586#true} is VALID [2022-04-08 08:17:51,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {36586#true} assume true; {36586#true} is VALID [2022-04-08 08:17:51,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36586#true} {36586#true} #234#return; {36586#true} is VALID [2022-04-08 08:17:51,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {36586#true} call #t~ret17 := main(); {36586#true} is VALID [2022-04-08 08:17:51,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {36586#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {36586#true} is VALID [2022-04-08 08:17:51,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {36586#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {36586#true} is VALID [2022-04-08 08:17:51,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {36586#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {36586#true} is VALID [2022-04-08 08:17:51,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {36586#true} assume !(0 != ~p1~0); {36586#true} is VALID [2022-04-08 08:17:51,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {36586#true} assume !(0 != ~p2~0); {36586#true} is VALID [2022-04-08 08:17:51,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {36586#true} assume !(0 != ~p3~0); {36586#true} is VALID [2022-04-08 08:17:51,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {36586#true} assume !(0 != ~p4~0); {36586#true} is VALID [2022-04-08 08:17:51,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {36586#true} assume 0 != ~p5~0;~lk5~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:51,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:51,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:51,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:51,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:51,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {36591#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:51,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:51,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:51,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {36591#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:51,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {36591#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:51,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {36591#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:51,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {36591#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:17:51,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {36587#false} is VALID [2022-04-08 08:17:51,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {36587#false} assume 0 != ~p6~0; {36587#false} is VALID [2022-04-08 08:17:51,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {36587#false} assume 1 != ~lk6~0; {36587#false} is VALID [2022-04-08 08:17:51,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {36587#false} assume !false; {36587#false} is VALID [2022-04-08 08:17:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:51,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:51,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513833035] [2022-04-08 08:17:51,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513833035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:51,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:51,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:51,266 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:51,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [618666929] [2022-04-08 08:17:51,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [618666929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:51,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:51,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:51,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376808442] [2022-04-08 08:17:51,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:51,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:17:51,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:51,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:51,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:51,295 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:51,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:51,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:51,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:51,297 INFO L87 Difference]: Start difference. First operand 1161 states and 1911 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:51,714 INFO L93 Difference]: Finished difference Result 1741 states and 2857 transitions. [2022-04-08 08:17:51,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:51,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:17:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:51,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-08 08:17:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-08 08:17:51,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2022-04-08 08:17:51,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:51,929 INFO L225 Difference]: With dead ends: 1741 [2022-04-08 08:17:51,929 INFO L226 Difference]: Without dead ends: 1179 [2022-04-08 08:17:51,930 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:51,931 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:51,931 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 121 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:17:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-04-08 08:17:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1177. [2022-04-08 08:17:52,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:52,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:52,047 INFO L74 IsIncluded]: Start isIncluded. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:52,049 INFO L87 Difference]: Start difference. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:52,112 INFO L93 Difference]: Finished difference Result 1179 states and 1912 transitions. [2022-04-08 08:17:52,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1912 transitions. [2022-04-08 08:17:52,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:52,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:52,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1179 states. [2022-04-08 08:17:52,118 INFO L87 Difference]: Start difference. First operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1179 states. [2022-04-08 08:17:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:52,174 INFO L93 Difference]: Finished difference Result 1179 states and 1912 transitions. [2022-04-08 08:17:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1912 transitions. [2022-04-08 08:17:52,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:52,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:52,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:52,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1911 transitions. [2022-04-08 08:17:52,246 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1911 transitions. Word has length 28 [2022-04-08 08:17:52,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:52,246 INFO L478 AbstractCegarLoop]: Abstraction has 1177 states and 1911 transitions. [2022-04-08 08:17:52,247 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:52,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1177 states and 1911 transitions. [2022-04-08 08:17:54,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1911 edges. 1911 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1911 transitions. [2022-04-08 08:17:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:17:54,084 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:54,084 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:54,084 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:17:54,084 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:54,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1501099116, now seen corresponding path program 1 times [2022-04-08 08:17:54,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:54,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [259178360] [2022-04-08 08:17:54,087 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:54,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1501099116, now seen corresponding path program 2 times [2022-04-08 08:17:54,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:54,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125981721] [2022-04-08 08:17:54,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:54,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:54,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:54,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {44798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {44792#true} is VALID [2022-04-08 08:17:54,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {44792#true} assume true; {44792#true} is VALID [2022-04-08 08:17:54,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44792#true} {44792#true} #234#return; {44792#true} is VALID [2022-04-08 08:17:54,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {44792#true} call ULTIMATE.init(); {44798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:54,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {44798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {44792#true} is VALID [2022-04-08 08:17:54,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {44792#true} assume true; {44792#true} is VALID [2022-04-08 08:17:54,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44792#true} {44792#true} #234#return; {44792#true} is VALID [2022-04-08 08:17:54,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {44792#true} call #t~ret17 := main(); {44792#true} is VALID [2022-04-08 08:17:54,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {44792#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {44792#true} is VALID [2022-04-08 08:17:54,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {44792#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {44792#true} is VALID [2022-04-08 08:17:54,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {44792#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {44792#true} is VALID [2022-04-08 08:17:54,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {44792#true} assume !(0 != ~p1~0); {44792#true} is VALID [2022-04-08 08:17:54,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {44792#true} assume !(0 != ~p2~0); {44792#true} is VALID [2022-04-08 08:17:54,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {44792#true} assume !(0 != ~p3~0); {44792#true} is VALID [2022-04-08 08:17:54,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {44792#true} assume !(0 != ~p4~0); {44792#true} is VALID [2022-04-08 08:17:54,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {44792#true} assume !(0 != ~p5~0); {44792#true} is VALID [2022-04-08 08:17:54,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {44792#true} assume 0 != ~p6~0;~lk6~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:54,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:54,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:54,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:54,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:54,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:54,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:54,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:54,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:54,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:54,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:54,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:54,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p6~0; {44797#(= main_~lk6~0 1)} is VALID [2022-04-08 08:17:54,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {44797#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {44793#false} is VALID [2022-04-08 08:17:54,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {44793#false} assume !false; {44793#false} is VALID [2022-04-08 08:17:54,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:54,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:54,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125981721] [2022-04-08 08:17:54,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125981721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:54,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:54,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:54,142 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:54,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [259178360] [2022-04-08 08:17:54,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [259178360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:54,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:54,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:54,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410993663] [2022-04-08 08:17:54,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:54,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:17:54,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:54,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:54,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:54,160 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:54,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:54,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:54,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:54,161 INFO L87 Difference]: Start difference. First operand 1177 states and 1911 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:54,807 INFO L93 Difference]: Finished difference Result 2125 states and 3513 transitions. [2022-04-08 08:17:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:54,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:17:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-08 08:17:54,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-08 08:17:54,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-08 08:17:54,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:55,169 INFO L225 Difference]: With dead ends: 2125 [2022-04-08 08:17:55,169 INFO L226 Difference]: Without dead ends: 2123 [2022-04-08 08:17:55,170 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:55,170 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:55,170 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 85 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:17:55,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-04-08 08:17:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1673. [2022-04-08 08:17:55,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:55,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:55,341 INFO L74 IsIncluded]: Start isIncluded. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:55,343 INFO L87 Difference]: Start difference. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:55,545 INFO L93 Difference]: Finished difference Result 2123 states and 3480 transitions. [2022-04-08 08:17:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3480 transitions. [2022-04-08 08:17:55,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:55,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:55,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2123 states. [2022-04-08 08:17:55,553 INFO L87 Difference]: Start difference. First operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2123 states. [2022-04-08 08:17:55,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:55,746 INFO L93 Difference]: Finished difference Result 2123 states and 3480 transitions. [2022-04-08 08:17:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3480 transitions. [2022-04-08 08:17:55,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:55,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:55,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:55,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2647 transitions. [2022-04-08 08:17:55,972 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2647 transitions. Word has length 28 [2022-04-08 08:17:55,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:55,972 INFO L478 AbstractCegarLoop]: Abstraction has 1673 states and 2647 transitions. [2022-04-08 08:17:55,972 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:55,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1673 states and 2647 transitions. [2022-04-08 08:17:58,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2647 edges. 2647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2647 transitions. [2022-04-08 08:17:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 08:17:58,524 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:58,524 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:58,524 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:17:58,524 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:58,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:58,524 INFO L85 PathProgramCache]: Analyzing trace with hash 221235438, now seen corresponding path program 1 times [2022-04-08 08:17:58,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:58,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1696801213] [2022-04-08 08:17:58,525 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:58,525 INFO L85 PathProgramCache]: Analyzing trace with hash 221235438, now seen corresponding path program 2 times [2022-04-08 08:17:58,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:58,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797539246] [2022-04-08 08:17:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:58,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:58,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:58,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {56652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {56646#true} is VALID [2022-04-08 08:17:58,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {56646#true} assume true; {56646#true} is VALID [2022-04-08 08:17:58,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56646#true} {56646#true} #234#return; {56646#true} is VALID [2022-04-08 08:17:58,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {56646#true} call ULTIMATE.init(); {56652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:58,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {56652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {56646#true} is VALID [2022-04-08 08:17:58,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {56646#true} assume true; {56646#true} is VALID [2022-04-08 08:17:58,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56646#true} {56646#true} #234#return; {56646#true} is VALID [2022-04-08 08:17:58,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {56646#true} call #t~ret17 := main(); {56646#true} is VALID [2022-04-08 08:17:58,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {56646#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {56646#true} is VALID [2022-04-08 08:17:58,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {56646#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {56646#true} is VALID [2022-04-08 08:17:58,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {56646#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {56646#true} is VALID [2022-04-08 08:17:58,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {56646#true} assume !(0 != ~p1~0); {56646#true} is VALID [2022-04-08 08:17:58,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {56646#true} assume !(0 != ~p2~0); {56646#true} is VALID [2022-04-08 08:17:58,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {56646#true} assume !(0 != ~p3~0); {56646#true} is VALID [2022-04-08 08:17:58,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {56646#true} assume !(0 != ~p4~0); {56646#true} is VALID [2022-04-08 08:17:58,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {56646#true} assume !(0 != ~p5~0); {56646#true} is VALID [2022-04-08 08:17:58,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {56646#true} assume !(0 != ~p6~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:58,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {56651#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:58,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {56651#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:58,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {56651#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:58,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p10~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:58,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {56651#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:58,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {56651#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:58,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p1~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:58,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p2~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:58,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p3~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:58,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p4~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:58,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p5~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-08 08:17:58,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p6~0; {56647#false} is VALID [2022-04-08 08:17:58,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {56647#false} assume 1 != ~lk6~0; {56647#false} is VALID [2022-04-08 08:17:58,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {56647#false} assume !false; {56647#false} is VALID [2022-04-08 08:17:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:58,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:58,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797539246] [2022-04-08 08:17:58,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797539246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:58,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:58,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:58,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:58,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1696801213] [2022-04-08 08:17:58,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1696801213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:58,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:58,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:58,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137465224] [2022-04-08 08:17:58,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:58,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:17:58,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:58,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:58,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:58,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:58,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:58,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:58,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:58,590 INFO L87 Difference]: Start difference. First operand 1673 states and 2647 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:59,679 INFO L93 Difference]: Finished difference Result 3917 states and 6233 transitions. [2022-04-08 08:17:59,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:59,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 08:17:59,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2022-04-08 08:17:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2022-04-08 08:17:59,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 213 transitions. [2022-04-08 08:17:59,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:00,100 INFO L225 Difference]: With dead ends: 3917 [2022-04-08 08:18:00,100 INFO L226 Difference]: Without dead ends: 2283 [2022-04-08 08:18:00,103 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:18:00,104 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:18:00,104 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 121 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:18:00,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2022-04-08 08:18:00,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2281. [2022-04-08 08:18:00,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:00,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:00,344 INFO L74 IsIncluded]: Start isIncluded. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:00,347 INFO L87 Difference]: Start difference. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:00,577 INFO L93 Difference]: Finished difference Result 2283 states and 3592 transitions. [2022-04-08 08:18:00,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3592 transitions. [2022-04-08 08:18:00,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:00,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:00,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2283 states. [2022-04-08 08:18:00,585 INFO L87 Difference]: Start difference. First operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2283 states. [2022-04-08 08:18:00,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:00,752 INFO L93 Difference]: Finished difference Result 2283 states and 3592 transitions. [2022-04-08 08:18:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3592 transitions. [2022-04-08 08:18:00,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:00,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:00,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:00,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3591 transitions. [2022-04-08 08:18:01,023 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3591 transitions. Word has length 28 [2022-04-08 08:18:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:01,023 INFO L478 AbstractCegarLoop]: Abstraction has 2281 states and 3591 transitions. [2022-04-08 08:18:01,023 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:01,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2281 states and 3591 transitions. [2022-04-08 08:18:04,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3591 edges. 3591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3591 transitions. [2022-04-08 08:18:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 08:18:04,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:04,590 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:18:04,590 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:18:04,590 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:04,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:04,591 INFO L85 PathProgramCache]: Analyzing trace with hash -710353220, now seen corresponding path program 1 times [2022-04-08 08:18:04,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:04,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1933569868] [2022-04-08 08:18:04,591 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:04,591 INFO L85 PathProgramCache]: Analyzing trace with hash -710353220, now seen corresponding path program 2 times [2022-04-08 08:18:04,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:04,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900049695] [2022-04-08 08:18:04,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:04,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:04,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:04,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {73626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {73620#true} is VALID [2022-04-08 08:18:04,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {73620#true} assume true; {73620#true} is VALID [2022-04-08 08:18:04,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73620#true} {73620#true} #234#return; {73620#true} is VALID [2022-04-08 08:18:04,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {73620#true} call ULTIMATE.init(); {73626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:18:04,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {73626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {73620#true} is VALID [2022-04-08 08:18:04,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {73620#true} assume true; {73620#true} is VALID [2022-04-08 08:18:04,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73620#true} {73620#true} #234#return; {73620#true} is VALID [2022-04-08 08:18:04,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {73620#true} call #t~ret17 := main(); {73620#true} is VALID [2022-04-08 08:18:04,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {73620#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {73620#true} is VALID [2022-04-08 08:18:04,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {73620#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {73620#true} is VALID [2022-04-08 08:18:04,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {73620#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {73620#true} is VALID [2022-04-08 08:18:04,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {73620#true} assume !(0 != ~p1~0); {73620#true} is VALID [2022-04-08 08:18:04,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {73620#true} assume !(0 != ~p2~0); {73620#true} is VALID [2022-04-08 08:18:04,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {73620#true} assume !(0 != ~p3~0); {73620#true} is VALID [2022-04-08 08:18:04,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {73620#true} assume !(0 != ~p4~0); {73620#true} is VALID [2022-04-08 08:18:04,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {73620#true} assume !(0 != ~p5~0); {73620#true} is VALID [2022-04-08 08:18:04,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {73620#true} assume 0 != ~p6~0;~lk6~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:04,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:04,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:04,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:04,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:04,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:04,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:04,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:04,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:04,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:04,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:04,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:18:04,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {73621#false} is VALID [2022-04-08 08:18:04,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {73621#false} assume 0 != ~p7~0; {73621#false} is VALID [2022-04-08 08:18:04,643 INFO L290 TraceCheckUtils]: 27: Hoare triple {73621#false} assume 1 != ~lk7~0; {73621#false} is VALID [2022-04-08 08:18:04,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {73621#false} assume !false; {73621#false} is VALID [2022-04-08 08:18:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:18:04,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:04,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900049695] [2022-04-08 08:18:04,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900049695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:04,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:04,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:04,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:04,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1933569868] [2022-04-08 08:18:04,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1933569868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:04,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:04,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:04,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081743339] [2022-04-08 08:18:04,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:04,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 08:18:04,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:04,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:04,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:04,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:04,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:04,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:04,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:04,666 INFO L87 Difference]: Start difference. First operand 2281 states and 3591 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:05,555 INFO L93 Difference]: Finished difference Result 3421 states and 5369 transitions. [2022-04-08 08:18:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:05,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 08:18:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-08 08:18:05,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-08 08:18:05,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2022-04-08 08:18:05,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:05,907 INFO L225 Difference]: With dead ends: 3421 [2022-04-08 08:18:05,908 INFO L226 Difference]: Without dead ends: 2315 [2022-04-08 08:18:05,909 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:18:05,910 INFO L913 BasicCegarLoop]: 111 mSDtfsCounter, 152 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:18:05,910 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 118 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:18:05,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-04-08 08:18:06,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2313. [2022-04-08 08:18:06,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:06,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:06,183 INFO L74 IsIncluded]: Start isIncluded. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:06,186 INFO L87 Difference]: Start difference. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:06,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:06,366 INFO L93 Difference]: Finished difference Result 2315 states and 3592 transitions. [2022-04-08 08:18:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3592 transitions. [2022-04-08 08:18:06,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:06,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:06,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2315 states. [2022-04-08 08:18:06,373 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2315 states. [2022-04-08 08:18:06,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:06,552 INFO L93 Difference]: Finished difference Result 2315 states and 3592 transitions. [2022-04-08 08:18:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3592 transitions. [2022-04-08 08:18:06,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:06,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:06,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:06,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:06,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3591 transitions. [2022-04-08 08:18:06,859 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3591 transitions. Word has length 29 [2022-04-08 08:18:06,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:06,859 INFO L478 AbstractCegarLoop]: Abstraction has 2313 states and 3591 transitions. [2022-04-08 08:18:06,859 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:06,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2313 states and 3591 transitions. [2022-04-08 08:18:10,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3591 edges. 3591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3591 transitions. [2022-04-08 08:18:10,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 08:18:10,527 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:10,527 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:18:10,528 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:18:10,528 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:10,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1731421574, now seen corresponding path program 1 times [2022-04-08 08:18:10,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:10,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1040917721] [2022-04-08 08:18:10,528 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1731421574, now seen corresponding path program 2 times [2022-04-08 08:18:10,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:10,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044482073] [2022-04-08 08:18:10,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:10,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:10,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:10,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {89736#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {89730#true} is VALID [2022-04-08 08:18:10,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {89730#true} assume true; {89730#true} is VALID [2022-04-08 08:18:10,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89730#true} {89730#true} #234#return; {89730#true} is VALID [2022-04-08 08:18:10,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {89730#true} call ULTIMATE.init(); {89736#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:18:10,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {89736#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {89730#true} is VALID [2022-04-08 08:18:10,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {89730#true} assume true; {89730#true} is VALID [2022-04-08 08:18:10,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89730#true} {89730#true} #234#return; {89730#true} is VALID [2022-04-08 08:18:10,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {89730#true} call #t~ret17 := main(); {89730#true} is VALID [2022-04-08 08:18:10,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {89730#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {89730#true} is VALID [2022-04-08 08:18:10,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {89730#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {89730#true} is VALID [2022-04-08 08:18:10,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {89730#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {89730#true} is VALID [2022-04-08 08:18:10,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {89730#true} assume !(0 != ~p1~0); {89730#true} is VALID [2022-04-08 08:18:10,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {89730#true} assume !(0 != ~p2~0); {89730#true} is VALID [2022-04-08 08:18:10,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {89730#true} assume !(0 != ~p3~0); {89730#true} is VALID [2022-04-08 08:18:10,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {89730#true} assume !(0 != ~p4~0); {89730#true} is VALID [2022-04-08 08:18:10,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {89730#true} assume !(0 != ~p5~0); {89730#true} is VALID [2022-04-08 08:18:10,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {89730#true} assume !(0 != ~p6~0); {89730#true} is VALID [2022-04-08 08:18:10,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {89730#true} assume 0 != ~p7~0;~lk7~0 := 1; {89735#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:10,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {89735#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:10,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {89735#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:10,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:10,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {89735#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:10,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {89735#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:10,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:10,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:10,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:10,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:10,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:10,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:10,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p7~0; {89735#(= main_~lk7~0 1)} is VALID [2022-04-08 08:18:10,576 INFO L290 TraceCheckUtils]: 27: Hoare triple {89735#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {89731#false} is VALID [2022-04-08 08:18:10,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {89731#false} assume !false; {89731#false} is VALID [2022-04-08 08:18:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:18:10,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:10,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044482073] [2022-04-08 08:18:10,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044482073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:10,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:10,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:10,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:10,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1040917721] [2022-04-08 08:18:10,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1040917721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:10,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:10,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:10,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370622423] [2022-04-08 08:18:10,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:10,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 08:18:10,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:10,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:10,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:10,596 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:10,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:10,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:10,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:10,597 INFO L87 Difference]: Start difference. First operand 2313 states and 3591 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:11,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:11,939 INFO L93 Difference]: Finished difference Result 4109 states and 6505 transitions. [2022-04-08 08:18:11,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:11,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 08:18:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:11,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-08 08:18:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-08 08:18:11,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2022-04-08 08:18:12,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:12,795 INFO L225 Difference]: With dead ends: 4109 [2022-04-08 08:18:12,795 INFO L226 Difference]: Without dead ends: 4107 [2022-04-08 08:18:12,796 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:18:12,796 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:18:12,797 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 84 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:18:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-04-08 08:18:13,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 3337. [2022-04-08 08:18:13,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:13,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:13,113 INFO L74 IsIncluded]: Start isIncluded. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:13,116 INFO L87 Difference]: Start difference. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:13,733 INFO L93 Difference]: Finished difference Result 4107 states and 6440 transitions. [2022-04-08 08:18:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6440 transitions. [2022-04-08 08:18:13,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:13,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:13,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4107 states. [2022-04-08 08:18:13,749 INFO L87 Difference]: Start difference. First operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4107 states. [2022-04-08 08:18:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:14,297 INFO L93 Difference]: Finished difference Result 4107 states and 6440 transitions. [2022-04-08 08:18:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6440 transitions. [2022-04-08 08:18:14,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:14,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:14,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:14,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:14,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 5031 transitions. [2022-04-08 08:18:14,957 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 5031 transitions. Word has length 29 [2022-04-08 08:18:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:14,957 INFO L478 AbstractCegarLoop]: Abstraction has 3337 states and 5031 transitions. [2022-04-08 08:18:14,957 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:14,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3337 states and 5031 transitions. [2022-04-08 08:18:20,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5031 edges. 5031 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 5031 transitions. [2022-04-08 08:18:20,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 08:18:20,060 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:20,060 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:18:20,060 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:18:20,060 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:20,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:20,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1283682044, now seen corresponding path program 1 times [2022-04-08 08:18:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:20,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1717982923] [2022-04-08 08:18:20,061 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:20,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1283682044, now seen corresponding path program 2 times [2022-04-08 08:18:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:20,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716939536] [2022-04-08 08:18:20,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:20,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:20,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:20,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {112854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {112848#true} is VALID [2022-04-08 08:18:20,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {112848#true} assume true; {112848#true} is VALID [2022-04-08 08:18:20,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {112848#true} {112848#true} #234#return; {112848#true} is VALID [2022-04-08 08:18:20,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {112848#true} call ULTIMATE.init(); {112854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:18:20,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {112854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {112848#true} is VALID [2022-04-08 08:18:20,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {112848#true} assume true; {112848#true} is VALID [2022-04-08 08:18:20,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {112848#true} {112848#true} #234#return; {112848#true} is VALID [2022-04-08 08:18:20,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {112848#true} call #t~ret17 := main(); {112848#true} is VALID [2022-04-08 08:18:20,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {112848#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {112848#true} is VALID [2022-04-08 08:18:20,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {112848#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {112848#true} is VALID [2022-04-08 08:18:20,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {112848#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {112848#true} is VALID [2022-04-08 08:18:20,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {112848#true} assume !(0 != ~p1~0); {112848#true} is VALID [2022-04-08 08:18:20,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {112848#true} assume !(0 != ~p2~0); {112848#true} is VALID [2022-04-08 08:18:20,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {112848#true} assume !(0 != ~p3~0); {112848#true} is VALID [2022-04-08 08:18:20,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {112848#true} assume !(0 != ~p4~0); {112848#true} is VALID [2022-04-08 08:18:20,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {112848#true} assume !(0 != ~p5~0); {112848#true} is VALID [2022-04-08 08:18:20,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {112848#true} assume !(0 != ~p6~0); {112848#true} is VALID [2022-04-08 08:18:20,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {112848#true} assume !(0 != ~p7~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:20,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {112853#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:20,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {112853#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:20,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p10~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:20,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {112853#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:20,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {112853#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:20,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p1~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:20,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p2~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:20,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p3~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:20,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p4~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:20,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p5~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:20,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p6~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-08 08:18:20,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p7~0; {112849#false} is VALID [2022-04-08 08:18:20,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {112849#false} assume 1 != ~lk7~0; {112849#false} is VALID [2022-04-08 08:18:20,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {112849#false} assume !false; {112849#false} is VALID [2022-04-08 08:18:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:18:20,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:20,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716939536] [2022-04-08 08:18:20,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716939536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:20,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:20,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:20,131 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:20,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1717982923] [2022-04-08 08:18:20,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1717982923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:20,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:20,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:20,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962088211] [2022-04-08 08:18:20,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:20,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 08:18:20,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:20,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:20,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:20,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:20,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:20,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:20,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:20,150 INFO L87 Difference]: Start difference. First operand 3337 states and 5031 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:23,663 INFO L93 Difference]: Finished difference Result 7757 states and 11753 transitions. [2022-04-08 08:18:23,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:23,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 08:18:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-08 08:18:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-08 08:18:23,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 210 transitions. [2022-04-08 08:18:23,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:24,648 INFO L225 Difference]: With dead ends: 7757 [2022-04-08 08:18:24,648 INFO L226 Difference]: Without dead ends: 4491 [2022-04-08 08:18:24,653 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:18:24,654 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:18:24,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 123 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:18:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-04-08 08:18:25,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4489. [2022-04-08 08:18:25,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:25,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:25,035 INFO L74 IsIncluded]: Start isIncluded. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:25,038 INFO L87 Difference]: Start difference. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:25,722 INFO L93 Difference]: Finished difference Result 4491 states and 6728 transitions. [2022-04-08 08:18:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6728 transitions. [2022-04-08 08:18:25,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:25,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:25,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4491 states. [2022-04-08 08:18:25,739 INFO L87 Difference]: Start difference. First operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4491 states. [2022-04-08 08:18:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:26,455 INFO L93 Difference]: Finished difference Result 4491 states and 6728 transitions. [2022-04-08 08:18:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6728 transitions. [2022-04-08 08:18:26,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:26,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:26,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:26,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 6727 transitions. [2022-04-08 08:18:27,582 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 6727 transitions. Word has length 29 [2022-04-08 08:18:27,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:27,590 INFO L478 AbstractCegarLoop]: Abstraction has 4489 states and 6727 transitions. [2022-04-08 08:18:27,590 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:27,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4489 states and 6727 transitions. [2022-04-08 08:18:34,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6727 edges. 6727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:34,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 6727 transitions. [2022-04-08 08:18:34,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:18:34,734 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:34,734 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:18:34,734 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:18:34,734 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:34,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:34,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2134246461, now seen corresponding path program 1 times [2022-04-08 08:18:34,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:34,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [820141656] [2022-04-08 08:18:34,735 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:34,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2134246461, now seen corresponding path program 2 times [2022-04-08 08:18:34,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:34,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776630330] [2022-04-08 08:18:34,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:34,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:34,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:34,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {146340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {146334#true} is VALID [2022-04-08 08:18:34,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {146334#true} assume true; {146334#true} is VALID [2022-04-08 08:18:34,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146334#true} {146334#true} #234#return; {146334#true} is VALID [2022-04-08 08:18:34,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {146334#true} call ULTIMATE.init(); {146340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:18:34,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {146340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {146334#true} is VALID [2022-04-08 08:18:34,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {146334#true} assume true; {146334#true} is VALID [2022-04-08 08:18:34,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146334#true} {146334#true} #234#return; {146334#true} is VALID [2022-04-08 08:18:34,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {146334#true} call #t~ret17 := main(); {146334#true} is VALID [2022-04-08 08:18:34,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {146334#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {146334#true} is VALID [2022-04-08 08:18:34,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {146334#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {146334#true} is VALID [2022-04-08 08:18:34,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {146334#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {146334#true} is VALID [2022-04-08 08:18:34,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {146334#true} assume !(0 != ~p1~0); {146334#true} is VALID [2022-04-08 08:18:34,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {146334#true} assume !(0 != ~p2~0); {146334#true} is VALID [2022-04-08 08:18:34,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {146334#true} assume !(0 != ~p3~0); {146334#true} is VALID [2022-04-08 08:18:34,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {146334#true} assume !(0 != ~p4~0); {146334#true} is VALID [2022-04-08 08:18:34,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {146334#true} assume !(0 != ~p5~0); {146334#true} is VALID [2022-04-08 08:18:34,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {146334#true} assume !(0 != ~p6~0); {146334#true} is VALID [2022-04-08 08:18:34,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {146334#true} assume 0 != ~p7~0;~lk7~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:34,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {146339#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:34,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {146339#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:34,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:34,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {146339#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:34,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {146339#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:34,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:34,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:34,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:34,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:34,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:34,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:18:34,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {146335#false} is VALID [2022-04-08 08:18:34,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {146335#false} assume 0 != ~p8~0; {146335#false} is VALID [2022-04-08 08:18:34,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {146335#false} assume 1 != ~lk8~0; {146335#false} is VALID [2022-04-08 08:18:34,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {146335#false} assume !false; {146335#false} is VALID [2022-04-08 08:18:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:18:34,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:34,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776630330] [2022-04-08 08:18:34,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776630330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:34,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:34,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:34,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:34,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [820141656] [2022-04-08 08:18:34,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [820141656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:34,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:34,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:34,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316454500] [2022-04-08 08:18:34,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:34,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 08:18:34,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:34,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:34,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:34,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:34,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:34,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:34,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:34,816 INFO L87 Difference]: Start difference. First operand 4489 states and 6727 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:37,678 INFO L93 Difference]: Finished difference Result 6733 states and 10057 transitions. [2022-04-08 08:18:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:37,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 08:18:37,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-08 08:18:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-08 08:18:37,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 205 transitions. [2022-04-08 08:18:37,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:38,761 INFO L225 Difference]: With dead ends: 6733 [2022-04-08 08:18:38,761 INFO L226 Difference]: Without dead ends: 4555 [2022-04-08 08:18:38,765 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:18:38,765 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:18:38,765 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 115 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:18:38,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2022-04-08 08:18:39,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 4553. [2022-04-08 08:18:39,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:39,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:39,150 INFO L74 IsIncluded]: Start isIncluded. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:39,154 INFO L87 Difference]: Start difference. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:39,824 INFO L93 Difference]: Finished difference Result 4555 states and 6728 transitions. [2022-04-08 08:18:39,824 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6728 transitions. [2022-04-08 08:18:39,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:39,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:39,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4555 states. [2022-04-08 08:18:39,841 INFO L87 Difference]: Start difference. First operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4555 states. [2022-04-08 08:18:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:40,521 INFO L93 Difference]: Finished difference Result 4555 states and 6728 transitions. [2022-04-08 08:18:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6728 transitions. [2022-04-08 08:18:40,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:40,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:40,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:18:40,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:18:40,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4553 states to 4553 states and 6727 transitions. [2022-04-08 08:18:41,550 INFO L78 Accepts]: Start accepts. Automaton has 4553 states and 6727 transitions. Word has length 30 [2022-04-08 08:18:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:18:41,550 INFO L478 AbstractCegarLoop]: Abstraction has 4553 states and 6727 transitions. [2022-04-08 08:18:41,550 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:41,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4553 states and 6727 transitions. [2022-04-08 08:18:48,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6727 edges. 6727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4553 states and 6727 transitions. [2022-04-08 08:18:48,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:18:48,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:18:48,635 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:18:48,636 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 08:18:48,636 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:18:48,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:18:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1139652481, now seen corresponding path program 1 times [2022-04-08 08:18:48,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:48,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2024344722] [2022-04-08 08:18:48,636 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:18:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1139652481, now seen corresponding path program 2 times [2022-04-08 08:18:48,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:18:48,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447281575] [2022-04-08 08:18:48,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:18:48,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:18:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:48,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:18:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:18:48,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {178034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {178028#true} is VALID [2022-04-08 08:18:48,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {178028#true} assume true; {178028#true} is VALID [2022-04-08 08:18:48,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {178028#true} {178028#true} #234#return; {178028#true} is VALID [2022-04-08 08:18:48,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {178028#true} call ULTIMATE.init(); {178034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:18:48,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {178034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {178028#true} is VALID [2022-04-08 08:18:48,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {178028#true} assume true; {178028#true} is VALID [2022-04-08 08:18:48,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178028#true} {178028#true} #234#return; {178028#true} is VALID [2022-04-08 08:18:48,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {178028#true} call #t~ret17 := main(); {178028#true} is VALID [2022-04-08 08:18:48,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {178028#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {178028#true} is VALID [2022-04-08 08:18:48,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {178028#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {178028#true} is VALID [2022-04-08 08:18:48,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {178028#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {178028#true} is VALID [2022-04-08 08:18:48,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {178028#true} assume !(0 != ~p1~0); {178028#true} is VALID [2022-04-08 08:18:48,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {178028#true} assume !(0 != ~p2~0); {178028#true} is VALID [2022-04-08 08:18:48,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {178028#true} assume !(0 != ~p3~0); {178028#true} is VALID [2022-04-08 08:18:48,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {178028#true} assume !(0 != ~p4~0); {178028#true} is VALID [2022-04-08 08:18:48,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {178028#true} assume !(0 != ~p5~0); {178028#true} is VALID [2022-04-08 08:18:48,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {178028#true} assume !(0 != ~p6~0); {178028#true} is VALID [2022-04-08 08:18:48,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {178028#true} assume !(0 != ~p7~0); {178028#true} is VALID [2022-04-08 08:18:48,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {178028#true} assume 0 != ~p8~0;~lk8~0 := 1; {178033#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:48,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {178033#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {178033#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:48,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:48,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {178033#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {178033#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:48,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {178033#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {178033#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:48,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:48,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:48,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:48,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:48,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:48,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:48,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:48,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {178033#(= main_~lk8~0 1)} assume 0 != ~p8~0; {178033#(= main_~lk8~0 1)} is VALID [2022-04-08 08:18:48,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {178033#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {178029#false} is VALID [2022-04-08 08:18:48,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {178029#false} assume !false; {178029#false} is VALID [2022-04-08 08:18:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:18:48,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:18:48,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447281575] [2022-04-08 08:18:48,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447281575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:48,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:48,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:48,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:18:48,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2024344722] [2022-04-08 08:18:48,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2024344722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:18:48,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:18:48,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:18:48,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623276296] [2022-04-08 08:18:48,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:18:48,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 08:18:48,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:18:48,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:48,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:48,721 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:18:48,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:18:48,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:18:48,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:18:48,722 INFO L87 Difference]: Start difference. First operand 4553 states and 6727 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:52,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:52,590 INFO L93 Difference]: Finished difference Result 7949 states and 11977 transitions. [2022-04-08 08:18:52,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:18:52,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 08:18:52,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:18:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 08:18:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 08:18:52,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-08 08:18:52,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:18:55,553 INFO L225 Difference]: With dead ends: 7949 [2022-04-08 08:18:55,553 INFO L226 Difference]: Without dead ends: 7947 [2022-04-08 08:18:55,554 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:18:55,555 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:18:55,555 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 83 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:18:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states. [2022-04-08 08:18:56,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 6665. [2022-04-08 08:18:56,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:18:56,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:56,106 INFO L74 IsIncluded]: Start isIncluded. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:56,113 INFO L87 Difference]: Start difference. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:18:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:18:58,246 INFO L93 Difference]: Finished difference Result 7947 states and 11848 transitions. [2022-04-08 08:18:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11848 transitions. [2022-04-08 08:18:58,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:18:58,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:18:58,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 7947 states. [2022-04-08 08:18:58,266 INFO L87 Difference]: Start difference. First operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 7947 states. [2022-04-08 08:19:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:00,495 INFO L93 Difference]: Finished difference Result 7947 states and 11848 transitions. [2022-04-08 08:19:00,495 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11848 transitions. [2022-04-08 08:19:00,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:00,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:00,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:00,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 9543 transitions. [2022-04-08 08:19:02,959 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 9543 transitions. Word has length 30 [2022-04-08 08:19:02,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:02,959 INFO L478 AbstractCegarLoop]: Abstraction has 6665 states and 9543 transitions. [2022-04-08 08:19:02,959 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:02,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6665 states and 9543 transitions. [2022-04-08 08:19:13,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9543 edges. 9543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9543 transitions. [2022-04-08 08:19:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:19:13,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:13,189 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:13,189 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 08:19:13,189 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:13,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:13,190 INFO L85 PathProgramCache]: Analyzing trace with hash -140211197, now seen corresponding path program 1 times [2022-04-08 08:19:13,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:13,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1633011421] [2022-04-08 08:19:13,190 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:13,190 INFO L85 PathProgramCache]: Analyzing trace with hash -140211197, now seen corresponding path program 2 times [2022-04-08 08:19:13,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:13,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022047848] [2022-04-08 08:19:13,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:13,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:13,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:13,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {223168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {223162#true} is VALID [2022-04-08 08:19:13,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {223162#true} assume true; {223162#true} is VALID [2022-04-08 08:19:13,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {223162#true} {223162#true} #234#return; {223162#true} is VALID [2022-04-08 08:19:13,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {223162#true} call ULTIMATE.init(); {223168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:13,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {223168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {223162#true} is VALID [2022-04-08 08:19:13,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {223162#true} assume true; {223162#true} is VALID [2022-04-08 08:19:13,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223162#true} {223162#true} #234#return; {223162#true} is VALID [2022-04-08 08:19:13,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {223162#true} call #t~ret17 := main(); {223162#true} is VALID [2022-04-08 08:19:13,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {223162#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {223162#true} is VALID [2022-04-08 08:19:13,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {223162#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {223162#true} is VALID [2022-04-08 08:19:13,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {223162#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {223162#true} is VALID [2022-04-08 08:19:13,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {223162#true} assume !(0 != ~p1~0); {223162#true} is VALID [2022-04-08 08:19:13,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {223162#true} assume !(0 != ~p2~0); {223162#true} is VALID [2022-04-08 08:19:13,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {223162#true} assume !(0 != ~p3~0); {223162#true} is VALID [2022-04-08 08:19:13,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {223162#true} assume !(0 != ~p4~0); {223162#true} is VALID [2022-04-08 08:19:13,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {223162#true} assume !(0 != ~p5~0); {223162#true} is VALID [2022-04-08 08:19:13,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {223162#true} assume !(0 != ~p6~0); {223162#true} is VALID [2022-04-08 08:19:13,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {223162#true} assume !(0 != ~p7~0); {223162#true} is VALID [2022-04-08 08:19:13,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {223162#true} assume !(0 != ~p8~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:13,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {223167#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:13,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p10~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:13,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {223167#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:13,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {223167#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:13,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p1~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:13,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p2~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:13,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p3~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:13,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p4~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:13,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p5~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:13,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p6~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:13,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p7~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-08 08:19:13,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p8~0; {223163#false} is VALID [2022-04-08 08:19:13,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {223163#false} assume 1 != ~lk8~0; {223163#false} is VALID [2022-04-08 08:19:13,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {223163#false} assume !false; {223163#false} is VALID [2022-04-08 08:19:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:13,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:13,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022047848] [2022-04-08 08:19:13,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022047848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:13,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:13,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:13,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:13,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1633011421] [2022-04-08 08:19:13,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1633011421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:13,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:13,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:13,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207675179] [2022-04-08 08:19:13,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:13,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 08:19:13,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:13,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:13,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:13,256 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:13,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:13,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:13,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:13,257 INFO L87 Difference]: Start difference. First operand 6665 states and 9543 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:27,081 INFO L93 Difference]: Finished difference Result 15373 states and 22089 transitions. [2022-04-08 08:19:27,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:27,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 08:19:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-04-08 08:19:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-04-08 08:19:27,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 207 transitions. [2022-04-08 08:19:27,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:30,820 INFO L225 Difference]: With dead ends: 15373 [2022-04-08 08:19:30,821 INFO L226 Difference]: Without dead ends: 8843 [2022-04-08 08:19:30,827 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:30,828 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:30,828 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 125 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:30,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8843 states. [2022-04-08 08:19:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8843 to 8841. [2022-04-08 08:19:31,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:31,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:31,579 INFO L74 IsIncluded]: Start isIncluded. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:31,589 INFO L87 Difference]: Start difference. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:34,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:34,132 INFO L93 Difference]: Finished difference Result 8843 states and 12552 transitions. [2022-04-08 08:19:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12552 transitions. [2022-04-08 08:19:34,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:34,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:34,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8843 states. [2022-04-08 08:19:34,159 INFO L87 Difference]: Start difference. First operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8843 states. [2022-04-08 08:19:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:36,738 INFO L93 Difference]: Finished difference Result 8843 states and 12552 transitions. [2022-04-08 08:19:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12552 transitions. [2022-04-08 08:19:36,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:36,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:36,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:36,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:36,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 12551 transitions. [2022-04-08 08:19:40,771 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 12551 transitions. Word has length 30 [2022-04-08 08:19:40,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:40,771 INFO L478 AbstractCegarLoop]: Abstraction has 8841 states and 12551 transitions. [2022-04-08 08:19:40,771 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:40,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8841 states and 12551 transitions. [2022-04-08 08:19:54,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12551 edges. 12551 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 12551 transitions. [2022-04-08 08:19:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 08:19:54,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:54,589 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:54,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 08:19:54,590 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:54,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:54,590 INFO L85 PathProgramCache]: Analyzing trace with hash 969703665, now seen corresponding path program 1 times [2022-04-08 08:19:54,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:54,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [168307448] [2022-04-08 08:19:54,590 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:54,590 INFO L85 PathProgramCache]: Analyzing trace with hash 969703665, now seen corresponding path program 2 times [2022-04-08 08:19:54,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:54,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066386057] [2022-04-08 08:19:54,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:54,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:54,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:54,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {289294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {289288#true} is VALID [2022-04-08 08:19:54,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {289288#true} assume true; {289288#true} is VALID [2022-04-08 08:19:54,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {289288#true} {289288#true} #234#return; {289288#true} is VALID [2022-04-08 08:19:54,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {289288#true} call ULTIMATE.init(); {289294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:54,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {289294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {289288#true} is VALID [2022-04-08 08:19:54,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {289288#true} assume true; {289288#true} is VALID [2022-04-08 08:19:54,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {289288#true} {289288#true} #234#return; {289288#true} is VALID [2022-04-08 08:19:54,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {289288#true} call #t~ret17 := main(); {289288#true} is VALID [2022-04-08 08:19:54,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {289288#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {289288#true} is VALID [2022-04-08 08:19:54,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {289288#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {289288#true} is VALID [2022-04-08 08:19:54,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {289288#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {289288#true} is VALID [2022-04-08 08:19:54,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {289288#true} assume !(0 != ~p1~0); {289288#true} is VALID [2022-04-08 08:19:54,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {289288#true} assume !(0 != ~p2~0); {289288#true} is VALID [2022-04-08 08:19:54,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {289288#true} assume !(0 != ~p3~0); {289288#true} is VALID [2022-04-08 08:19:54,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {289288#true} assume !(0 != ~p4~0); {289288#true} is VALID [2022-04-08 08:19:54,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {289288#true} assume !(0 != ~p5~0); {289288#true} is VALID [2022-04-08 08:19:54,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {289288#true} assume !(0 != ~p6~0); {289288#true} is VALID [2022-04-08 08:19:54,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {289288#true} assume !(0 != ~p7~0); {289288#true} is VALID [2022-04-08 08:19:54,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {289288#true} assume 0 != ~p8~0;~lk8~0 := 1; {289293#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:54,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {289293#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {289293#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:54,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:54,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {289293#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {289293#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:54,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {289293#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {289293#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:54,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:54,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:54,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:54,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:54,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:54,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:54,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-08 08:19:54,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {289289#false} is VALID [2022-04-08 08:19:54,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {289289#false} assume 0 != ~p9~0; {289289#false} is VALID [2022-04-08 08:19:54,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {289289#false} assume 1 != ~lk9~0; {289289#false} is VALID [2022-04-08 08:19:54,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {289289#false} assume !false; {289289#false} is VALID [2022-04-08 08:19:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:54,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:54,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066386057] [2022-04-08 08:19:54,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066386057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:54,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:54,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:54,633 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:54,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [168307448] [2022-04-08 08:19:54,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [168307448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:54,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:54,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:54,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391848652] [2022-04-08 08:19:54,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:54,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 08:19:54,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:54,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:54,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:54,653 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:54,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:54,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:54,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:54,654 INFO L87 Difference]: Start difference. First operand 8841 states and 12551 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:04,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:04,507 INFO L93 Difference]: Finished difference Result 13261 states and 18761 transitions. [2022-04-08 08:20:04,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:04,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 08:20:04,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:04,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-08 08:20:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-08 08:20:04,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 202 transitions. [2022-04-08 08:20:04,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:08,591 INFO L225 Difference]: With dead ends: 13261 [2022-04-08 08:20:08,592 INFO L226 Difference]: Without dead ends: 8971 [2022-04-08 08:20:08,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:08,597 INFO L913 BasicCegarLoop]: 105 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:08,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 112 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:08,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2022-04-08 08:20:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 8969. [2022-04-08 08:20:09,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:09,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:09,454 INFO L74 IsIncluded]: Start isIncluded. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:09,463 INFO L87 Difference]: Start difference. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:12,032 INFO L93 Difference]: Finished difference Result 8971 states and 12552 transitions. [2022-04-08 08:20:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12552 transitions. [2022-04-08 08:20:12,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:12,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:12,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8971 states. [2022-04-08 08:20:12,068 INFO L87 Difference]: Start difference. First operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8971 states. [2022-04-08 08:20:14,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:14,883 INFO L93 Difference]: Finished difference Result 8971 states and 12552 transitions. [2022-04-08 08:20:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12552 transitions. [2022-04-08 08:20:14,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:14,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:14,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:14,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8969 states to 8969 states and 12551 transitions. [2022-04-08 08:20:19,075 INFO L78 Accepts]: Start accepts. Automaton has 8969 states and 12551 transitions. Word has length 31 [2022-04-08 08:20:19,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:19,076 INFO L478 AbstractCegarLoop]: Abstraction has 8969 states and 12551 transitions. [2022-04-08 08:20:19,076 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:19,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8969 states and 12551 transitions. [2022-04-08 08:20:33,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12551 edges. 12551 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:33,053 INFO L276 IsEmpty]: Start isEmpty. Operand 8969 states and 12551 transitions. [2022-04-08 08:20:33,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 08:20:33,058 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:33,058 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:33,058 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 08:20:33,058 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:33,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:33,058 INFO L85 PathProgramCache]: Analyzing trace with hash -51364689, now seen corresponding path program 1 times [2022-04-08 08:20:33,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:33,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1868703383] [2022-04-08 08:20:33,058 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:33,059 INFO L85 PathProgramCache]: Analyzing trace with hash -51364689, now seen corresponding path program 2 times [2022-04-08 08:20:33,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:33,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412933672] [2022-04-08 08:20:33,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:33,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:33,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:33,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {351708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {351702#true} is VALID [2022-04-08 08:20:33,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {351702#true} assume true; {351702#true} is VALID [2022-04-08 08:20:33,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {351702#true} {351702#true} #234#return; {351702#true} is VALID [2022-04-08 08:20:33,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {351702#true} call ULTIMATE.init(); {351708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:33,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {351708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {351702#true} is VALID [2022-04-08 08:20:33,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {351702#true} assume true; {351702#true} is VALID [2022-04-08 08:20:33,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {351702#true} {351702#true} #234#return; {351702#true} is VALID [2022-04-08 08:20:33,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {351702#true} call #t~ret17 := main(); {351702#true} is VALID [2022-04-08 08:20:33,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {351702#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {351702#true} is VALID [2022-04-08 08:20:33,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {351702#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {351702#true} is VALID [2022-04-08 08:20:33,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {351702#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {351702#true} is VALID [2022-04-08 08:20:33,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {351702#true} assume !(0 != ~p1~0); {351702#true} is VALID [2022-04-08 08:20:33,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {351702#true} assume !(0 != ~p2~0); {351702#true} is VALID [2022-04-08 08:20:33,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {351702#true} assume !(0 != ~p3~0); {351702#true} is VALID [2022-04-08 08:20:33,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {351702#true} assume !(0 != ~p4~0); {351702#true} is VALID [2022-04-08 08:20:33,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {351702#true} assume !(0 != ~p5~0); {351702#true} is VALID [2022-04-08 08:20:33,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {351702#true} assume !(0 != ~p6~0); {351702#true} is VALID [2022-04-08 08:20:33,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {351702#true} assume !(0 != ~p7~0); {351702#true} is VALID [2022-04-08 08:20:33,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {351702#true} assume !(0 != ~p8~0); {351702#true} is VALID [2022-04-08 08:20:33,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {351702#true} assume 0 != ~p9~0;~lk9~0 := 1; {351707#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:33,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:33,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {351707#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {351707#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:33,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {351707#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {351707#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:33,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:33,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:33,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:33,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:33,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:33,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:33,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:33,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:33,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {351707#(= main_~lk9~0 1)} assume 0 != ~p9~0; {351707#(= main_~lk9~0 1)} is VALID [2022-04-08 08:20:33,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {351707#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {351703#false} is VALID [2022-04-08 08:20:33,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {351703#false} assume !false; {351703#false} is VALID [2022-04-08 08:20:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:20:33,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:33,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412933672] [2022-04-08 08:20:33,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412933672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:33,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:33,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:33,118 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:33,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1868703383] [2022-04-08 08:20:33,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1868703383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:33,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:33,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:33,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625268648] [2022-04-08 08:20:33,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:33,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 08:20:33,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:33,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:33,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:33,137 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:33,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:33,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:33,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:33,138 INFO L87 Difference]: Start difference. First operand 8969 states and 12551 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:46,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:46,457 INFO L93 Difference]: Finished difference Result 15373 states and 21897 transitions. [2022-04-08 08:20:46,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:46,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 08:20:46,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 08:20:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 08:20:46,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-08 08:20:46,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:57,572 INFO L225 Difference]: With dead ends: 15373 [2022-04-08 08:20:57,572 INFO L226 Difference]: Without dead ends: 15371 [2022-04-08 08:20:57,575 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:57,576 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 146 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:57,576 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15371 states. [2022-04-08 08:20:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15371 to 13321. [2022-04-08 08:20:58,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:58,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:58,718 INFO L74 IsIncluded]: Start isIncluded. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:20:58,737 INFO L87 Difference]: Start difference. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:06,074 INFO L93 Difference]: Finished difference Result 15371 states and 21640 transitions. [2022-04-08 08:21:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21640 transitions. [2022-04-08 08:21:06,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:21:06,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:21:06,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15371 states. [2022-04-08 08:21:06,120 INFO L87 Difference]: Start difference. First operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15371 states. [2022-04-08 08:21:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:21:14,113 INFO L93 Difference]: Finished difference Result 15371 states and 21640 transitions. [2022-04-08 08:21:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21640 transitions. [2022-04-08 08:21:14,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:21:14,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:21:14,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:21:14,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:21:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:23,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13321 states to 13321 states and 18055 transitions. [2022-04-08 08:21:23,379 INFO L78 Accepts]: Start accepts. Automaton has 13321 states and 18055 transitions. Word has length 31 [2022-04-08 08:21:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:21:23,380 INFO L478 AbstractCegarLoop]: Abstraction has 13321 states and 18055 transitions. [2022-04-08 08:21:23,380 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:23,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13321 states and 18055 transitions. [2022-04-08 08:21:43,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18055 edges. 18055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:21:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 13321 states and 18055 transitions. [2022-04-08 08:21:43,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 08:21:43,452 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:21:43,452 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:21:43,453 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 08:21:43,453 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:21:43,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:21:43,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1331228367, now seen corresponding path program 1 times [2022-04-08 08:21:43,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:21:43,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1475743646] [2022-04-08 08:21:43,453 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:21:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1331228367, now seen corresponding path program 2 times [2022-04-08 08:21:43,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:21:43,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14464850] [2022-04-08 08:21:43,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:21:43,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:21:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:21:43,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:21:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:21:43,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {439850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {439844#true} is VALID [2022-04-08 08:21:43,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {439844#true} assume true; {439844#true} is VALID [2022-04-08 08:21:43,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {439844#true} {439844#true} #234#return; {439844#true} is VALID [2022-04-08 08:21:43,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {439844#true} call ULTIMATE.init(); {439850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:21:43,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {439850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {439844#true} is VALID [2022-04-08 08:21:43,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {439844#true} assume true; {439844#true} is VALID [2022-04-08 08:21:43,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {439844#true} {439844#true} #234#return; {439844#true} is VALID [2022-04-08 08:21:43,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {439844#true} call #t~ret17 := main(); {439844#true} is VALID [2022-04-08 08:21:43,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {439844#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {439844#true} is VALID [2022-04-08 08:21:43,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {439844#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {439844#true} is VALID [2022-04-08 08:21:43,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {439844#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {439844#true} is VALID [2022-04-08 08:21:43,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {439844#true} assume !(0 != ~p1~0); {439844#true} is VALID [2022-04-08 08:21:43,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {439844#true} assume !(0 != ~p2~0); {439844#true} is VALID [2022-04-08 08:21:43,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {439844#true} assume !(0 != ~p3~0); {439844#true} is VALID [2022-04-08 08:21:43,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {439844#true} assume !(0 != ~p4~0); {439844#true} is VALID [2022-04-08 08:21:43,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {439844#true} assume !(0 != ~p5~0); {439844#true} is VALID [2022-04-08 08:21:43,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {439844#true} assume !(0 != ~p6~0); {439844#true} is VALID [2022-04-08 08:21:43,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {439844#true} assume !(0 != ~p7~0); {439844#true} is VALID [2022-04-08 08:21:43,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {439844#true} assume !(0 != ~p8~0); {439844#true} is VALID [2022-04-08 08:21:43,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {439844#true} assume !(0 != ~p9~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-08 08:21:43,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p10~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-08 08:21:43,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {439849#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {439849#(= main_~p9~0 0)} is VALID [2022-04-08 08:21:43,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {439849#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {439849#(= main_~p9~0 0)} is VALID [2022-04-08 08:21:43,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p1~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-08 08:21:43,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p2~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-08 08:21:43,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p3~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-08 08:21:43,498 INFO L290 TraceCheckUtils]: 23: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p4~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-08 08:21:43,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p5~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-08 08:21:43,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p6~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-08 08:21:43,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p7~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-08 08:21:43,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p8~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-08 08:21:43,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {439849#(= main_~p9~0 0)} assume 0 != ~p9~0; {439845#false} is VALID [2022-04-08 08:21:43,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {439845#false} assume 1 != ~lk9~0; {439845#false} is VALID [2022-04-08 08:21:43,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {439845#false} assume !false; {439845#false} is VALID [2022-04-08 08:21:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:21:43,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:21:43,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14464850] [2022-04-08 08:21:43,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14464850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:21:43,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:21:43,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:21:43,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:21:43,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1475743646] [2022-04-08 08:21:43,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1475743646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:21:43,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:21:43,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:21:43,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981232758] [2022-04-08 08:21:43,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:21:43,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 08:21:43,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:21:43,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:21:43,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:21:43,520 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:21:43,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:21:43,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:21:43,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:21:43,520 INFO L87 Difference]: Start difference. First operand 13321 states and 18055 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:22:57,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:22:57,285 INFO L93 Difference]: Finished difference Result 30477 states and 41353 transitions. [2022-04-08 08:22:57,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:22:57,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 08:22:57,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:22:57,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:22:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-08 08:22:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:22:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-08 08:22:57,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2022-04-08 08:22:57,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:23:11,113 INFO L225 Difference]: With dead ends: 30477 [2022-04-08 08:23:11,114 INFO L226 Difference]: Without dead ends: 17419 [2022-04-08 08:23:11,129 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:23:11,129 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:23:11,129 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 127 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:23:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17419 states. [2022-04-08 08:23:12,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17419 to 17417. [2022-04-08 08:23:12,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:23:12,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:23:12,602 INFO L74 IsIncluded]: Start isIncluded. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:23:12,623 INFO L87 Difference]: Start difference. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:23:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:23:21,303 INFO L93 Difference]: Finished difference Result 17419 states and 23304 transitions. [2022-04-08 08:23:21,303 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 23304 transitions. [2022-04-08 08:23:21,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:23:21,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:23:21,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17419 states. [2022-04-08 08:23:21,357 INFO L87 Difference]: Start difference. First operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17419 states. [2022-04-08 08:23:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:23:30,453 INFO L93 Difference]: Finished difference Result 17419 states and 23304 transitions. [2022-04-08 08:23:30,453 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 23304 transitions. [2022-04-08 08:23:30,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:23:30,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:23:30,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:23:30,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:23:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:23:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17417 states to 17417 states and 23303 transitions. [2022-04-08 08:23:45,547 INFO L78 Accepts]: Start accepts. Automaton has 17417 states and 23303 transitions. Word has length 31 [2022-04-08 08:23:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:23:45,547 INFO L478 AbstractCegarLoop]: Abstraction has 17417 states and 23303 transitions. [2022-04-08 08:23:45,547 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:23:45,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17417 states and 23303 transitions. [2022-04-08 08:24:11,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23303 edges. 23303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:24:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 17417 states and 23303 transitions. [2022-04-08 08:24:11,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 08:24:11,915 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:24:11,915 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:24:11,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 08:24:11,915 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:24:11,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:24:11,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1592089896, now seen corresponding path program 1 times [2022-04-08 08:24:11,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:24:11,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [291901439] [2022-04-08 08:24:11,916 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:24:11,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1592089896, now seen corresponding path program 2 times [2022-04-08 08:24:11,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:24:11,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497931312] [2022-04-08 08:24:11,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:24:11,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:24:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:24:11,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:24:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:24:11,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {570488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {570482#true} is VALID [2022-04-08 08:24:11,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {570482#true} assume true; {570482#true} is VALID [2022-04-08 08:24:11,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {570482#true} {570482#true} #234#return; {570482#true} is VALID [2022-04-08 08:24:11,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {570482#true} call ULTIMATE.init(); {570488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:24:11,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {570488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {570482#true} is VALID [2022-04-08 08:24:11,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {570482#true} assume true; {570482#true} is VALID [2022-04-08 08:24:11,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {570482#true} {570482#true} #234#return; {570482#true} is VALID [2022-04-08 08:24:11,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {570482#true} call #t~ret17 := main(); {570482#true} is VALID [2022-04-08 08:24:11,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {570482#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {570482#true} is VALID [2022-04-08 08:24:11,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {570482#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {570482#true} is VALID [2022-04-08 08:24:11,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {570482#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {570482#true} is VALID [2022-04-08 08:24:11,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {570482#true} assume !(0 != ~p1~0); {570482#true} is VALID [2022-04-08 08:24:11,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {570482#true} assume !(0 != ~p2~0); {570482#true} is VALID [2022-04-08 08:24:11,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {570482#true} assume !(0 != ~p3~0); {570482#true} is VALID [2022-04-08 08:24:11,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {570482#true} assume !(0 != ~p4~0); {570482#true} is VALID [2022-04-08 08:24:11,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {570482#true} assume !(0 != ~p5~0); {570482#true} is VALID [2022-04-08 08:24:11,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {570482#true} assume !(0 != ~p6~0); {570482#true} is VALID [2022-04-08 08:24:11,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {570482#true} assume !(0 != ~p7~0); {570482#true} is VALID [2022-04-08 08:24:11,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {570482#true} assume !(0 != ~p8~0); {570482#true} is VALID [2022-04-08 08:24:11,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {570482#true} assume 0 != ~p9~0;~lk9~0 := 1; {570487#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:24:11,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:24:11,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {570487#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {570487#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:24:11,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {570487#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {570487#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:24:11,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:24:11,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:24:11,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:24:11,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:24:11,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:24:11,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:24:11,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:24:11,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-08 08:24:11,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {570483#false} is VALID [2022-04-08 08:24:11,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {570483#false} assume 0 != ~p10~0; {570483#false} is VALID [2022-04-08 08:24:11,959 INFO L290 TraceCheckUtils]: 30: Hoare triple {570483#false} assume 1 != ~lk10~0; {570483#false} is VALID [2022-04-08 08:24:11,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {570483#false} assume !false; {570483#false} is VALID [2022-04-08 08:24:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:24:11,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:24:11,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497931312] [2022-04-08 08:24:11,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497931312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:24:11,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:24:11,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:24:11,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:24:11,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [291901439] [2022-04-08 08:24:11,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [291901439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:24:11,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:24:11,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:24:11,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062485949] [2022-04-08 08:24:11,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:24:11,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 08:24:11,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:24:11,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:24:11,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:24:11,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:24:11,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:24:11,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:24:11,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:24:11,981 INFO L87 Difference]: Start difference. First operand 17417 states and 23303 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:25:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:25:08,811 INFO L93 Difference]: Finished difference Result 26125 states and 34825 transitions. [2022-04-08 08:25:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:25:08,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 08:25:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:25:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:25:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-08 08:25:08,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:25:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-08 08:25:08,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-08 08:25:08,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:25:23,802 INFO L225 Difference]: With dead ends: 26125 [2022-04-08 08:25:23,803 INFO L226 Difference]: Without dead ends: 17675 [2022-04-08 08:25:23,815 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:25:23,816 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:25:23,816 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 109 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:25:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17675 states. [2022-04-08 08:25:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17675 to 17673. [2022-04-08 08:25:25,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:25:25,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:25:25,408 INFO L74 IsIncluded]: Start isIncluded. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:25:25,434 INFO L87 Difference]: Start difference. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:25:36,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:25:36,273 INFO L93 Difference]: Finished difference Result 17675 states and 23304 transitions. [2022-04-08 08:25:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 23304 transitions. [2022-04-08 08:25:36,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:25:36,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:25:36,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17675 states. [2022-04-08 08:25:36,336 INFO L87 Difference]: Start difference. First operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17675 states. [2022-04-08 08:25:47,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:25:47,245 INFO L93 Difference]: Finished difference Result 17675 states and 23304 transitions. [2022-04-08 08:25:47,245 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 23304 transitions. [2022-04-08 08:25:47,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:25:47,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:25:47,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:25:47,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:25:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:26:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17673 states to 17673 states and 23303 transitions. [2022-04-08 08:26:05,667 INFO L78 Accepts]: Start accepts. Automaton has 17673 states and 23303 transitions. Word has length 32 [2022-04-08 08:26:05,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:26:05,668 INFO L478 AbstractCegarLoop]: Abstraction has 17673 states and 23303 transitions. [2022-04-08 08:26:05,668 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:26:05,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17673 states and 23303 transitions. [2022-04-08 08:26:32,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23303 edges. 23303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:26:32,603 INFO L276 IsEmpty]: Start isEmpty. Operand 17673 states and 23303 transitions. [2022-04-08 08:26:32,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 08:26:32,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:26:32,613 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:26:32,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 08:26:32,613 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:26:32,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:26:32,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1681809046, now seen corresponding path program 1 times [2022-04-08 08:26:32,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:26:32,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [632596249] [2022-04-08 08:26:32,613 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:26:32,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1681809046, now seen corresponding path program 2 times [2022-04-08 08:26:32,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:26:32,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116877449] [2022-04-08 08:26:32,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:26:32,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:26:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:26:32,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:26:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:26:32,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {693446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {693440#true} is VALID [2022-04-08 08:26:32,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {693440#true} assume true; {693440#true} is VALID [2022-04-08 08:26:32,652 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {693440#true} {693440#true} #234#return; {693440#true} is VALID [2022-04-08 08:26:32,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {693440#true} call ULTIMATE.init(); {693446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:26:32,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {693446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {693440#true} is VALID [2022-04-08 08:26:32,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {693440#true} assume true; {693440#true} is VALID [2022-04-08 08:26:32,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {693440#true} {693440#true} #234#return; {693440#true} is VALID [2022-04-08 08:26:32,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {693440#true} call #t~ret17 := main(); {693440#true} is VALID [2022-04-08 08:26:32,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {693440#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {693440#true} is VALID [2022-04-08 08:26:32,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {693440#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {693440#true} is VALID [2022-04-08 08:26:32,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {693440#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0; {693440#true} is VALID [2022-04-08 08:26:32,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {693440#true} assume !(0 != ~p1~0); {693440#true} is VALID [2022-04-08 08:26:32,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {693440#true} assume !(0 != ~p2~0); {693440#true} is VALID [2022-04-08 08:26:32,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {693440#true} assume !(0 != ~p3~0); {693440#true} is VALID [2022-04-08 08:26:32,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {693440#true} assume !(0 != ~p4~0); {693440#true} is VALID [2022-04-08 08:26:32,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {693440#true} assume !(0 != ~p5~0); {693440#true} is VALID [2022-04-08 08:26:32,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {693440#true} assume !(0 != ~p6~0); {693440#true} is VALID [2022-04-08 08:26:32,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {693440#true} assume !(0 != ~p7~0); {693440#true} is VALID [2022-04-08 08:26:32,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {693440#true} assume !(0 != ~p8~0); {693440#true} is VALID [2022-04-08 08:26:32,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {693440#true} assume !(0 != ~p9~0); {693440#true} is VALID [2022-04-08 08:26:32,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {693440#true} assume !(0 != ~p10~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-08 08:26:32,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {693445#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {693445#(= main_~p10~0 0)} is VALID [2022-04-08 08:26:32,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {693445#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {693445#(= main_~p10~0 0)} is VALID [2022-04-08 08:26:32,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p1~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-08 08:26:32,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p2~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-08 08:26:32,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p3~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-08 08:26:32,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p4~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-08 08:26:32,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p5~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-08 08:26:32,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p6~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-08 08:26:32,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p7~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-08 08:26:32,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p8~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-08 08:26:32,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p9~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-08 08:26:32,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {693445#(= main_~p10~0 0)} assume 0 != ~p10~0; {693441#false} is VALID [2022-04-08 08:26:32,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {693441#false} assume 1 != ~lk10~0; {693441#false} is VALID [2022-04-08 08:26:32,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {693441#false} assume !false; {693441#false} is VALID [2022-04-08 08:26:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:26:32,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:26:32,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116877449] [2022-04-08 08:26:32,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116877449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:26:32,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:26:32,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:26:32,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:26:32,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [632596249] [2022-04-08 08:26:32,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [632596249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:26:32,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:26:32,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:26:32,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512291751] [2022-04-08 08:26:32,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:26:32,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 08:26:32,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:26:32,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:26:32,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:26:32,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:26:32,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:26:32,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:26:32,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:26:32,688 INFO L87 Difference]: Start difference. First operand 17673 states and 23303 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)