./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_normal_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_normal_file-84.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 6814e4b1182b075f519057bacd5c07f341f45068ab378c95bdf1e389d807335f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:35:14,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:35:14,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:35:14,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:35:14,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:35:14,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:35:14,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:35:14,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:35:14,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:35:14,760 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:35:14,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:35:14,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:35:14,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:35:14,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:35:14,763 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:35:14,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:35:14,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:35:14,763 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:35:14,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:35:14,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:35:14,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:35:14,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:35:14,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:35:14,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:35:14,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:35:14,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:35:14,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:35:14,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:35:14,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:35:14,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:35:14,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:35:14,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:35:14,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:35:14,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:35:14,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:35:14,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:35:14,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:35:14,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:35:14,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:35:14,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:35:14,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:35:14,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:35:14,770 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 -> 6814e4b1182b075f519057bacd5c07f341f45068ab378c95bdf1e389d807335f [2024-10-14 07:35:14,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:35:14,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:35:14,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:35:14,969 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:35:14,969 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:35:14,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.i [2024-10-14 07:35:16,168 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:35:16,350 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:35:16,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.i [2024-10-14 07:35:16,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc84cfc22/d53908fa7e804adabe57f96c7a916ac4/FLAG93d835a22 [2024-10-14 07:35:16,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc84cfc22/d53908fa7e804adabe57f96c7a916ac4 [2024-10-14 07:35:16,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:35:16,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:35:16,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:35:16,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:35:16,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:35:16,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:35:16" (1/1) ... [2024-10-14 07:35:16,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed5614f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:16, skipping insertion in model container [2024-10-14 07:35:16,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:35:16" (1/1) ... [2024-10-14 07:35:16,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:35:16,882 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_normal_file-84.i[913,926] [2024-10-14 07:35:16,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:35:16,942 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:35:16,954 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_normal_file-84.i[913,926] [2024-10-14 07:35:16,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:35:17,014 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:35:17,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:17 WrapperNode [2024-10-14 07:35:17,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:35:17,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:35:17,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:35:17,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:35:17,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:17" (1/1) ... [2024-10-14 07:35:17,034 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:17" (1/1) ... [2024-10-14 07:35:17,082 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2024-10-14 07:35:17,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:35:17,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:35:17,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:35:17,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:35:17,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:17" (1/1) ... [2024-10-14 07:35:17,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:17" (1/1) ... [2024-10-14 07:35:17,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:17" (1/1) ... [2024-10-14 07:35:17,119 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-14 07:35:17,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:17" (1/1) ... [2024-10-14 07:35:17,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:17" (1/1) ... [2024-10-14 07:35:17,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:17" (1/1) ... [2024-10-14 07:35:17,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:17" (1/1) ... [2024-10-14 07:35:17,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:17" (1/1) ... [2024-10-14 07:35:17,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:17" (1/1) ... [2024-10-14 07:35:17,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:35:17,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:35:17,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:35:17,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:35:17,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:17" (1/1) ... [2024-10-14 07:35:17,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:35:17,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:35:17,175 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-14 07:35:17,177 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-14 07:35:17,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:35:17,212 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:35:17,213 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:35:17,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:35:17,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:35:17,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:35:17,283 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:35:17,284 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:35:17,559 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-14 07:35:17,559 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:35:17,586 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:35:17,586 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:35:17,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:35:17 BoogieIcfgContainer [2024-10-14 07:35:17,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:35:17,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:35:17,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:35:17,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:35:17,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:35:16" (1/3) ... [2024-10-14 07:35:17,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747f5c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:35:17, skipping insertion in model container [2024-10-14 07:35:17,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:17" (2/3) ... [2024-10-14 07:35:17,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747f5c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:35:17, skipping insertion in model container [2024-10-14 07:35:17,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:35:17" (3/3) ... [2024-10-14 07:35:17,595 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-84.i [2024-10-14 07:35:17,608 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:35:17,608 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:35:17,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:35:17,666 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;@31ddb785, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:35:17,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:35:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:35:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 07:35:17,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:35:17,682 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:35:17,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:35:17,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:35:17,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1952268022, now seen corresponding path program 1 times [2024-10-14 07:35:17,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:35:17,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299962787] [2024-10-14 07:35:17,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:35:17,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:35:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:17,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:35:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:17,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:35:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:17,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:35:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:17,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:35:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:17,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:35:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:35:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:17,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:35:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:17,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:35:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:35:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:35:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:35:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:35:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:35:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:35:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:35:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:35:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:35:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:35:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:35:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:35:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:35:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:35:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:35:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:35:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:35:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:35:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:35:18,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:35:18,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299962787] [2024-10-14 07:35:18,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299962787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:35:18,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:35:18,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:35:18,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328210917] [2024-10-14 07:35:18,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:35:18,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:35:18,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:35:18,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:35:18,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:35:18,120 INFO L87 Difference]: Start difference. First operand has 77 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:35:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:35:18,159 INFO L93 Difference]: Finished difference Result 151 states and 270 transitions. [2024-10-14 07:35:18,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:35:18,161 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 159 [2024-10-14 07:35:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:35:18,167 INFO L225 Difference]: With dead ends: 151 [2024-10-14 07:35:18,168 INFO L226 Difference]: Without dead ends: 75 [2024-10-14 07:35:18,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-14 07:35:18,174 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:35:18,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:35:18,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-14 07:35:18,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-14 07:35:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:35:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 118 transitions. [2024-10-14 07:35:18,222 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 118 transitions. Word has length 159 [2024-10-14 07:35:18,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:35:18,223 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 118 transitions. [2024-10-14 07:35:18,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:35:18,223 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2024-10-14 07:35:18,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 07:35:18,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:35:18,229 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:35:18,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:35:18,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:35:18,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:35:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1424945530, now seen corresponding path program 1 times [2024-10-14 07:35:18,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:35:18,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862836434] [2024-10-14 07:35:18,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:35:18,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:35:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:35:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:35:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:35:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:35:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:35:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:35:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:35:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:35:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:35:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:35:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:35:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:35:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:35:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:35:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:35:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:35:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:35:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:35:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:35:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:35:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:35:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:35:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:35:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:35:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:35:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:35:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:35:21,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:35:21,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862836434] [2024-10-14 07:35:21,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862836434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:35:21,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:35:21,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:35:21,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972988662] [2024-10-14 07:35:21,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:35:21,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:35:21,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:35:21,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:35:21,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:35:21,693 INFO L87 Difference]: Start difference. First operand 75 states and 118 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:35:22,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:35:22,787 INFO L93 Difference]: Finished difference Result 207 states and 323 transitions. [2024-10-14 07:35:22,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:35:22,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-14 07:35:22,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:35:22,791 INFO L225 Difference]: With dead ends: 207 [2024-10-14 07:35:22,793 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 07:35:22,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:35:22,796 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 81 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 07:35:22,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 319 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 07:35:22,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 07:35:22,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 88. [2024-10-14 07:35:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 60 states have internal predecessors, (88), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:35:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 140 transitions. [2024-10-14 07:35:22,811 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 140 transitions. Word has length 159 [2024-10-14 07:35:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:35:22,812 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 140 transitions. [2024-10-14 07:35:22,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:35:22,813 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 140 transitions. [2024-10-14 07:35:22,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-14 07:35:22,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:35:22,817 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:35:22,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:35:22,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:35:22,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:35:22,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1066907262, now seen corresponding path program 1 times [2024-10-14 07:35:22,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:35:22,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158956340] [2024-10-14 07:35:22,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:35:22,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:35:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:35:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:35:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:35:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:35:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:35:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:35:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:35:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:35:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:35:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:35:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:35:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:35:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:35:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:35:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:35:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:35:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:35:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:35:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:35:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:35:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:35:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:35:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:35:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:35:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:35:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:35:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:35:23,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:35:23,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158956340] [2024-10-14 07:35:23,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158956340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:35:23,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:35:23,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:35:23,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473719100] [2024-10-14 07:35:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:35:23,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:35:23,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:35:23,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:35:23,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:35:23,974 INFO L87 Difference]: Start difference. First operand 88 states and 140 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:35:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:35:24,270 INFO L93 Difference]: Finished difference Result 205 states and 324 transitions. [2024-10-14 07:35:24,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:35:24,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-14 07:35:24,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:35:24,275 INFO L225 Difference]: With dead ends: 205 [2024-10-14 07:35:24,275 INFO L226 Difference]: Without dead ends: 118 [2024-10-14 07:35:24,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:35:24,276 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 81 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:35:24,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 293 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:35:24,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-14 07:35:24,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 88. [2024-10-14 07:35:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 60 states have internal predecessors, (88), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:35:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 140 transitions. [2024-10-14 07:35:24,287 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 140 transitions. Word has length 160 [2024-10-14 07:35:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:35:24,288 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 140 transitions. [2024-10-14 07:35:24,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:35:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 140 transitions. [2024-10-14 07:35:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-14 07:35:24,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:35:24,290 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:35:24,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:35:24,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:35:24,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:35:24,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2078024512, now seen corresponding path program 1 times [2024-10-14 07:35:24,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:35:24,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299739595] [2024-10-14 07:35:24,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:35:24,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:35:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:35:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:35:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:35:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:35:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:35:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:35:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:35:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:35:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:35:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:35:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:35:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:35:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:35:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:35:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:35:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:35:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:35:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:35:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:35:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:35:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:35:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:35:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:35:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:35:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:35:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:35:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:35:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:35:25,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299739595] [2024-10-14 07:35:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299739595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:35:25,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:35:25,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:35:25,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13164395] [2024-10-14 07:35:25,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:35:25,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:35:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:35:25,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:35:25,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:35:25,365 INFO L87 Difference]: Start difference. First operand 88 states and 140 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:35:25,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:35:25,989 INFO L93 Difference]: Finished difference Result 220 states and 343 transitions. [2024-10-14 07:35:25,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:35:25,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-14 07:35:25,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:35:25,993 INFO L225 Difference]: With dead ends: 220 [2024-10-14 07:35:25,993 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 07:35:25,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:35:25,995 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 79 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 07:35:25,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 234 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 07:35:25,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 07:35:26,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 75. [2024-10-14 07:35:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:35:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2024-10-14 07:35:26,006 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 160 [2024-10-14 07:35:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:35:26,006 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2024-10-14 07:35:26,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:35:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2024-10-14 07:35:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 07:35:26,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:35:26,009 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:35:26,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:35:26,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:35:26,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:35:26,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1362275585, now seen corresponding path program 1 times [2024-10-14 07:35:26,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:35:26,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844438546] [2024-10-14 07:35:26,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:35:26,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:35:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:35:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:35:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:35:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:35:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:35:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:35:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:35:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:35:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:35:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:35:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:35:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:35:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:35:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:35:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:35:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:35:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:35:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:35:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:35:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:35:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:35:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:35:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:35:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:35:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:35:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:35:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:35:27,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:35:27,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844438546] [2024-10-14 07:35:27,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844438546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:35:27,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:35:27,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 07:35:27,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374482700] [2024-10-14 07:35:27,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:35:27,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 07:35:27,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:35:27,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 07:35:27,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:35:27,871 INFO L87 Difference]: Start difference. First operand 75 states and 117 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:35:28,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:35:28,565 INFO L93 Difference]: Finished difference Result 290 states and 440 transitions. [2024-10-14 07:35:28,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 07:35:28,568 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2024-10-14 07:35:28,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:35:28,571 INFO L225 Difference]: With dead ends: 290 [2024-10-14 07:35:28,572 INFO L226 Difference]: Without dead ends: 216 [2024-10-14 07:35:28,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:35:28,573 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 203 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 07:35:28,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 472 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 07:35:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-14 07:35:28,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 208. [2024-10-14 07:35:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 145 states have (on average 1.393103448275862) internal successors, (202), 147 states have internal predecessors, (202), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-14 07:35:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 318 transitions. [2024-10-14 07:35:28,594 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 318 transitions. Word has length 161 [2024-10-14 07:35:28,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:35:28,594 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 318 transitions. [2024-10-14 07:35:28,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:35:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 318 transitions. [2024-10-14 07:35:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 07:35:28,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:35:28,600 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:35:28,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 07:35:28,600 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:35:28,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:35:28,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1949081599, now seen corresponding path program 1 times [2024-10-14 07:35:28,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:35:28,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418044356] [2024-10-14 07:35:28,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:35:28,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:35:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:35:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:35:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:35:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:35:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:35:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:35:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:35:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:35:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:35:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:35:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:35:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:35:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:35:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:35:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:35:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:35:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:35:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:35:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:35:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:35:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:35:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:35:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:35:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:35:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:35:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:35:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:35:30,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:35:30,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418044356] [2024-10-14 07:35:30,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418044356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:35:30,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:35:30,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 07:35:30,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334749132] [2024-10-14 07:35:30,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:35:30,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 07:35:30,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:35:30,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 07:35:30,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:35:30,264 INFO L87 Difference]: Start difference. First operand 208 states and 318 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:35:31,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:35:31,093 INFO L93 Difference]: Finished difference Result 462 states and 690 transitions. [2024-10-14 07:35:31,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 07:35:31,096 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2024-10-14 07:35:31,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:35:31,099 INFO L225 Difference]: With dead ends: 462 [2024-10-14 07:35:31,099 INFO L226 Difference]: Without dead ends: 255 [2024-10-14 07:35:31,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:35:31,102 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 218 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 07:35:31,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 496 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 07:35:31,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-14 07:35:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 196. [2024-10-14 07:35:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 133 states have (on average 1.3909774436090225) internal successors, (185), 135 states have internal predecessors, (185), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-14 07:35:31,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 301 transitions. [2024-10-14 07:35:31,134 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 301 transitions. Word has length 161 [2024-10-14 07:35:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:35:31,134 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 301 transitions. [2024-10-14 07:35:31,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:35:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 301 transitions. [2024-10-14 07:35:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 07:35:31,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:35:31,136 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:35:31,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 07:35:31,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:35:31,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:35:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1690916161, now seen corresponding path program 1 times [2024-10-14 07:35:31,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:35:31,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901948896] [2024-10-14 07:35:31,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:35:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:35:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:35:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:35:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:35:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:35:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:35:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:35:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:35:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:35:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:35:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:35:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:35:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:35:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:35:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:35:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:35:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:35:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:35:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:35:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:35:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:35:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:35:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:35:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:35:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:35:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:35:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:35:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:35:31,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:35:31,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901948896] [2024-10-14 07:35:31,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901948896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:35:31,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:35:31,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 07:35:31,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452968101] [2024-10-14 07:35:31,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:35:31,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 07:35:31,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:35:31,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 07:35:31,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:35:31,996 INFO L87 Difference]: Start difference. First operand 196 states and 301 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:35:32,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:35:32,549 INFO L93 Difference]: Finished difference Result 428 states and 644 transitions. [2024-10-14 07:35:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 07:35:32,549 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2024-10-14 07:35:32,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:35:32,551 INFO L225 Difference]: With dead ends: 428 [2024-10-14 07:35:32,551 INFO L226 Difference]: Without dead ends: 236 [2024-10-14 07:35:32,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:35:32,552 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 203 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 07:35:32,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 443 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 07:35:32,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-14 07:35:32,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 188. [2024-10-14 07:35:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 125 states have (on average 1.376) internal successors, (172), 127 states have internal predecessors, (172), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-14 07:35:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 288 transitions. [2024-10-14 07:35:32,567 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 288 transitions. Word has length 161 [2024-10-14 07:35:32,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:35:32,568 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 288 transitions. [2024-10-14 07:35:32,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:35:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 288 transitions. [2024-10-14 07:35:32,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 07:35:32,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:35:32,569 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:35:32,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 07:35:32,570 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:35:32,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:35:32,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1639223511, now seen corresponding path program 1 times [2024-10-14 07:35:32,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:35:32,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184029163] [2024-10-14 07:35:32,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:35:32,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:35:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:35:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:35:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:35:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:35:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:35:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:35:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:35:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:35:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:35:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:35:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:35:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:35:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:35:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:35:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:35:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:35:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:35:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:35:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:35:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:35:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:35:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:35:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:35:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:35:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:35:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:35:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:35:32,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:35:32,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184029163] [2024-10-14 07:35:32,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184029163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:35:32,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:35:32,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:35:32,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099627061] [2024-10-14 07:35:32,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:35:32,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:35:32,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:35:32,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:35:32,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:35:32,764 INFO L87 Difference]: Start difference. First operand 188 states and 288 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:35:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:35:32,858 INFO L93 Difference]: Finished difference Result 375 states and 573 transitions. [2024-10-14 07:35:32,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:35:32,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-10-14 07:35:32,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:35:32,860 INFO L225 Difference]: With dead ends: 375 [2024-10-14 07:35:32,860 INFO L226 Difference]: Without dead ends: 191 [2024-10-14 07:35:32,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:35:32,861 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 74 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:35:32,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 272 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:35:32,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-14 07:35:32,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2024-10-14 07:35:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 126 states have (on average 1.373015873015873) internal successors, (173), 128 states have internal predecessors, (173), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-14 07:35:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 289 transitions. [2024-10-14 07:35:32,886 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 289 transitions. Word has length 162 [2024-10-14 07:35:32,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:35:32,887 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 289 transitions. [2024-10-14 07:35:32,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:35:32,887 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 289 transitions. [2024-10-14 07:35:32,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 07:35:32,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:35:32,888 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:35:32,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 07:35:32,888 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:35:32,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:35:32,889 INFO L85 PathProgramCache]: Analyzing trace with hash -366451545, now seen corresponding path program 1 times [2024-10-14 07:35:32,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:35:32,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075277943] [2024-10-14 07:35:32,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:35:32,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:35:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:35:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:35:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:35:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:35:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:35:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:35:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:35:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:35:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:35:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:35:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:35:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:35:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:35:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:35:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:35:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:35:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:35:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:35:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:35:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:35:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:35:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:35:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:35:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:35:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:35:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:35:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:35:32,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:35:32,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075277943] [2024-10-14 07:35:32,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075277943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:35:32,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:35:32,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:35:32,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446114818] [2024-10-14 07:35:32,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:35:32,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:35:32,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:35:32,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:35:32,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:35:32,967 INFO L87 Difference]: Start difference. First operand 189 states and 289 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:35:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:35:33,043 INFO L93 Difference]: Finished difference Result 459 states and 689 transitions. [2024-10-14 07:35:33,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:35:33,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-10-14 07:35:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:35:33,046 INFO L225 Difference]: With dead ends: 459 [2024-10-14 07:35:33,046 INFO L226 Difference]: Without dead ends: 274 [2024-10-14 07:35:33,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:35:33,047 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 39 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:35:33,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 183 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:35:33,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-14 07:35:33,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 260. [2024-10-14 07:35:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 186 states have (on average 1.3763440860215055) internal successors, (256), 190 states have internal predecessors, (256), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 07:35:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2024-10-14 07:35:33,065 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 162 [2024-10-14 07:35:33,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:35:33,065 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2024-10-14 07:35:33,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:35:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2024-10-14 07:35:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 07:35:33,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:35:33,066 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:35:33,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 07:35:33,066 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:35:33,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:35:33,067 INFO L85 PathProgramCache]: Analyzing trace with hash 558942471, now seen corresponding path program 1 times [2024-10-14 07:35:33,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:35:33,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692973814] [2024-10-14 07:35:33,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:35:33,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:35:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:35:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:35:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:35:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:35:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:35:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:35:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:35:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:35:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:35:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:35:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:35:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:35:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:35:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:35:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:35:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:35:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:35:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:35:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:35:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:35:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:35:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:35:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:35:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:35:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:35:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:35:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:35:41,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:35:41,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692973814] [2024-10-14 07:35:41,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692973814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:35:41,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:35:41,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 07:35:41,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847799787] [2024-10-14 07:35:41,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:35:41,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 07:35:41,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:35:41,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 07:35:41,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-14 07:35:41,472 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:35:44,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:35:44,718 INFO L93 Difference]: Finished difference Result 669 states and 975 transitions. [2024-10-14 07:35:44,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 07:35:44,719 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 162 [2024-10-14 07:35:44,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:35:44,722 INFO L225 Difference]: With dead ends: 669 [2024-10-14 07:35:44,722 INFO L226 Difference]: Without dead ends: 564 [2024-10-14 07:35:44,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-10-14 07:35:44,724 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 367 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:35:44,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 459 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 07:35:44,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-10-14 07:35:44,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 501. [2024-10-14 07:35:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 388 states have (on average 1.3969072164948453) internal successors, (542), 399 states have internal predecessors, (542), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 85 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-14 07:35:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 734 transitions. [2024-10-14 07:35:44,775 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 734 transitions. Word has length 162 [2024-10-14 07:35:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:35:44,776 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 734 transitions. [2024-10-14 07:35:44,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:35:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 734 transitions. [2024-10-14 07:35:44,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-14 07:35:44,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:35:44,778 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:35:44,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 07:35:44,778 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:35:44,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:35:44,778 INFO L85 PathProgramCache]: Analyzing trace with hash 296212100, now seen corresponding path program 1 times [2024-10-14 07:35:44,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:35:44,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445454931] [2024-10-14 07:35:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:35:44,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:35:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 07:35:44,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2057128617] [2024-10-14 07:35:44,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:35:44,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:35:44,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:35:44,844 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:35:44,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 07:35:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:35:44,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:35:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:35:45,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:35:45,116 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:35:45,117 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:35:45,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 07:35:45,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 07:35:45,325 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:35:45,419 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:35:45,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:35:45 BoogieIcfgContainer [2024-10-14 07:35:45,421 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:35:45,422 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:35:45,422 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:35:45,422 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:35:45,422 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:35:17" (3/4) ... [2024-10-14 07:35:45,424 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:35:45,425 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:35:45,426 INFO L158 Benchmark]: Toolchain (without parser) took 28695.34ms. Allocated memory was 134.2MB in the beginning and 664.8MB in the end (delta: 530.6MB). Free memory was 63.8MB in the beginning and 395.9MB in the end (delta: -332.0MB). Peak memory consumption was 201.3MB. Max. memory is 16.1GB. [2024-10-14 07:35:45,426 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 134.2MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:35:45,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.70ms. Allocated memory was 134.2MB in the beginning and 182.5MB in the end (delta: 48.2MB). Free memory was 63.7MB in the beginning and 148.4MB in the end (delta: -84.7MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-10-14 07:35:45,426 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.91ms. Allocated memory is still 182.5MB. Free memory was 148.4MB in the beginning and 144.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:35:45,426 INFO L158 Benchmark]: Boogie Preprocessor took 56.08ms. Allocated memory is still 182.5MB. Free memory was 144.6MB in the beginning and 139.1MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 07:35:45,427 INFO L158 Benchmark]: RCFGBuilder took 446.97ms. Allocated memory is still 182.5MB. Free memory was 139.1MB in the beginning and 110.6MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-14 07:35:45,427 INFO L158 Benchmark]: TraceAbstraction took 27832.86ms. Allocated memory was 182.5MB in the beginning and 664.8MB in the end (delta: 482.3MB). Free memory was 109.8MB in the beginning and 395.9MB in the end (delta: -286.1MB). Peak memory consumption was 196.1MB. Max. memory is 16.1GB. [2024-10-14 07:35:45,428 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 664.8MB. Free memory is still 395.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:35:45,428 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.12ms. Allocated memory is still 134.2MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.70ms. Allocated memory was 134.2MB in the beginning and 182.5MB in the end (delta: 48.2MB). Free memory was 63.7MB in the beginning and 148.4MB in the end (delta: -84.7MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.91ms. Allocated memory is still 182.5MB. Free memory was 148.4MB in the beginning and 144.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.08ms. Allocated memory is still 182.5MB. Free memory was 144.6MB in the beginning and 139.1MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 446.97ms. Allocated memory is still 182.5MB. Free memory was 139.1MB in the beginning and 110.6MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 27832.86ms. Allocated memory was 182.5MB in the beginning and 664.8MB in the end (delta: 482.3MB). Free memory was 109.8MB in the beginning and 395.9MB in the end (delta: -286.1MB). Peak memory consumption was 196.1MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 664.8MB. Free memory is still 395.9MB. There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] unsigned char var_1_2 = 1; [L24] signed char var_1_3 = -16; [L25] signed char var_1_4 = 50; [L26] signed char var_1_5 = 4; [L27] unsigned long int var_1_6 = 50; [L28] signed long int var_1_7 = -8; [L29] signed long int var_1_8 = -4; [L30] signed char var_1_9 = 50; [L31] unsigned char var_1_10 = 128; [L32] unsigned char var_1_11 = 5; [L33] unsigned long int var_1_12 = 10; [L34] signed char var_1_13 = 16; [L35] signed long int var_1_14 = 1; [L36] unsigned short int var_1_15 = 128; [L37] signed long int var_1_16 = 2; [L38] unsigned short int var_1_17 = 61498; [L39] unsigned long int var_1_18 = 1; [L40] unsigned char var_1_19 = 0; [L41] double var_1_20 = 4.9; [L42] double var_1_21 = 1.5; [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] FCALL updateLastVariables() [L129] CALL updateVariables() [L79] var_1_2 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L80] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L81] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L81] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L82] var_1_3 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L83] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] var_1_4 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] var_1_5 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L89] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] var_1_7 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L92] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L93] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L93] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L94] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L95] var_1_8 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L96] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L97] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L98] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L100] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L101] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L104] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L105] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L106] var_1_14 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L107] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L108] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L109] var_1_16 = __VERIFIER_nondet_long() [L110] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L110] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L111] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L111] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L112] var_1_17 = __VERIFIER_nondet_ushort() [L113] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L113] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L114] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L114] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L115] var_1_21 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L116] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L129] RET updateVariables() [L130] CALL step() [L46] COND TRUE \read(var_1_2) [L47] var_1_1 = (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L49] COND FALSE !(-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L54] EXPR var_1_8 & var_1_4 VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L54] COND FALSE !(var_1_6 <= (var_1_8 & var_1_4)) [L59] var_1_9 = var_1_4 VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L61] COND TRUE var_1_3 <= var_1_1 [L62] var_1_12 = var_1_4 VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L66] COND TRUE (~ var_1_3) < var_1_14 [L67] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L69] EXPR (var_1_4 + var_1_14) & var_1_7 VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L69] COND TRUE ((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L70] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L74] var_1_18 = var_1_17 [L75] var_1_19 = 0 [L76] var_1_20 = var_1_21 [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR ((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L121] EXPR var_1_8 & var_1_4 VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L121] EXPR ((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L121] EXPR (((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L121] EXPR (var_1_4 + var_1_14) & var_1_7 VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L121] EXPR (((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L121-L122] return ((((((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=384, var_1_11=-254, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.7s, OverallIterations: 11, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1345 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1345 mSDsluCounter, 3285 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2249 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3477 IncrementalHoareTripleChecker+Invalid, 3563 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 1036 mSDtfsCounter, 3477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 643 GetRequests, 572 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=501occurred in iteration=10, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 327 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 1933 NumberOfCodeBlocks, 1933 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1597 ConstructedInterpolants, 0 QuantifiedInterpolants, 12903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 13000/13000 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 07:35:45,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_normal_file-84.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 6814e4b1182b075f519057bacd5c07f341f45068ab378c95bdf1e389d807335f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:35:47,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:35:47,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 07:35:47,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:35:47,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:35:47,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:35:47,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:35:47,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:35:47,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:35:47,314 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:35:47,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:35:47,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:35:47,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:35:47,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:35:47,315 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:35:47,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:35:47,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:35:47,316 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:35:47,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:35:47,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:35:47,318 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:35:47,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:35:47,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:35:47,319 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:35:47,319 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:35:47,319 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:35:47,319 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:35:47,319 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:35:47,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:35:47,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:35:47,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:35:47,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:35:47,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:35:47,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:35:47,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:35:47,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:35:47,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:35:47,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:35:47,321 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:35:47,321 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:35:47,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:35:47,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:35:47,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:35:47,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:35:47,323 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:35:47,323 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 -> 6814e4b1182b075f519057bacd5c07f341f45068ab378c95bdf1e389d807335f [2024-10-14 07:35:47,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:35:47,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:35:47,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:35:47,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:35:47,601 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:35:47,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.i [2024-10-14 07:35:48,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:35:48,975 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:35:48,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.i [2024-10-14 07:35:48,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004ee01fd/4eff5ff9df9b460fabf91c03a1029d07/FLAG446f6df5c [2024-10-14 07:35:49,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004ee01fd/4eff5ff9df9b460fabf91c03a1029d07 [2024-10-14 07:35:49,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:35:49,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:35:49,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:35:49,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:35:49,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:35:49,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:35:49" (1/1) ... [2024-10-14 07:35:49,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547c01be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:49, skipping insertion in model container [2024-10-14 07:35:49,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:35:49" (1/1) ... [2024-10-14 07:35:49,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:35:49,188 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_normal_file-84.i[913,926] [2024-10-14 07:35:49,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:35:49,262 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:35:49,275 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_normal_file-84.i[913,926] [2024-10-14 07:35:49,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:35:49,321 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:35:49,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:49 WrapperNode [2024-10-14 07:35:49,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:35:49,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:35:49,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:35:49,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:35:49,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:49" (1/1) ... [2024-10-14 07:35:49,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:49" (1/1) ... [2024-10-14 07:35:49,373 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2024-10-14 07:35:49,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:35:49,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:35:49,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:35:49,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:35:49,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:49" (1/1) ... [2024-10-14 07:35:49,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:49" (1/1) ... [2024-10-14 07:35:49,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:49" (1/1) ... [2024-10-14 07:35:49,403 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-14 07:35:49,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:49" (1/1) ... [2024-10-14 07:35:49,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:49" (1/1) ... [2024-10-14 07:35:49,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:49" (1/1) ... [2024-10-14 07:35:49,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:49" (1/1) ... [2024-10-14 07:35:49,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:49" (1/1) ... [2024-10-14 07:35:49,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:49" (1/1) ... [2024-10-14 07:35:49,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:35:49,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:35:49,423 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:35:49,423 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:35:49,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:49" (1/1) ... [2024-10-14 07:35:49,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:35:49,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:35:49,448 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-14 07:35:49,450 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-14 07:35:49,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:35:49,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:35:49,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:35:49,480 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:35:49,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:35:49,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:35:49,557 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:35:49,559 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:35:49,865 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 07:35:49,865 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:35:49,935 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:35:49,935 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:35:49,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:35:49 BoogieIcfgContainer [2024-10-14 07:35:49,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:35:49,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:35:49,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:35:49,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:35:49,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:35:49" (1/3) ... [2024-10-14 07:35:49,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c35197e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:35:49, skipping insertion in model container [2024-10-14 07:35:49,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:35:49" (2/3) ... [2024-10-14 07:35:49,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c35197e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:35:49, skipping insertion in model container [2024-10-14 07:35:49,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:35:49" (3/3) ... [2024-10-14 07:35:49,943 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-84.i [2024-10-14 07:35:49,957 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:35:49,957 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:35:50,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:35:50,033 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;@14ac9b10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:35:50,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:35:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:35:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-14 07:35:50,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:35:50,051 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:35:50,051 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:35:50,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:35:50,057 INFO L85 PathProgramCache]: Analyzing trace with hash 276544410, now seen corresponding path program 1 times [2024-10-14 07:35:50,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:35:50,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182806717] [2024-10-14 07:35:50,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:35:50,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:35:50,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:35:50,072 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:35:50,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 07:35:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:50,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 07:35:50,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:35:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 986 trivial. 0 not checked. [2024-10-14 07:35:50,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:35:50,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:35:50,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182806717] [2024-10-14 07:35:50,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182806717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:35:50,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:35:50,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:35:50,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173824741] [2024-10-14 07:35:50,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:35:50,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:35:50,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:35:50,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:35:50,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:35:50,354 INFO L87 Difference]: Start difference. First operand has 59 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:35:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:35:50,447 INFO L93 Difference]: Finished difference Result 115 states and 214 transitions. [2024-10-14 07:35:50,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:35:50,460 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 153 [2024-10-14 07:35:50,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:35:50,465 INFO L225 Difference]: With dead ends: 115 [2024-10-14 07:35:50,465 INFO L226 Difference]: Without dead ends: 57 [2024-10-14 07:35:50,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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-14 07:35:50,470 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:35:50,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:35:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-14 07:35:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-14 07:35:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:35:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 90 transitions. [2024-10-14 07:35:50,521 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 90 transitions. Word has length 153 [2024-10-14 07:35:50,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:35:50,521 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 90 transitions. [2024-10-14 07:35:50,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:35:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 90 transitions. [2024-10-14 07:35:50,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-14 07:35:50,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:35:50,527 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:35:50,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 07:35:50,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:35:50,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:35:50,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:35:50,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1658233118, now seen corresponding path program 1 times [2024-10-14 07:35:50,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:35:50,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307789427] [2024-10-14 07:35:50,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:35:50,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:35:50,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:35:50,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:35:50,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 07:35:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:35:50,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 07:35:50,884 INFO L278 TraceCheckSpWp]: Computing forward predicates...