./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_operatoramount_amount50_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-88.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 a455b61fe113f47d14217d396c2a515531f7c318e642948056697e83622a1761 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:41:27,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:41:27,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:41:27,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:41:27,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:41:27,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:41:27,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:41:27,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:41:27,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:41:27,779 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:41:27,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:41:27,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:41:27,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:41:27,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:41:27,781 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:41:27,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:41:27,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:41:27,782 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:41:27,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:41:27,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:41:27,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:41:27,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:41:27,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:41:27,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:41:27,790 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:41:27,790 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:41:27,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:41:27,791 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:41:27,791 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:41:27,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:41:27,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:41:27,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:41:27,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:41:27,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:41:27,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:41:27,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:41:27,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:41:27,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:41:27,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:41:27,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:41:27,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:41:27,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:41:27,795 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 -> a455b61fe113f47d14217d396c2a515531f7c318e642948056697e83622a1761 [2024-10-13 05:41:28,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:41:28,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:41:28,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:41:28,119 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:41:28,119 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:41:28,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-88.i [2024-10-13 05:41:29,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:41:29,795 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:41:29,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-88.i [2024-10-13 05:41:29,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c675efd/2a21d6192ae5410ea52bcdf0dd2fe2ac/FLAGce5434e3d [2024-10-13 05:41:29,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c675efd/2a21d6192ae5410ea52bcdf0dd2fe2ac [2024-10-13 05:41:29,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:41:29,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:41:29,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:41:29,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:41:29,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:41:29,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:41:29" (1/1) ... [2024-10-13 05:41:29,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27738016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:29, skipping insertion in model container [2024-10-13 05:41:29,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:41:29" (1/1) ... [2024-10-13 05:41:29,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:41:30,046 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_operatoramount_amount50_file-88.i[915,928] [2024-10-13 05:41:30,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:41:30,146 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:41:30,160 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_operatoramount_amount50_file-88.i[915,928] [2024-10-13 05:41:30,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:41:30,225 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:41:30,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:30 WrapperNode [2024-10-13 05:41:30,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:41:30,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:41:30,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:41:30,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:41:30,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:30" (1/1) ... [2024-10-13 05:41:30,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:30" (1/1) ... [2024-10-13 05:41:30,309 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-10-13 05:41:30,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:41:30,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:41:30,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:41:30,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:41:30,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:30" (1/1) ... [2024-10-13 05:41:30,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:30" (1/1) ... [2024-10-13 05:41:30,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:30" (1/1) ... [2024-10-13 05:41:30,357 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-13 05:41:30,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:30" (1/1) ... [2024-10-13 05:41:30,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:30" (1/1) ... [2024-10-13 05:41:30,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:30" (1/1) ... [2024-10-13 05:41:30,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:30" (1/1) ... [2024-10-13 05:41:30,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:30" (1/1) ... [2024-10-13 05:41:30,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:30" (1/1) ... [2024-10-13 05:41:30,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:41:30,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:41:30,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:41:30,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:41:30,395 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:30" (1/1) ... [2024-10-13 05:41:30,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:41:30,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:41:30,454 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-13 05:41:30,478 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-13 05:41:30,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:41:30,521 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:41:30,521 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:41:30,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:41:30,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:41:30,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:41:30,611 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:41:30,613 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:41:31,020 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-13 05:41:31,020 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:41:31,045 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:41:31,045 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:41:31,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:41:31 BoogieIcfgContainer [2024-10-13 05:41:31,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:41:31,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:41:31,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:41:31,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:41:31,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:41:29" (1/3) ... [2024-10-13 05:41:31,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f61337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:41:31, skipping insertion in model container [2024-10-13 05:41:31,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:30" (2/3) ... [2024-10-13 05:41:31,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f61337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:41:31, skipping insertion in model container [2024-10-13 05:41:31,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:41:31" (3/3) ... [2024-10-13 05:41:31,054 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-88.i [2024-10-13 05:41:31,075 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:41:31,076 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:41:31,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:41:31,140 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;@2237c747, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:41:31,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:41:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 05:41:31,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 05:41:31,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:41:31,162 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:41:31,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:41:31,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:41:31,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1142732073, now seen corresponding path program 1 times [2024-10-13 05:41:31,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:41:31,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400906140] [2024-10-13 05:41:31,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:41:31,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:41:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:41:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:41:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:41:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:41:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:41:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:41:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 05:41:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 05:41:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:41:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 05:41:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:41:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:41:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 05:41:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 05:41:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 05:41:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:41:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:41:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 05:41:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 05:41:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 05:41:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 05:41:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 05:41:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 05:41:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 05:41:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 05:41:31,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:41:31,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400906140] [2024-10-13 05:41:31,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400906140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:41:31,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:41:31,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:41:31,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119080283] [2024-10-13 05:41:31,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:41:31,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:41:31,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:41:31,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:41:31,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:41:31,677 INFO L87 Difference]: Start difference. First operand has 80 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 05:41:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:41:31,734 INFO L93 Difference]: Finished difference Result 157 states and 272 transitions. [2024-10-13 05:41:31,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:41:31,737 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 152 [2024-10-13 05:41:31,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:41:31,749 INFO L225 Difference]: With dead ends: 157 [2024-10-13 05:41:31,749 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 05:41:31,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-13 05:41:31,759 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:41:31,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:41:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 05:41:31,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 05:41:31,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 52 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 05:41:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2024-10-13 05:41:31,816 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 152 [2024-10-13 05:41:31,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:41:31,816 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2024-10-13 05:41:31,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 05:41:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2024-10-13 05:41:31,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 05:41:31,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:41:31,823 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:41:31,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:41:31,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:41:31,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:41:31,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1028501213, now seen corresponding path program 1 times [2024-10-13 05:41:31,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:41:31,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627440379] [2024-10-13 05:41:31,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:41:31,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:41:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:41:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:41:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:41:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:41:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:41:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:41:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 05:41:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 05:41:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:41:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 05:41:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:41:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:41:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 05:41:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 05:41:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 05:41:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:41:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:41:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 05:41:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 05:41:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 05:41:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 05:41:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 05:41:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 05:41:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 05:41:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 05:41:32,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:41:32,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627440379] [2024-10-13 05:41:32,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627440379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:41:32,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68012547] [2024-10-13 05:41:32,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:41:32,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:41:32,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:41:32,705 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-13 05:41:32,707 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-13 05:41:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:32,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 05:41:32,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:41:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 519 proven. 45 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-10-13 05:41:33,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:41:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 05:41:33,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68012547] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:41:33,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 05:41:33,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-10-13 05:41:33,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276433573] [2024-10-13 05:41:33,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 05:41:33,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:41:33,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:41:33,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:41:33,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:41:33,517 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-13 05:41:33,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:41:33,809 INFO L93 Difference]: Finished difference Result 163 states and 246 transitions. [2024-10-13 05:41:33,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 05:41:33,810 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 152 [2024-10-13 05:41:33,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:41:33,814 INFO L225 Difference]: With dead ends: 163 [2024-10-13 05:41:33,814 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 05:41:33,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 346 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-10-13 05:41:33,818 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 58 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:41:33,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 297 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:41:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 05:41:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-10-13 05:41:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 05:41:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 122 transitions. [2024-10-13 05:41:33,833 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 122 transitions. Word has length 152 [2024-10-13 05:41:33,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:41:33,834 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 122 transitions. [2024-10-13 05:41:33,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-13 05:41:33,835 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 122 transitions. [2024-10-13 05:41:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 05:41:33,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:41:33,837 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:41:33,856 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-13 05:41:34,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:41:34,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:41:34,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:41:34,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1085759515, now seen corresponding path program 1 times [2024-10-13 05:41:34,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:41:34,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051158952] [2024-10-13 05:41:34,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:41:34,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:41:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:41:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:41:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:41:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:41:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:41:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:41:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 05:41:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 05:41:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:41:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 05:41:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:41:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:41:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 05:41:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 05:41:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 05:41:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:41:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:41:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 05:41:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:34,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 05:41:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:35,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 05:41:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:35,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 05:41:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:35,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 05:41:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:35,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 05:41:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:35,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 05:41:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 162 proven. 27 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2024-10-13 05:41:35,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:41:35,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051158952] [2024-10-13 05:41:35,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051158952] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:41:35,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516610503] [2024-10-13 05:41:35,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:41:35,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:41:35,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:41:35,059 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:41:35,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 05:41:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:35,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 05:41:35,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:41:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 510 proven. 27 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2024-10-13 05:41:35,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:41:36,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 162 proven. 36 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-10-13 05:41:36,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516610503] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:41:36,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 05:41:36,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 34 [2024-10-13 05:41:36,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976035858] [2024-10-13 05:41:36,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 05:41:36,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-13 05:41:36,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:41:36,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-13 05:41:36,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 05:41:36,870 INFO L87 Difference]: Start difference. First operand 82 states and 122 transitions. Second operand has 34 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 34 states have internal predecessors, (81), 9 states have call successors, (36), 4 states have call predecessors, (36), 10 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2024-10-13 05:41:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:41:40,707 INFO L93 Difference]: Finished difference Result 443 states and 647 transitions. [2024-10-13 05:41:40,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-13 05:41:40,708 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 34 states have internal predecessors, (81), 9 states have call successors, (36), 4 states have call predecessors, (36), 10 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) Word has length 152 [2024-10-13 05:41:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:41:40,712 INFO L225 Difference]: With dead ends: 443 [2024-10-13 05:41:40,712 INFO L226 Difference]: Without dead ends: 362 [2024-10-13 05:41:40,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2024-10-13 05:41:40,715 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 1011 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 856 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 856 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:41:40,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 1096 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [856 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 05:41:40,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-13 05:41:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 158. [2024-10-13 05:41:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 110 states have (on average 1.3272727272727274) internal successors, (146), 111 states have internal predecessors, (146), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 05:41:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 226 transitions. [2024-10-13 05:41:40,760 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 226 transitions. Word has length 152 [2024-10-13 05:41:40,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:41:40,761 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 226 transitions. [2024-10-13 05:41:40,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 34 states have internal predecessors, (81), 9 states have call successors, (36), 4 states have call predecessors, (36), 10 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2024-10-13 05:41:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 226 transitions. [2024-10-13 05:41:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 05:41:40,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:41:40,764 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:41:40,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 05:41:40,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-13 05:41:40,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:41:40,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:41:40,965 INFO L85 PathProgramCache]: Analyzing trace with hash 64691161, now seen corresponding path program 1 times [2024-10-13 05:41:40,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:41:40,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645818599] [2024-10-13 05:41:40,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:41:40,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:41:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 05:41:41,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1522133042] [2024-10-13 05:41:41,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:41:41,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:41:41,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:41:41,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:41:41,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 05:41:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:41:41,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:41:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:41:41,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:41:41,270 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:41:41,271 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:41:41,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 05:41:41,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:41:41,477 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 05:41:41,584 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:41:41,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:41:41 BoogieIcfgContainer [2024-10-13 05:41:41,587 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:41:41,587 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:41:41,587 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:41:41,588 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:41:41,588 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:41:31" (3/4) ... [2024-10-13 05:41:41,590 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:41:41,591 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:41:41,591 INFO L158 Benchmark]: Toolchain (without parser) took 11760.79ms. Allocated memory was 178.3MB in the beginning and 262.1MB in the end (delta: 83.9MB). Free memory was 125.3MB in the beginning and 90.0MB in the end (delta: 35.3MB). Peak memory consumption was 118.7MB. Max. memory is 16.1GB. [2024-10-13 05:41:41,591 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:41:41,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.86ms. Allocated memory is still 178.3MB. Free memory was 124.8MB in the beginning and 109.2MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 05:41:41,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.27ms. Allocated memory is still 178.3MB. Free memory was 109.2MB in the beginning and 105.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:41:41,592 INFO L158 Benchmark]: Boogie Preprocessor took 78.47ms. Allocated memory is still 178.3MB. Free memory was 104.4MB in the beginning and 99.0MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:41:41,592 INFO L158 Benchmark]: RCFGBuilder took 652.45ms. Allocated memory is still 178.3MB. Free memory was 99.0MB in the beginning and 120.4MB in the end (delta: -21.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:41:41,592 INFO L158 Benchmark]: TraceAbstraction took 10538.66ms. Allocated memory was 178.3MB in the beginning and 262.1MB in the end (delta: 83.9MB). Free memory was 119.3MB in the beginning and 90.0MB in the end (delta: 29.3MB). Peak memory consumption was 115.2MB. Max. memory is 16.1GB. [2024-10-13 05:41:41,593 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 262.1MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:41:41,594 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.86ms. Allocated memory is still 178.3MB. Free memory was 124.8MB in the beginning and 109.2MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.27ms. Allocated memory is still 178.3MB. Free memory was 109.2MB in the beginning and 105.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.47ms. Allocated memory is still 178.3MB. Free memory was 104.4MB in the beginning and 99.0MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 652.45ms. Allocated memory is still 178.3MB. Free memory was 99.0MB in the beginning and 120.4MB in the end (delta: -21.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10538.66ms. Allocated memory was 178.3MB in the beginning and 262.1MB in the end (delta: 83.9MB). Free memory was 119.3MB in the beginning and 90.0MB in the end (delta: 29.3MB). Peak memory consumption was 115.2MB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 262.1MB. Free memory is still 90.0MB. 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 someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryDOUBLEComparisonOperation at line 143. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 15.8; [L23] float var_1_2 = 9.5; [L24] float var_1_4 = 127.6; [L25] double var_1_5 = 100000000000000.5; [L26] double var_1_6 = 100000000000000.7; [L27] double var_1_7 = 256.75; [L28] unsigned char var_1_8 = 0; [L29] unsigned char var_1_9 = 1; [L30] unsigned char var_1_10 = 0; [L31] unsigned char var_1_11 = 0; [L32] signed char var_1_12 = 0; [L33] signed char var_1_13 = 2; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_16 = 10; [L36] unsigned char var_1_18 = 4; [L37] unsigned char var_1_19 = 8; [L38] unsigned char var_1_20 = 8; [L39] unsigned short int var_1_21 = 128; [L40] unsigned char var_1_22 = 0; [L41] unsigned short int var_1_24 = 34649; [L42] unsigned char last_1_var_1_8 = 0; [L43] unsigned short int last_1_var_1_21 = 128; [L44] unsigned char last_1_var_1_22 = 0; [L147] isInitial = 1 [L148] FCALL initially() [L149] COND TRUE 1 [L150] CALL updateLastVariables() [L138] last_1_var_1_8 = var_1_8 [L139] last_1_var_1_21 = var_1_21 [L140] last_1_var_1_22 = var_1_22 [L150] RET updateLastVariables() [L151] CALL updateVariables() [L98] var_1_2 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L99] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L100] var_1_4 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L101] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L102] var_1_5 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L103] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L104] var_1_6 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L105] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L106] var_1_7 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L107] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L108] var_1_9 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L109] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L110] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L110] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L111] var_1_10 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L112] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L113] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L113] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L114] var_1_11 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L115] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L116] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L116] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L117] var_1_13 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L118] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L119] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L119] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L120] var_1_16 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L121] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L122] CALL assume_abort_if_not(var_1_16 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L122] RET assume_abort_if_not(var_1_16 <= 255) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L123] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L123] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L124] var_1_18 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L125] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L126] CALL assume_abort_if_not(var_1_18 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L126] RET assume_abort_if_not(var_1_18 <= 64) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L127] var_1_19 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L128] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L129] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L129] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L130] var_1_20 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L131] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L132] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L132] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L133] var_1_24 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_24 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=-255] [L134] RET assume_abort_if_not(var_1_24 >= 32767) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=-255] [L135] CALL assume_abort_if_not(var_1_24 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=-255] [L135] RET assume_abort_if_not(var_1_24 <= 65535) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=-255] [L151] RET updateVariables() [L152] CALL step() [L48] signed long int stepLocal_0 = (last_1_var_1_22 / var_1_16) * last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=-255] [L49] COND FALSE !(last_1_var_1_21 < stepLocal_0) [L52] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=-255] [L54] EXPR var_1_18 << var_1_14 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=-255] [L54] signed long int stepLocal_3 = var_1_18 << var_1_14; [L55] EXPR var_1_14 | var_1_18 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=-255] [L55] signed long int stepLocal_2 = (var_1_14 | var_1_18) / (var_1_24 - 1); [L56] COND FALSE !(var_1_19 == stepLocal_3) [L63] var_1_22 = 64 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=-255] [L65] COND FALSE !(64.5f <= var_1_2) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=-255] [L76] COND FALSE !(var_1_1 > ((var_1_1 * var_1_5) + 5.3)) [L83] var_1_8 = var_1_11 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=-255] [L85] COND FALSE !(((- var_1_1) / 24.75) < var_1_6) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=-255] [L92] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=-255] [L93] COND FALSE !(var_1_8 && stepLocal_1) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=-255] [L152] RET step() [L153] CALL, EXPR property() [L143] EXPR ((((((64.5f <= var_1_2) ? (last_1_var_1_8 ? ((var_1_2 == var_1_4) ? (var_1_1 == ((double) (var_1_5 + ((((((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) < (50.25)) ? (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) : (50.25)))))) : (var_1_1 == ((double) var_1_7))) : (var_1_1 == ((double) var_1_5))) : 1) && ((var_1_1 > ((var_1_1 * var_1_5) + 5.3)) ? (((var_1_7 + var_1_1) < var_1_6) ? (var_1_8 == ((unsigned char) var_1_9)) : (var_1_8 == ((unsigned char) var_1_10))) : (var_1_8 == ((unsigned char) var_1_11)))) && ((((- var_1_1) / 24.75) < var_1_6) ? ((var_1_7 >= var_1_1) ? (var_1_12 == ((signed char) var_1_13)) : (var_1_12 == ((signed char) var_1_13))) : 1)) && ((last_1_var_1_21 < ((last_1_var_1_22 / var_1_16) * last_1_var_1_21)) ? (var_1_14 == ((unsigned char) ((var_1_18 + var_1_19) + var_1_20))) : (var_1_14 == ((unsigned char) var_1_18)))) && ((var_1_8 && var_1_10) ? (var_1_21 == ((unsigned short int) ((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > (2)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (2))))) : 1)) && ((var_1_19 == (var_1_18 << var_1_14)) ? ((last_1_var_1_22 >= ((var_1_14 | var_1_18) / (var_1_24 - 1))) ? (var_1_22 == ((unsigned char) 2)) : (var_1_22 == ((unsigned char) var_1_20))) : (var_1_22 == ((unsigned char) 64))) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=-255] [L143-L144] return ((((((64.5f <= var_1_2) ? (last_1_var_1_8 ? ((var_1_2 == var_1_4) ? (var_1_1 == ((double) (var_1_5 + ((((((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) < (50.25)) ? (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) : (50.25)))))) : (var_1_1 == ((double) var_1_7))) : (var_1_1 == ((double) var_1_5))) : 1) && ((var_1_1 > ((var_1_1 * var_1_5) + 5.3)) ? (((var_1_7 + var_1_1) < var_1_6) ? (var_1_8 == ((unsigned char) var_1_9)) : (var_1_8 == ((unsigned char) var_1_10))) : (var_1_8 == ((unsigned char) var_1_11)))) && ((((- var_1_1) / 24.75) < var_1_6) ? ((var_1_7 >= var_1_1) ? (var_1_12 == ((signed char) var_1_13)) : (var_1_12 == ((signed char) var_1_13))) : 1)) && ((last_1_var_1_21 < ((last_1_var_1_22 / var_1_16) * last_1_var_1_21)) ? (var_1_14 == ((unsigned char) ((var_1_18 + var_1_19) + var_1_20))) : (var_1_14 == ((unsigned char) var_1_18)))) && ((var_1_8 && var_1_10) ? (var_1_21 == ((unsigned short int) ((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > (2)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (2))))) : 1)) && ((var_1_19 == (var_1_18 << var_1_14)) ? ((last_1_var_1_22 >= ((var_1_14 | var_1_18) / (var_1_24 - 1))) ? (var_1_22 == ((unsigned char) 2)) : (var_1_22 == ((unsigned char) var_1_20))) : (var_1_22 == ((unsigned char) 64))) ; [L153] RET, EXPR property() [L153] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=-255] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 4, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1092 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1069 mSDsluCounter, 1510 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1136 mSDsCounter, 866 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1749 IncrementalHoareTripleChecker+Invalid, 2615 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 866 mSolverCounterUnsat, 374 mSDtfsCounter, 1749 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 825 GetRequests, 755 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=3, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 208 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1064 NumberOfCodeBlocks, 1064 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1057 ConstructedInterpolants, 0 QuantifiedInterpolants, 3065 SizeOfPredicates, 8 NumberOfNonLiveVariables, 683 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 7503/7728 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-13 05:41:41,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_operatoramount_amount50_file-88.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 a455b61fe113f47d14217d396c2a515531f7c318e642948056697e83622a1761 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:41:43,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:41:43,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:41:43,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:41:43,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:41:43,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:41:43,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:41:43,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:41:43,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:41:43,967 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:41:43,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:41:43,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:41:43,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:41:43,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:41:43,971 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:41:43,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:41:43,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:41:43,972 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:41:43,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:41:43,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:41:43,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:41:43,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:41:43,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:41:43,975 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:41:43,976 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:41:43,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:41:43,976 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:41:43,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:41:43,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:41:43,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:41:43,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:41:43,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:41:43,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:41:43,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:41:43,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:41:43,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:41:43,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:41:43,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:41:43,979 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:41:43,979 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:41:43,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:41:43,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:41:43,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:41:43,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:41:43,980 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:41:43,980 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 -> a455b61fe113f47d14217d396c2a515531f7c318e642948056697e83622a1761 [2024-10-13 05:41:44,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:41:44,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:41:44,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:41:44,324 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:41:44,324 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:41:44,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-88.i [2024-10-13 05:41:45,927 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:41:46,189 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:41:46,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-88.i [2024-10-13 05:41:46,211 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/979a4b3cb/afda6e9660a144a8a0486967177caf68/FLAGdf3ad98e9 [2024-10-13 05:41:46,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/979a4b3cb/afda6e9660a144a8a0486967177caf68 [2024-10-13 05:41:46,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:41:46,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:41:46,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:41:46,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:41:46,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:41:46,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:41:46" (1/1) ... [2024-10-13 05:41:46,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eebe965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:46, skipping insertion in model container [2024-10-13 05:41:46,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:41:46" (1/1) ... [2024-10-13 05:41:46,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:41:46,473 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_operatoramount_amount50_file-88.i[915,928] [2024-10-13 05:41:46,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:41:46,572 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:41:46,584 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_operatoramount_amount50_file-88.i[915,928] [2024-10-13 05:41:46,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:41:46,648 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:41:46,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:46 WrapperNode [2024-10-13 05:41:46,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:41:46,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:41:46,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:41:46,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:41:46,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:46" (1/1) ... [2024-10-13 05:41:46,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:46" (1/1) ... [2024-10-13 05:41:46,711 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2024-10-13 05:41:46,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:41:46,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:41:46,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:41:46,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:41:46,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:46" (1/1) ... [2024-10-13 05:41:46,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:46" (1/1) ... [2024-10-13 05:41:46,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:46" (1/1) ... [2024-10-13 05:41:46,748 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-13 05:41:46,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:46" (1/1) ... [2024-10-13 05:41:46,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:46" (1/1) ... [2024-10-13 05:41:46,766 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:46" (1/1) ... [2024-10-13 05:41:46,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:46" (1/1) ... [2024-10-13 05:41:46,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:46" (1/1) ... [2024-10-13 05:41:46,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:46" (1/1) ... [2024-10-13 05:41:46,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:41:46,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:41:46,789 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:41:46,789 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:41:46,791 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:46" (1/1) ... [2024-10-13 05:41:46,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:41:46,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:41:46,822 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-13 05:41:46,825 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-13 05:41:46,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:41:46,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:41:46,869 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:41:46,870 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:41:46,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:41:46,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:41:46,953 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:41:46,962 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:41:56,702 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 05:41:56,702 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:41:56,765 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:41:56,765 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:41:56,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:41:56 BoogieIcfgContainer [2024-10-13 05:41:56,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:41:56,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:41:56,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:41:56,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:41:56,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:41:46" (1/3) ... [2024-10-13 05:41:56,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7358864b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:41:56, skipping insertion in model container [2024-10-13 05:41:56,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:41:46" (2/3) ... [2024-10-13 05:41:56,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7358864b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:41:56, skipping insertion in model container [2024-10-13 05:41:56,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:41:56" (3/3) ... [2024-10-13 05:41:56,775 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-88.i [2024-10-13 05:41:56,790 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:41:56,790 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:41:56,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:41:56,874 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;@3d35fba1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:41:56,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:41:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 05:41:56,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 05:41:56,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:41:56,896 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:41:56,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:41:56,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:41:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash 466245977, now seen corresponding path program 1 times [2024-10-13 05:41:56,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:41:56,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436819289] [2024-10-13 05:41:56,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:41:56,933 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-13 05:41:56,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:41:56,937 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-13 05:41:56,938 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-13 05:41:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:41:57,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:41:57,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:41:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-10-13 05:41:57,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:41:57,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:41:57,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436819289] [2024-10-13 05:41:57,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436819289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:41:57,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:41:57,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:41:57,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803821179] [2024-10-13 05:41:57,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:41:57,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:41:57,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:41:57,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:41:57,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:41:57,759 INFO L87 Difference]: Start difference. First operand has 64 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 05:42:02,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 05:42:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:42:02,092 INFO L93 Difference]: Finished difference Result 125 states and 224 transitions. [2024-10-13 05:42:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:42:02,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 147 [2024-10-13 05:42:02,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:42:02,173 INFO L225 Difference]: With dead ends: 125 [2024-10-13 05:42:02,174 INFO L226 Difference]: Without dead ends: 62 [2024-10-13 05:42:02,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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-13 05:42:02,179 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:42:02,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-13 05:42:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-13 05:42:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-13 05:42:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 05:42:02,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 96 transitions. [2024-10-13 05:42:02,230 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 96 transitions. Word has length 147 [2024-10-13 05:42:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:42:02,230 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 96 transitions. [2024-10-13 05:42:02,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 05:42:02,231 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 96 transitions. [2024-10-13 05:42:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 05:42:02,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:42:02,238 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:42:02,260 INFO L552 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)] Ended with exit code 0 [2024-10-13 05:42:02,438 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-13 05:42:02,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:42:02,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:42:02,440 INFO L85 PathProgramCache]: Analyzing trace with hash 875110181, now seen corresponding path program 1 times [2024-10-13 05:42:02,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:42:02,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164952783] [2024-10-13 05:42:02,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:42:02,441 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-13 05:42:02,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:42:02,444 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-13 05:42:02,445 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-13 05:42:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:42:03,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 05:42:03,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:42:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 519 proven. 45 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-10-13 05:42:05,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:42:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 05:42:08,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:42:08,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164952783] [2024-10-13 05:42:08,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164952783] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:42:08,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:42:08,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-13 05:42:08,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434609038] [2024-10-13 05:42:08,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:42:08,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:42:08,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:42:08,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:42:08,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:42:08,094 INFO L87 Difference]: Start difference. First operand 62 states and 96 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-13 05:42:15,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 05:42:19,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 05:42:23,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 05:42:27,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 05:42:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:42:27,070 INFO L93 Difference]: Finished difference Result 131 states and 198 transitions. [2024-10-13 05:42:27,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 05:42:27,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 147 [2024-10-13 05:42:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:42:27,156 INFO L225 Difference]: With dead ends: 131 [2024-10-13 05:42:27,156 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 05:42:27,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:42:27,158 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 92 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 40 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:42:27,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 203 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 173 Invalid, 4 Unknown, 0 Unchecked, 18.4s Time] [2024-10-13 05:42:27,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 05:42:27,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-10-13 05:42:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 05:42:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2024-10-13 05:42:27,172 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 147 [2024-10-13 05:42:27,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:42:27,173 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-10-13 05:42:27,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-13 05:42:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2024-10-13 05:42:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 05:42:27,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:42:27,176 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:42:27,203 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 05:42:27,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-13 05:42:27,378 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:42:27,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:42:27,378 INFO L85 PathProgramCache]: Analyzing trace with hash 875169763, now seen corresponding path program 1 times [2024-10-13 05:42:27,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:42:27,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945948666] [2024-10-13 05:42:27,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:42:27,379 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-13 05:42:27,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:42:27,382 INFO L229 MonitoredProcess]: Starting monitored process 4 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-13 05:42:27,383 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 (4)] Waiting until timeout for monitored process [2024-10-13 05:42:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:42:28,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 05:42:28,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:42:37,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-10-13 05:42:37,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:42:40,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:42:40,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945948666] [2024-10-13 05:42:40,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945948666] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:42:40,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1011605090] [2024-10-13 05:42:40,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:42:40,600 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 05:42:40,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 05:42:40,603 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 05:42:40,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-13 05:42:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:42:43,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 05:42:43,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:42:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-10-13 05:42:50,366 INFO L311 TraceCheckSpWp]: Computing backward predicates...