./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 4a390ef5 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-dev-4a390ef-m [2024-10-24 05:09:24,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:09:24,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:09:24,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:09:24,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:09:24,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:09:24,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:09:24,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:09:24,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:09:24,585 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:09:24,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:09:24,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:09:24,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:09:24,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:09:24,588 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:09:24,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:09:24,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:09:24,591 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:09:24,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:09:24,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:09:24,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:09:24,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:09:24,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:09:24,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:09:24,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:09:24,596 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:09:24,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:09:24,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:09:24,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:09:24,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:09:24,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:09:24,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:09:24,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:09:24,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:09:24,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:09:24,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:09:24,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:09:24,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:09:24,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:09:24,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:09:24,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:09:24,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:09:24,602 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-24 05:09:24,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:09:24,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:09:24,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:09:24,905 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:09:24,906 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:09:24,907 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-24 05:09:26,418 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:09:26,631 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:09:26,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-52.i [2024-10-24 05:09:26,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8542384/2b7bfa4f6c3b4a0f8d2a9643e216add9/FLAG79eac9c33 [2024-10-24 05:09:26,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8542384/2b7bfa4f6c3b4a0f8d2a9643e216add9 [2024-10-24 05:09:26,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:09:26,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:09:26,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:09:26,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:09:26,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:09:26,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:09:26" (1/1) ... [2024-10-24 05:09:26,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c86cd88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:26, skipping insertion in model container [2024-10-24 05:09:26,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:09:26" (1/1) ... [2024-10-24 05:09:26,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:09:26,895 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-24 05:09:26,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:09:26,983 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:09:26,999 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-24 05:09:27,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:09:27,055 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:09:27,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27 WrapperNode [2024-10-24 05:09:27,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:09:27,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:09:27,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:09:27,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:09:27,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:27,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:27,121 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-10-24 05:09:27,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:09:27,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:09:27,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:09:27,122 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:09:27,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:27,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:27,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:27,153 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-24 05:09:27,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:27,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:27,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:27,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:27,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:27,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:27,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:09:27,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:09:27,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:09:27,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:09:27,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:27,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:09:27,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:09:27,220 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-24 05:09:27,225 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-24 05:09:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:09:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:09:27,275 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:09:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:09:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:09:27,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:09:27,362 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:09:27,364 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:09:27,689 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:09:27,690 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:09:27,769 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:09:27,770 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:09:27,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:09:27 BoogieIcfgContainer [2024-10-24 05:09:27,771 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:09:27,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:09:27,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:09:27,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:09:27,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:09:26" (1/3) ... [2024-10-24 05:09:27,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24736af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:09:27, skipping insertion in model container [2024-10-24 05:09:27,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (2/3) ... [2024-10-24 05:09:27,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24736af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:09:27, skipping insertion in model container [2024-10-24 05:09:27,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:09:27" (3/3) ... [2024-10-24 05:09:27,779 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-52.i [2024-10-24 05:09:27,796 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:09:27,796 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:09:27,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:09:27,866 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;@78552f66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:09:27,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:09:27,871 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-24 05:09:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 05:09:27,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:27,883 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-24 05:09:27,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:27,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:27,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1108415971, now seen corresponding path program 1 times [2024-10-24 05:09:27,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:27,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178855329] [2024-10-24 05:09:27,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:27,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:09:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:09:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:09:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:09:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:09:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:09:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:09:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:09:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:09:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:09:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:09:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:09:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,298 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-24 05:09:28,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:09:28,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178855329] [2024-10-24 05:09:28,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178855329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:28,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:28,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:09:28,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918310193] [2024-10-24 05:09:28,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:28,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:09:28,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:09:28,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:09:28,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:09:28,337 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-24 05:09:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:28,387 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2024-10-24 05:09:28,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:09:28,392 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-24 05:09:28,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:28,401 INFO L225 Difference]: With dead ends: 81 [2024-10-24 05:09:28,401 INFO L226 Difference]: Without dead ends: 40 [2024-10-24 05:09:28,404 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-24 05:09:28,408 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-24 05:09:28,409 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-24 05:09:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-24 05:09:28,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-24 05:09:28,451 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-24 05:09:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 61 transitions. [2024-10-24 05:09:28,459 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 61 transitions. Word has length 78 [2024-10-24 05:09:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:28,459 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 61 transitions. [2024-10-24 05:09:28,460 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-24 05:09:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2024-10-24 05:09:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 05:09:28,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:28,464 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-24 05:09:28,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:09:28,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:28,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:28,466 INFO L85 PathProgramCache]: Analyzing trace with hash 196996579, now seen corresponding path program 1 times [2024-10-24 05:09:28,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:28,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833968552] [2024-10-24 05:09:28,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:28,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:36,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:09:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:36,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:09:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:36,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:09:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:36,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:09:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:36,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:09:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:36,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:09:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:36,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:09:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:36,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:09:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:36,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:09:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:36,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:09:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:36,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:09:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:36,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:09:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:36,934 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-24 05:09:36,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:09:36,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833968552] [2024-10-24 05:09:36,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833968552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:36,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:36,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 05:09:36,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511093872] [2024-10-24 05:09:36,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:36,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 05:09:36,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:09:36,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 05:09:36,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-24 05:09:36,939 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-24 05:09:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:37,606 INFO L93 Difference]: Finished difference Result 146 states and 223 transitions. [2024-10-24 05:09:37,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 05:09:37,607 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-24 05:09:37,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:37,609 INFO L225 Difference]: With dead ends: 146 [2024-10-24 05:09:37,609 INFO L226 Difference]: Without dead ends: 107 [2024-10-24 05:09:37,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-10-24 05:09:37,611 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 214 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-24 05:09:37,612 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.5s Time] [2024-10-24 05:09:37,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-24 05:09:37,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2024-10-24 05:09:37,629 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-24 05:09:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 118 transitions. [2024-10-24 05:09:37,631 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 118 transitions. Word has length 78 [2024-10-24 05:09:37,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:37,632 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 118 transitions. [2024-10-24 05:09:37,632 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-24 05:09:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2024-10-24 05:09:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 05:09:37,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:37,635 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-24 05:09:37,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:09:37,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:37,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:37,636 INFO L85 PathProgramCache]: Analyzing trace with hash 629320931, now seen corresponding path program 1 times [2024-10-24 05:09:37,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:37,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773051749] [2024-10-24 05:09:37,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:37,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:42,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:09:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:42,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:09:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:42,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:09:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:42,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:09:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:42,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:09:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:42,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:09:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:42,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:09:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:42,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:09:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:42,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:09:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:42,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:09:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:42,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:09:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:42,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:09:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:42,411 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-24 05:09:42,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:09:42,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773051749] [2024-10-24 05:09:42,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773051749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:42,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:42,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 05:09:42,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519282541] [2024-10-24 05:09:42,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:42,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 05:09:42,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:09:42,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 05:09:42,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-24 05:09:42,416 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-24 05:09:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:43,339 INFO L93 Difference]: Finished difference Result 107 states and 159 transitions. [2024-10-24 05:09:43,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 05:09:43,340 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-24 05:09:43,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:43,342 INFO L225 Difference]: With dead ends: 107 [2024-10-24 05:09:43,342 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 05:09:43,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-10-24 05:09:43,347 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 211 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-24 05:09:43,347 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.4s Time] [2024-10-24 05:09:43,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 05:09:43,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 80. [2024-10-24 05:09:43,363 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-24 05:09:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-10-24 05:09:43,365 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 78 [2024-10-24 05:09:43,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:43,366 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-10-24 05:09:43,366 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-24 05:09:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-10-24 05:09:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 05:09:43,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:43,368 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-24 05:09:43,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:09:43,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:43,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:43,369 INFO L85 PathProgramCache]: Analyzing trace with hash -196030431, now seen corresponding path program 1 times [2024-10-24 05:09:43,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:43,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078970037] [2024-10-24 05:09:43,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:43,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:43,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:09:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:43,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:09:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:43,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:09:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:43,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:09:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:43,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:09:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:43,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:09:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:43,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:09:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:43,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:09:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:43,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:09:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:43,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:09:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:43,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:09:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:43,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:09:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:43,473 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-24 05:09:43,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:09:43,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078970037] [2024-10-24 05:09:43,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078970037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:43,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:43,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:09:43,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891613240] [2024-10-24 05:09:43,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:43,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:09:43,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:09:43,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:09:43,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:09:43,476 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-24 05:09:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:43,546 INFO L93 Difference]: Finished difference Result 119 states and 182 transitions. [2024-10-24 05:09:43,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:09:43,547 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-24 05:09:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:43,551 INFO L225 Difference]: With dead ends: 119 [2024-10-24 05:09:43,551 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 05:09:43,551 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-24 05:09:43,552 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:09:43,553 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.1s Time] [2024-10-24 05:09:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 05:09:43,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-24 05:09:43,569 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-24 05:09:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2024-10-24 05:09:43,571 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 78 [2024-10-24 05:09:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:43,573 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2024-10-24 05:09:43,573 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-24 05:09:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2024-10-24 05:09:43,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 05:09:43,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:43,576 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-24 05:09:43,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 05:09:43,577 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:43,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:43,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1002542589, now seen corresponding path program 1 times [2024-10-24 05:09:43,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:43,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291159638] [2024-10-24 05:09:43,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:43,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:45,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:09:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:45,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:09:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:45,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:09:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:45,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:09:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:45,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:09:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:45,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:09:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:45,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:09:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:45,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:09:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:45,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:09:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:45,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:09:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:45,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:09:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:45,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:09:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:45,823 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-24 05:09:45,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:09:45,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291159638] [2024-10-24 05:09:45,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291159638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:45,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:45,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 05:09:45,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734148523] [2024-10-24 05:09:45,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:45,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 05:09:45,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:09:45,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 05:09:45,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:09:45,826 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-24 05:09:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:46,281 INFO L93 Difference]: Finished difference Result 142 states and 208 transitions. [2024-10-24 05:09:46,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:09:46,282 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-24 05:09:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:46,283 INFO L225 Difference]: With dead ends: 142 [2024-10-24 05:09:46,283 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 05:09:46,284 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-24 05:09:46,284 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 118 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:09:46,285 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.3s Time] [2024-10-24 05:09:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 05:09:46,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 77. [2024-10-24 05:09:46,300 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-24 05:09:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2024-10-24 05:09:46,303 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 79 [2024-10-24 05:09:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:46,305 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2024-10-24 05:09:46,306 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-24 05:09:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2024-10-24 05:09:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 05:09:46,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:46,307 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-24 05:09:46,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 05:09:46,307 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:46,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:46,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1965925057, now seen corresponding path program 1 times [2024-10-24 05:09:46,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:46,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598148503] [2024-10-24 05:09:46,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:46,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:49,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:09:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:49,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:09:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:49,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:09:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:49,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:09:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:49,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:09:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:49,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:09:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:49,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:09:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:49,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:09:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:49,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:09:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:49,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:09:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:49,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:09:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:49,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:09:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:49,380 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-24 05:09:49,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:09:49,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598148503] [2024-10-24 05:09:49,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598148503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:49,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:49,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 05:09:49,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508297253] [2024-10-24 05:09:49,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:49,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 05:09:49,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:09:49,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 05:09:49,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:09:49,383 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-24 05:09:49,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:49,583 INFO L93 Difference]: Finished difference Result 124 states and 183 transitions. [2024-10-24 05:09:49,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 05:09:49,583 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-24 05:09:49,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:49,585 INFO L225 Difference]: With dead ends: 124 [2024-10-24 05:09:49,585 INFO L226 Difference]: Without dead ends: 79 [2024-10-24 05:09:49,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-10-24 05:09:49,587 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-24 05:09:49,588 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-24 05:09:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-24 05:09:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2024-10-24 05:09:49,607 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-24 05:09:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2024-10-24 05:09:49,609 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 79 [2024-10-24 05:09:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:49,609 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2024-10-24 05:09:49,610 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-24 05:09:49,610 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2024-10-24 05:09:49,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 05:09:49,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:49,612 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-24 05:09:49,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 05:09:49,612 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:49,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:49,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1243822584, now seen corresponding path program 1 times [2024-10-24 05:09:49,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:49,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981676465] [2024-10-24 05:09:49,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:49,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:09:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:09:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:09:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:09:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:09:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:09:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:09:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:09:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:09:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:09:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:09:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:09:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:09:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:09:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:09:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:09:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:09:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:09:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:09:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:09:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:09:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:52,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:09:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:53,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:09:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:53,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 05:09:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:53,006 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-24 05:09:53,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:09:53,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981676465] [2024-10-24 05:09:53,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981676465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:53,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:53,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 05:09:53,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26118877] [2024-10-24 05:09:53,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:53,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 05:09:53,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:09:53,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 05:09:53,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:09:53,008 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-24 05:09:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:53,409 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2024-10-24 05:09:53,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 05:09:53,410 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-24 05:09:53,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:53,411 INFO L225 Difference]: With dead ends: 77 [2024-10-24 05:09:53,411 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 05:09:53,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-10-24 05:09:53,412 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-24 05:09:53,412 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-24 05:09:53,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 05:09:53,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 05:09:53,417 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-24 05:09:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 05:09:53,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2024-10-24 05:09:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:53,418 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 05:09:53,418 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-24 05:09:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 05:09:53,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 05:09:53,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:09:53,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 05:09:53,425 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:09:53,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 05:09:53,942 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:09:53,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:09:53 BoogieIcfgContainer [2024-10-24 05:09:53,980 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:09:53,980 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:09:53,980 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:09:53,981 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:09:53,981 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:09:27" (3/4) ... [2024-10-24 05:09:53,983 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 05:09:53,988 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 05:09:53,993 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-24 05:09:53,994 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 05:09:53,994 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 05:09:53,994 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 05:09:54,106 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 05:09:54,107 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 05:09:54,107 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:09:54,107 INFO L158 Benchmark]: Toolchain (without parser) took 27437.20ms. Allocated memory was 151.0MB in the beginning and 673.2MB in the end (delta: 522.2MB). Free memory was 94.4MB in the beginning and 266.1MB in the end (delta: -171.7MB). Peak memory consumption was 352.5MB. Max. memory is 16.1GB. [2024-10-24 05:09:54,108 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 151.0MB. Free memory is still 112.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:09:54,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.80ms. Allocated memory is still 151.0MB. Free memory was 94.4MB in the beginning and 79.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 05:09:54,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.69ms. Allocated memory is still 151.0MB. Free memory was 79.7MB in the beginning and 76.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:09:54,108 INFO L158 Benchmark]: Boogie Preprocessor took 48.25ms. Allocated memory is still 151.0MB. Free memory was 76.8MB in the beginning and 72.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:09:54,108 INFO L158 Benchmark]: RCFGBuilder took 599.62ms. Allocated memory was 151.0MB in the beginning and 222.3MB in the end (delta: 71.3MB). Free memory was 72.6MB in the beginning and 182.2MB in the end (delta: -109.6MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2024-10-24 05:09:54,109 INFO L158 Benchmark]: TraceAbstraction took 26206.92ms. Allocated memory was 222.3MB in the beginning and 673.2MB in the end (delta: 450.9MB). Free memory was 182.2MB in the beginning and 272.4MB in the end (delta: -90.2MB). Peak memory consumption was 360.7MB. Max. memory is 16.1GB. [2024-10-24 05:09:54,109 INFO L158 Benchmark]: Witness Printer took 126.71ms. Allocated memory is still 673.2MB. Free memory was 272.4MB in the beginning and 266.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 05:09:54,111 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.74ms. Allocated memory is still 151.0MB. Free memory is still 112.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.80ms. Allocated memory is still 151.0MB. Free memory was 94.4MB in the beginning and 79.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.69ms. Allocated memory is still 151.0MB. Free memory was 79.7MB in the beginning and 76.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.25ms. Allocated memory is still 151.0MB. Free memory was 76.8MB in the beginning and 72.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 599.62ms. Allocated memory was 151.0MB in the beginning and 222.3MB in the end (delta: 71.3MB). Free memory was 72.6MB in the beginning and 182.2MB in the end (delta: -109.6MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * TraceAbstraction took 26206.92ms. Allocated memory was 222.3MB in the beginning and 673.2MB in the end (delta: 450.9MB). Free memory was 182.2MB in the beginning and 272.4MB in the end (delta: -90.2MB). Peak memory consumption was 360.7MB. Max. memory is 16.1GB. * Witness Printer took 126.71ms. Allocated memory is still 673.2MB. Free memory was 272.4MB in the beginning and 266.1MB in the end (delta: 6.3MB). 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: 25.6s, OverallIterations: 7, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 671 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 671 mSDsluCounter, 1150 SdHoareTripleChecker+Invalid, 1.3s 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.9s 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.5s SatisfiabilityAnalysisTime, 21.8s 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)) && ((((((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (var_1_19 == \old(var_1_19))) && (var_1_20 == \old(var_1_20))) && (var_1_21 == \old(var_1_21))) && (var_1_22 == \old(var_1_22))) && (last_1_var_1_7 == \old(last_1_var_1_7))) && (last_1_var_1_17 == \old(last_1_var_1_17))) && (last_1_var_1_20 == \old(last_1_var_1_20)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 05:09:54,207 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