./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-52.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68087ce39f875d0c4fcddd2229459f24d441251a368024f44145e4f051f2f74c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:50:56,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:50:56,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 23:50:56,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:50:56,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:50:56,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:50:56,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:50:56,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:50:56,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:50:56,675 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:50:56,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:50:56,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:50:56,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:50:56,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:50:56,677 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:50:56,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:50:56,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:50:56,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:50:56,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:50:56,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:50:56,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:50:56,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:50:56,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:50:56,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:50:56,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:50:56,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:50:56,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:50:56,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:50:56,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:50:56,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:50:56,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:50:56,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:50:56,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:50:56,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:50:56,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:50:56,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:50:56,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:50:56,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:50:56,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:50:56,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:50:56,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:50:56,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:50:56,685 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68087ce39f875d0c4fcddd2229459f24d441251a368024f44145e4f051f2f74c [2024-10-12 23:50:56,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:50:56,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:50:56,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:50:56,918 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:50:56,918 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:50:56,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-52.i [2024-10-12 23:50:58,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:50:58,298 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:50:58,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-52.i [2024-10-12 23:50:58,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e861e71/32c76fbecec34776a192decb85c20a38/FLAG333855546 [2024-10-12 23:50:58,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e861e71/32c76fbecec34776a192decb85c20a38 [2024-10-12 23:50:58,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:50:58,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:50:58,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:50:58,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:50:58,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:50:58,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:50:58" (1/1) ... [2024-10-12 23:50:58,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7851062c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:50:58, skipping insertion in model container [2024-10-12 23:50:58,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:50:58" (1/1) ... [2024-10-12 23:50:58,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:50:58,868 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-52.i[919,932] [2024-10-12 23:50:58,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:50:58,949 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:50:58,960 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-52.i[919,932] [2024-10-12 23:50:58,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:50:58,992 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:50:58,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:50:58 WrapperNode [2024-10-12 23:50:58,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:50:58,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:50:58,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:50:58,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:50:59,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:50:58" (1/1) ... [2024-10-12 23:50:59,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:50:58" (1/1) ... [2024-10-12 23:50:59,033 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-10-12 23:50:59,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:50:59,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:50:59,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:50:59,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:50:59,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:50:58" (1/1) ... [2024-10-12 23:50:59,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:50:58" (1/1) ... [2024-10-12 23:50:59,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:50:58" (1/1) ... [2024-10-12 23:50:59,060 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 23:50:59,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:50:58" (1/1) ... [2024-10-12 23:50:59,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:50:58" (1/1) ... [2024-10-12 23:50:59,067 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:50:58" (1/1) ... [2024-10-12 23:50:59,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:50:58" (1/1) ... [2024-10-12 23:50:59,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:50:58" (1/1) ... [2024-10-12 23:50:59,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:50:58" (1/1) ... [2024-10-12 23:50:59,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:50:59,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:50:59,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:50:59,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:50:59,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:50:58" (1/1) ... [2024-10-12 23:50:59,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:50:59,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:50:59,119 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:50:59,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:50:59,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:50:59,160 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:50:59,161 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:50:59,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:50:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:50:59,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:50:59,227 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:50:59,231 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:50:59,450 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-12 23:50:59,451 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:50:59,491 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:50:59,492 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:50:59,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:50:59 BoogieIcfgContainer [2024-10-12 23:50:59,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:50:59,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:50:59,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:50:59,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:50:59,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:50:58" (1/3) ... [2024-10-12 23:50:59,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f416ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:50:59, skipping insertion in model container [2024-10-12 23:50:59,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:50:58" (2/3) ... [2024-10-12 23:50:59,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f416ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:50:59, skipping insertion in model container [2024-10-12 23:50:59,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:50:59" (3/3) ... [2024-10-12 23:50:59,499 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-52.i [2024-10-12 23:50:59,513 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:50:59,513 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:50:59,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:50:59,568 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3aeccfcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:50:59,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:50:59,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-12 23:50:59,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 23:50:59,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:50:59,580 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:50:59,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:50:59,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:50:59,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1108415971, now seen corresponding path program 1 times [2024-10-12 23:50:59,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:50:59,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329911288] [2024-10-12 23:50:59,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:50:59,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:50:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:50:59,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:50:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:50:59,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:50:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:50:59,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:50:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:50:59,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:50:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:50:59,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:50:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:50:59,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:50:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:50:59,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:50:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:50:59,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:50:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:50:59,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:50:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:50:59,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:50:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:50:59,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:50:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:50:59,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:50:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:50:59,868 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-12 23:50:59,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:50:59,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329911288] [2024-10-12 23:50:59,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329911288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:50:59,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:50:59,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:50:59,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691345820] [2024-10-12 23:50:59,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:50:59,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:50:59,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:50:59,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:50:59,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:50:59,903 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 23:50:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:50:59,950 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2024-10-12 23:50:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:50:59,953 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2024-10-12 23:50:59,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:50:59,959 INFO L225 Difference]: With dead ends: 81 [2024-10-12 23:50:59,959 INFO L226 Difference]: Without dead ends: 40 [2024-10-12 23:50:59,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:50:59,968 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:50:59,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:50:59,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-12 23:51:00,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-12 23:51:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-12 23:51:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 61 transitions. [2024-10-12 23:51:00,003 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 61 transitions. Word has length 78 [2024-10-12 23:51:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:00,004 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 61 transitions. [2024-10-12 23:51:00,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 23:51:00,004 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2024-10-12 23:51:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 23:51:00,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:00,007 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:51:00,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:51:00,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:00,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:00,008 INFO L85 PathProgramCache]: Analyzing trace with hash 196996579, now seen corresponding path program 1 times [2024-10-12 23:51:00,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:51:00,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870775048] [2024-10-12 23:51:00,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:00,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:51:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:51:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:51:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:51:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:51:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:51:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:51:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:51:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:51:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:51:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:51:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:51:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:51:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-12 23:51:06,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:51:06,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870775048] [2024-10-12 23:51:06,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870775048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:51:06,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:51:06,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-12 23:51:06,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611446794] [2024-10-12 23:51:06,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:51:06,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 23:51:06,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:51:06,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 23:51:06,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-12 23:51:06,119 INFO L87 Difference]: Start difference. First operand 40 states and 61 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-12 23:51:06,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:06,638 INFO L93 Difference]: Finished difference Result 146 states and 223 transitions. [2024-10-12 23:51:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:51:06,639 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 78 [2024-10-12 23:51:06,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:06,641 INFO L225 Difference]: With dead ends: 146 [2024-10-12 23:51:06,642 INFO L226 Difference]: Without dead ends: 107 [2024-10-12 23:51:06,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-10-12 23:51:06,645 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 214 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:06,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 314 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 23:51:06,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-12 23:51:06,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2024-10-12 23:51:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 23:51:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 118 transitions. [2024-10-12 23:51:06,670 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 118 transitions. Word has length 78 [2024-10-12 23:51:06,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:06,671 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 118 transitions. [2024-10-12 23:51:06,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-12 23:51:06,671 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2024-10-12 23:51:06,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 23:51:06,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:06,672 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:51:06,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:51:06,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:06,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:06,673 INFO L85 PathProgramCache]: Analyzing trace with hash 629320931, now seen corresponding path program 1 times [2024-10-12 23:51:06,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:51:06,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504199017] [2024-10-12 23:51:06,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:06,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:51:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:10,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:51:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:10,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:51:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:10,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:51:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:10,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:51:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:10,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:51:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:10,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:51:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:10,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:51:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:10,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:51:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:10,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:51:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:10,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:51:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:10,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:51:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:10,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:51:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-12 23:51:10,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:51:10,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504199017] [2024-10-12 23:51:10,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504199017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:51:10,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:51:10,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-12 23:51:10,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856409091] [2024-10-12 23:51:10,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:51:10,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 23:51:10,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:51:10,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 23:51:10,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-12 23:51:10,423 INFO L87 Difference]: Start difference. First operand 77 states and 118 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-12 23:51:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:11,107 INFO L93 Difference]: Finished difference Result 107 states and 159 transitions. [2024-10-12 23:51:11,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 23:51:11,108 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 78 [2024-10-12 23:51:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:11,109 INFO L225 Difference]: With dead ends: 107 [2024-10-12 23:51:11,109 INFO L226 Difference]: Without dead ends: 105 [2024-10-12 23:51:11,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-10-12 23:51:11,110 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 211 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:11,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 235 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 23:51:11,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-12 23:51:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 80. [2024-10-12 23:51:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 23:51:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-10-12 23:51:11,125 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 78 [2024-10-12 23:51:11,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:11,126 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-10-12 23:51:11,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-12 23:51:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-10-12 23:51:11,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 23:51:11,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:11,128 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:51:11,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:51:11,128 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:11,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:11,130 INFO L85 PathProgramCache]: Analyzing trace with hash -196030431, now seen corresponding path program 1 times [2024-10-12 23:51:11,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:51:11,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19072001] [2024-10-12 23:51:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:11,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:51:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:11,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:51:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:11,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:51:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:11,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:51:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:11,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:51:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:11,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:51:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:11,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:51:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:11,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:51:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:11,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:51:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:11,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:51:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:11,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:51:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:11,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:51:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:11,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:51:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-12 23:51:11,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:51:11,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19072001] [2024-10-12 23:51:11,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19072001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:51:11,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:51:11,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:51:11,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834354006] [2024-10-12 23:51:11,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:51:11,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:51:11,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:51:11,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:51:11,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:51:11,219 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-12 23:51:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:11,272 INFO L93 Difference]: Finished difference Result 119 states and 182 transitions. [2024-10-12 23:51:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:51:11,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2024-10-12 23:51:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:11,275 INFO L225 Difference]: With dead ends: 119 [2024-10-12 23:51:11,275 INFO L226 Difference]: Without dead ends: 80 [2024-10-12 23:51:11,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:51:11,278 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:11,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 51 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:51:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-12 23:51:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-12 23:51:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 23:51:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2024-10-12 23:51:11,289 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 78 [2024-10-12 23:51:11,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:11,291 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2024-10-12 23:51:11,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-12 23:51:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2024-10-12 23:51:11,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 23:51:11,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:11,293 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:51:11,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 23:51:11,293 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:11,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:11,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1002542589, now seen corresponding path program 1 times [2024-10-12 23:51:11,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:51:11,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621739011] [2024-10-12 23:51:11,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:11,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:51:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:12,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:51:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:12,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:51:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:12,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:51:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:12,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:51:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:12,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:51:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:12,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:51:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:12,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:51:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:12,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:51:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:12,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:51:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:12,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:51:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:12,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:51:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:12,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:51:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-12 23:51:12,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:51:12,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621739011] [2024-10-12 23:51:12,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621739011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:51:12,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:51:12,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 23:51:12,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518618385] [2024-10-12 23:51:12,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:51:12,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 23:51:12,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:51:12,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 23:51:12,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-12 23:51:12,711 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 23:51:13,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:13,060 INFO L93 Difference]: Finished difference Result 142 states and 208 transitions. [2024-10-12 23:51:13,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 23:51:13,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 79 [2024-10-12 23:51:13,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:13,062 INFO L225 Difference]: With dead ends: 142 [2024-10-12 23:51:13,062 INFO L226 Difference]: Without dead ends: 97 [2024-10-12 23:51:13,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-12 23:51:13,063 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 118 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:13,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 221 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:51:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-12 23:51:13,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 77. [2024-10-12 23:51:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 23:51:13,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2024-10-12 23:51:13,071 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 79 [2024-10-12 23:51:13,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:13,071 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2024-10-12 23:51:13,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 23:51:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2024-10-12 23:51:13,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 23:51:13,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:13,073 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:51:13,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 23:51:13,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:13,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:13,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1965925057, now seen corresponding path program 1 times [2024-10-12 23:51:13,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:51:13,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299730645] [2024-10-12 23:51:13,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:13,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:51:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:15,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:51:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:15,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:51:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:15,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:51:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:15,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:51:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:15,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:51:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:15,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:51:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:15,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:51:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:15,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:51:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:15,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:51:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:15,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:51:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:15,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:51:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:15,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:51:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-12 23:51:15,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:51:15,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299730645] [2024-10-12 23:51:15,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299730645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:51:15,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:51:15,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 23:51:15,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003019459] [2024-10-12 23:51:15,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:51:15,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 23:51:15,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:51:15,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 23:51:15,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-12 23:51:15,336 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-12 23:51:15,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:15,468 INFO L93 Difference]: Finished difference Result 124 states and 183 transitions. [2024-10-12 23:51:15,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 23:51:15,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-10-12 23:51:15,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:15,470 INFO L225 Difference]: With dead ends: 124 [2024-10-12 23:51:15,470 INFO L226 Difference]: Without dead ends: 79 [2024-10-12 23:51:15,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:51:15,471 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 25 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:15,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 128 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:51:15,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-12 23:51:15,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2024-10-12 23:51:15,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 23:51:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2024-10-12 23:51:15,484 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 79 [2024-10-12 23:51:15,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:15,484 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2024-10-12 23:51:15,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-12 23:51:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2024-10-12 23:51:15,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-12 23:51:15,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:51:15,486 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-12 23:51:15,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 23:51:15,486 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:51:15,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:51:15,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1243822584, now seen corresponding path program 1 times [2024-10-12 23:51:15,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:51:15,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442023109] [2024-10-12 23:51:15,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:51:15,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:51:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:51:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:51:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:51:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:51:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:51:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:51:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:51:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:51:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:51:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:51:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:51:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:51:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:51:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 23:51:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:51:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 23:51:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 23:51:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 23:51:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 23:51:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 23:51:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-12 23:51:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 23:51:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 23:51:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-12 23:51:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:51:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1132 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2024-10-12 23:51:18,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:51:18,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442023109] [2024-10-12 23:51:18,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442023109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:51:18,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:51:18,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 23:51:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129247089] [2024-10-12 23:51:18,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:51:18,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 23:51:18,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:51:18,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 23:51:18,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:51:18,278 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-12 23:51:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:51:18,619 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2024-10-12 23:51:18,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 23:51:18,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 155 [2024-10-12 23:51:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:51:18,621 INFO L225 Difference]: With dead ends: 77 [2024-10-12 23:51:18,621 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 23:51:18,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-10-12 23:51:18,624 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 41 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:51:18,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 143 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:51:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 23:51:18,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 23:51:18,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:51:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 23:51:18,626 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2024-10-12 23:51:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:51:18,626 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 23:51:18,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-12 23:51:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 23:51:18,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 23:51:18,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:51:18,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 23:51:18,635 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:51:18,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 23:51:19,017 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:51:19,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:51:19 BoogieIcfgContainer [2024-10-12 23:51:19,040 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:51:19,041 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:51:19,041 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:51:19,041 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:51:19,041 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:50:59" (3/4) ... [2024-10-12 23:51:19,043 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 23:51:19,047 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-12 23:51:19,052 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-12 23:51:19,053 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-12 23:51:19,053 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 23:51:19,053 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 23:51:19,133 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 23:51:19,134 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 23:51:19,134 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:51:19,134 INFO L158 Benchmark]: Toolchain (without parser) took 20436.92ms. Allocated memory was 119.5MB in the beginning and 721.4MB in the end (delta: 601.9MB). Free memory was 67.5MB in the beginning and 369.0MB in the end (delta: -301.4MB). Peak memory consumption was 302.7MB. Max. memory is 16.1GB. [2024-10-12 23:51:19,134 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 119.5MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:51:19,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.27ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 67.3MB in the beginning and 142.4MB in the end (delta: -75.1MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-10-12 23:51:19,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.38ms. Allocated memory is still 174.1MB. Free memory was 142.4MB in the beginning and 139.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:51:19,135 INFO L158 Benchmark]: Boogie Preprocessor took 51.38ms. Allocated memory is still 174.1MB. Free memory was 139.0MB in the beginning and 135.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 23:51:19,135 INFO L158 Benchmark]: RCFGBuilder took 406.11ms. Allocated memory is still 174.1MB. Free memory was 135.7MB in the beginning and 111.8MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 23:51:19,135 INFO L158 Benchmark]: TraceAbstraction took 19546.23ms. Allocated memory was 174.1MB in the beginning and 721.4MB in the end (delta: 547.4MB). Free memory was 110.9MB in the beginning and 374.2MB in the end (delta: -263.3MB). Peak memory consumption was 283.7MB. Max. memory is 16.1GB. [2024-10-12 23:51:19,135 INFO L158 Benchmark]: Witness Printer took 93.01ms. Allocated memory is still 721.4MB. Free memory was 374.2MB in the beginning and 369.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 23:51:19,136 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 119.5MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.27ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 67.3MB in the beginning and 142.4MB in the end (delta: -75.1MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.38ms. Allocated memory is still 174.1MB. Free memory was 142.4MB in the beginning and 139.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.38ms. Allocated memory is still 174.1MB. Free memory was 139.0MB in the beginning and 135.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 406.11ms. Allocated memory is still 174.1MB. Free memory was 135.7MB in the beginning and 111.8MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19546.23ms. Allocated memory was 174.1MB in the beginning and 721.4MB in the end (delta: 547.4MB). Free memory was 110.9MB in the beginning and 374.2MB in the end (delta: -263.3MB). Peak memory consumption was 283.7MB. Max. memory is 16.1GB. * Witness Printer took 93.01ms. Allocated memory is still 721.4MB. Free memory was 374.2MB in the beginning and 369.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 7, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 671 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 671 mSDsluCounter, 1150 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 843 mSDsCounter, 282 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 892 IncrementalHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 282 mSolverCounterUnsat, 307 mSDtfsCounter, 892 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 234 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=3, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 81 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 625 NumberOfCodeBlocks, 625 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 618 ConstructedInterpolants, 0 QuantifiedInterpolants, 5414 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 2716/2716 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((((((((4294967295 * var_1_10) + var_1_9) % 4294967296) <= last_1_var_1_7) && (var_1_9 <= var_1_8)) || (var_1_9 == var_1_7)) || (((((4294967295 * var_1_10) + var_1_8) % 4294967296) <= last_1_var_1_7) && ((var_1_8 + 1) <= var_1_9))) && (var_1_8 == var_1_21)) || (var_1_12 < 1)) && (var_1_20 == ((var_1_17 >= 0) ? (var_1_17 % 65536) : ((var_1_17 % 65536) + 65536)))) && (((var_1_17 >= 0) ? (var_1_17 / 65536) : ((var_1_17 / 65536) - 1)) <= 0)) && (0 <= 0)) && (var_1_8 == var_1_21)) && ((256 + var_1_22) == 0)) && ((999999950 + var_1_8) == (((long long) ((int) var_1_9 + last_1_var_1_20) + var_1_17) + var_1_10))) && (128 <= last_1_var_1_17)) && (var_1_1 == (256 + var_1_21))) && ((((var_1_12 == 1) && (var_1_14 != 0)) && (var_1_13 != 0)) || ((var_1_12 == 0) && ((var_1_14 == 0) || (var_1_13 == 0))))) || ((((((((128 == var_1_20) && (128 == last_1_var_1_20)) && (0 <= 0)) && (128 <= last_1_var_1_17)) && (var_1_12 < 1)) && ((((var_1_12 == 1) && (var_1_14 != 0)) && (var_1_13 != 0)) || ((var_1_12 == 0) && ((var_1_14 == 0) || (var_1_13 == 0))))) && (var_1_7 <= 64)) && (128 <= var_1_17))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((128 <= last_1_var_1_17) && (128 <= var_1_17)) Ensures: ((128 <= last_1_var_1_17) && (128 <= var_1_17)) RESULT: Ultimate proved your program to be correct! [2024-10-12 23:51:19,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE