./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_loopvsstraightlinecode_50-1loop_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 de1fbf367ada53f961df067d70787da2faa8a89922a9e8e492dc1c883e977a05 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:50:23,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:50:23,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:50:23,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:50:23,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:50:23,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:50:23,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:50:23,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:50:23,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:50:23,112 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:50:23,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:50:23,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:50:23,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:50:23,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:50:23,113 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:50:23,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:50:23,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:50:23,116 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:50:23,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:50:23,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:50:23,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:50:23,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:50:23,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:50:23,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:50:23,120 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:50:23,120 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:50:23,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:50:23,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:50:23,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:50:23,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:50:23,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:50:23,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:50:23,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:50:23,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:50:23,121 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:50:23,121 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:50:23,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:50:23,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:50:23,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:50:23,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:50:23,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:50:23,123 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:50:23,123 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-clean/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-clean/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 -> de1fbf367ada53f961df067d70787da2faa8a89922a9e8e492dc1c883e977a05 [2024-10-11 11:50:23,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:50:23,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:50:23,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:50:23,356 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:50:23,357 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:50:23,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.i [2024-10-11 11:50:24,661 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:50:24,864 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:50:24,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.i [2024-10-11 11:50:24,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e6da7012c/5a7c8e59a41542059e3793c549c257ac/FLAG9eff2573b [2024-10-11 11:50:24,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e6da7012c/5a7c8e59a41542059e3793c549c257ac [2024-10-11 11:50:24,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:50:24,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:50:24,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:50:24,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:50:24,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:50:24,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:50:24" (1/1) ... [2024-10-11 11:50:24,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c94db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:24, skipping insertion in model container [2024-10-11 11:50:24,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:50:24" (1/1) ... [2024-10-11 11:50:24,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:50:25,072 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_loopvsstraightlinecode_50-1loop_file-55.i[915,928] [2024-10-11 11:50:25,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:50:25,151 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:50:25,161 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_loopvsstraightlinecode_50-1loop_file-55.i[915,928] [2024-10-11 11:50:25,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:50:25,207 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:50:25,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:25 WrapperNode [2024-10-11 11:50:25,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:50:25,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:50:25,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:50:25,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:50:25,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:25" (1/1) ... [2024-10-11 11:50:25,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:25" (1/1) ... [2024-10-11 11:50:25,251 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-10-11 11:50:25,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:50:25,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:50:25,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:50:25,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:50:25,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:25" (1/1) ... [2024-10-11 11:50:25,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:25" (1/1) ... [2024-10-11 11:50:25,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:25" (1/1) ... [2024-10-11 11:50:25,290 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-11 11:50:25,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:25" (1/1) ... [2024-10-11 11:50:25,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:25" (1/1) ... [2024-10-11 11:50:25,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:25" (1/1) ... [2024-10-11 11:50:25,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:25" (1/1) ... [2024-10-11 11:50:25,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:25" (1/1) ... [2024-10-11 11:50:25,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:25" (1/1) ... [2024-10-11 11:50:25,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:50:25,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:50:25,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:50:25,304 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:50:25,305 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:25" (1/1) ... [2024-10-11 11:50:25,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:50:25,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:50:25,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:50:25,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:50:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:50:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:50:25,405 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:50:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:50:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:50:25,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:50:25,486 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:50:25,487 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:50:25,737 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-11 11:50:25,738 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:50:25,790 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:50:25,791 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:50:25,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:50:25 BoogieIcfgContainer [2024-10-11 11:50:25,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:50:25,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:50:25,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:50:25,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:50:25,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:50:24" (1/3) ... [2024-10-11 11:50:25,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f7d5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:50:25, skipping insertion in model container [2024-10-11 11:50:25,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:25" (2/3) ... [2024-10-11 11:50:25,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f7d5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:50:25, skipping insertion in model container [2024-10-11 11:50:25,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:50:25" (3/3) ... [2024-10-11 11:50:25,799 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-55.i [2024-10-11 11:50:25,812 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:50:25,812 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:50:25,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:50:25,868 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;@5d334b37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:50:25,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:50:25,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 11:50:25,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-11 11:50:25,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:50:25,886 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:50:25,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:50:25,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:50:25,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1924994074, now seen corresponding path program 1 times [2024-10-11 11:50:25,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:50:25,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988193147] [2024-10-11 11:50:25,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:50:25,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:50:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:50:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:50:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:50:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 11:50:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:50:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:50:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:50:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:50:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:50:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:50:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:50:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:50:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:50:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:50:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:50:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:50:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:50:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:50:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:50:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:50:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:50:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:50:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:50:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:50:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:50:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:50:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:50:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 11:50:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:50:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:50:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 11:50:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 11:50:26,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:50:26,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988193147] [2024-10-11 11:50:26,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988193147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:50:26,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:50:26,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:50:26,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499610507] [2024-10-11 11:50:26,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:50:26,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:50:26,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:50:26,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:50:26,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:50:26,398 INFO L87 Difference]: Start difference. First operand has 68 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-11 11:50:26,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:50:26,448 INFO L93 Difference]: Finished difference Result 135 states and 246 transitions. [2024-10-11 11:50:26,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:50:26,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 182 [2024-10-11 11:50:26,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:50:26,459 INFO L225 Difference]: With dead ends: 135 [2024-10-11 11:50:26,459 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 11:50:26,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-11 11:50:26,467 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:50:26,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:50:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 11:50:26,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 11:50:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 11:50:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-11 11:50:26,507 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 182 [2024-10-11 11:50:26,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:50:26,508 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-11 11:50:26,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-11 11:50:26,508 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-11 11:50:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-11 11:50:26,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:50:26,511 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:50:26,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:50:26,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:50:26,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:50:26,513 INFO L85 PathProgramCache]: Analyzing trace with hash -308372448, now seen corresponding path program 1 times [2024-10-11 11:50:26,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:50:26,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530538793] [2024-10-11 11:50:26,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:50:26,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:50:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:50:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:50:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:50:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 11:50:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:50:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:50:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:50:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:50:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:50:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:50:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:50:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:50:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:50:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:50:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:50:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:50:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:50:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:50:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:50:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:50:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:50:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:50:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:50:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:50:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:50:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:50:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:50:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 11:50:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:50:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:50:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 11:50:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 11:50:27,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:50:27,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530538793] [2024-10-11 11:50:27,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530538793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:50:27,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:50:27,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:50:27,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386352784] [2024-10-11 11:50:27,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:50:27,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:50:27,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:50:27,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:50:27,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:50:27,453 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 11:50:27,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:50:27,813 INFO L93 Difference]: Finished difference Result 182 states and 277 transitions. [2024-10-11 11:50:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:50:27,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 182 [2024-10-11 11:50:27,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:50:27,817 INFO L225 Difference]: With dead ends: 182 [2024-10-11 11:50:27,818 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 11:50:27,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:50:27,821 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 120 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:50:27,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 200 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:50:27,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 11:50:27,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2024-10-11 11:50:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 59 states have internal predecessors, (68), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 11:50:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 172 transitions. [2024-10-11 11:50:27,860 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 172 transitions. Word has length 182 [2024-10-11 11:50:27,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:50:27,862 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 172 transitions. [2024-10-11 11:50:27,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 11:50:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 172 transitions. [2024-10-11 11:50:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-11 11:50:27,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:50:27,866 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:50:27,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:50:27,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:50:27,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:50:27,868 INFO L85 PathProgramCache]: Analyzing trace with hash -306465824, now seen corresponding path program 1 times [2024-10-11 11:50:27,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:50:27,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317814336] [2024-10-11 11:50:27,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:50:27,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:50:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:50:27,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1378168627] [2024-10-11 11:50:27,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:50:27,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:50:27,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:50:27,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:50:27,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:50:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:50:28,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:50:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:50:28,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:50:28,237 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:50:28,238 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:50:28,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:50:28,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:50:28,443 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 11:50:28,530 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:50:28,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:50:28 BoogieIcfgContainer [2024-10-11 11:50:28,533 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:50:28,534 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:50:28,534 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:50:28,534 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:50:28,534 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:50:25" (3/4) ... [2024-10-11 11:50:28,536 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:50:28,537 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:50:28,537 INFO L158 Benchmark]: Toolchain (without parser) took 3644.39ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 139.0MB in the beginning and 123.5MB in the end (delta: 15.5MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2024-10-11 11:50:28,538 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory was 90.4MB in the beginning and 90.3MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:50:28,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.33ms. Allocated memory is still 167.8MB. Free memory was 139.0MB in the beginning and 123.0MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 11:50:28,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.69ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 120.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:50:28,538 INFO L158 Benchmark]: Boogie Preprocessor took 51.15ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 116.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:50:28,539 INFO L158 Benchmark]: RCFGBuilder took 487.05ms. Allocated memory is still 167.8MB. Free memory was 116.7MB in the beginning and 93.0MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 11:50:28,539 INFO L158 Benchmark]: TraceAbstraction took 2738.82ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 92.3MB in the beginning and 123.5MB in the end (delta: -31.2MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2024-10-11 11:50:28,539 INFO L158 Benchmark]: Witness Printer took 3.38ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:50:28,541 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.14ms. Allocated memory is still 127.9MB. Free memory was 90.4MB in the beginning and 90.3MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.33ms. Allocated memory is still 167.8MB. Free memory was 139.0MB in the beginning and 123.0MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.69ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 120.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.15ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 116.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 487.05ms. Allocated memory is still 167.8MB. Free memory was 116.7MB in the beginning and 93.0MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2738.82ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 92.3MB in the beginning and 123.5MB in the end (delta: -31.2MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Witness Printer took 3.38ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 138. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.8; [L23] double var_1_6 = 127.5; [L24] double var_1_7 = 2.6; [L25] double var_1_8 = 4.5; [L26] signed short int var_1_9 = -128; [L27] signed short int var_1_10 = 16; [L28] signed short int var_1_11 = 4; [L29] signed short int var_1_12 = 100; [L30] signed short int var_1_13 = 64; [L31] signed short int var_1_14 = 2; [L32] signed long int var_1_15 = 5; [L33] signed char var_1_17 = -2; [L34] signed char var_1_18 = -4; [L35] signed char var_1_19 = 8; [L36] signed char var_1_20 = 10; [L37] unsigned long int var_1_21 = 25; [L38] unsigned long int var_1_22 = 3797799060; [L39] unsigned char var_1_23 = 1; [L40] unsigned char var_1_24 = 1; [L41] unsigned char var_1_25 = 0; [L42] unsigned char var_1_26 = 0; [L43] signed short int var_1_27 = -4; [L44] signed short int var_1_28 = 24644; [L45] signed char var_1_29 = 1; [L46] signed char var_1_30 = -1; [L47] unsigned char var_1_31 = 0; [L142] isInitial = 1 [L143] FCALL initially() [L144] int k_loop; [L145] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_6=255/2, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L145] COND TRUE k_loop < 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L86] var_1_6 = __VERIFIER_nondet_double() [L87] 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, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L87] 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, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_7=13/5, var_1_8=9/2, var_1_9=-128] [L88] var_1_7 = __VERIFIER_nondet_double() [L89] 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, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_8=9/2, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_8=9/2, var_1_9=-128] [L89] 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, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_8=9/2, var_1_9=-128] [L90] var_1_8 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L91] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L92] var_1_10 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L93] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L94] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L94] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L95] var_1_11 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L96] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L97] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L97] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L98] var_1_12 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L99] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L100] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L100] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L101] var_1_13 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L102] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L103] CALL assume_abort_if_not(var_1_13 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L103] RET assume_abort_if_not(var_1_13 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L104] var_1_14 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L105] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L106] CALL assume_abort_if_not(var_1_14 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L106] RET assume_abort_if_not(var_1_14 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=-4, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L107] var_1_18 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L108] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L109] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L109] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=8, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L110] var_1_19 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L111] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L112] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L112] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=10, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L113] var_1_20 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L114] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L115] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L115] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3797799060, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L116] var_1_22 = __VERIFIER_nondet_ulong() [L117] CALL assume_abort_if_not(var_1_22 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L117] RET assume_abort_if_not(var_1_22 >= 3221225470) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L118] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L118] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L119] var_1_24 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L120] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L121] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L121] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L122] var_1_25 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L123] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L124] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L124] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L125] var_1_26 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L126] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L127] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L127] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=24644, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L128] var_1_28 = __VERIFIER_nondet_short() [L129] CALL assume_abort_if_not(var_1_28 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L129] RET assume_abort_if_not(var_1_28 >= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L130] CALL assume_abort_if_not(var_1_28 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L130] RET assume_abort_if_not(var_1_28 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=-1, var_1_31=0, var_1_9=-128] [L131] var_1_30 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_30 >= -126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=0, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=0, var_1_31=0, var_1_9=-128] [L132] RET assume_abort_if_not(var_1_30 >= -126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=0, var_1_31=0, var_1_9=-128] [L133] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=0, var_1_31=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=0, var_1_31=0, var_1_9=-128] [L133] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-2, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=1, var_1_30=0, var_1_31=0, var_1_9=-128] [L147] RET updateVariables() [L148] CALL step() [L51] var_1_9 = (((((var_1_10 - var_1_11)) < (((var_1_12 + var_1_13) - var_1_14))) ? ((var_1_10 - var_1_11)) : (((var_1_12 + var_1_13) - var_1_14)))) [L52] var_1_17 = (var_1_18 + (var_1_19 - var_1_20)) [L53] var_1_29 = (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_20) [L54] var_1_31 = var_1_26 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-1, var_1_18=61, var_1_19=1, var_1_1=44/5, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=-63, var_1_30=0, var_1_31=0, var_1_9=0] [L55] COND FALSE !(var_1_17 <= (var_1_17 * (var_1_29 * var_1_29))) [L62] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-1, var_1_18=61, var_1_19=1, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=-63, var_1_30=0, var_1_31=0, var_1_7=2, var_1_9=0] [L64] COND FALSE !(\read(var_1_31)) [L67] var_1_23 = (var_1_24 && (var_1_25 && var_1_26)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-1, var_1_18=61, var_1_19=1, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-4, var_1_28=16383, var_1_29=-63, var_1_30=0, var_1_31=0, var_1_7=2, var_1_9=0] [L69] COND FALSE !((- ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))) >= -0.875) [L76] var_1_27 = ((((var_1_29) < (var_1_28)) ? (var_1_29) : (var_1_28))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-1, var_1_18=61, var_1_19=1, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-63, var_1_28=16383, var_1_29=-63, var_1_30=0, var_1_31=0, var_1_7=2, var_1_9=0] [L78] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-1, var_1_18=61, var_1_19=1, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-63, var_1_28=16383, var_1_29=-63, var_1_30=0, var_1_31=0, var_1_7=2, var_1_9=0] [L81] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-1, var_1_18=61, var_1_19=1, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-63, var_1_28=16383, var_1_29=-63, var_1_30=0, var_1_31=0, var_1_7=2, var_1_9=0] [L148] RET step() [L149] CALL, EXPR property() [L138-L139] return (((((((((var_1_17 <= (var_1_17 * (var_1_29 * var_1_29))) ? ((var_1_29 > var_1_29) ? (var_1_1 == ((double) (((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))) + var_1_8))) : (var_1_1 == ((double) var_1_8))) : (var_1_1 == ((double) var_1_7))) && (var_1_9 == ((signed short int) (((((var_1_10 - var_1_11)) < (((var_1_12 + var_1_13) - var_1_14))) ? ((var_1_10 - var_1_11)) : (((var_1_12 + var_1_13) - var_1_14))))))) && (var_1_23 ? (var_1_15 == ((signed long int) (var_1_14 - var_1_13))) : 1)) && (var_1_17 == ((signed char) (var_1_18 + (var_1_19 - var_1_20))))) && (var_1_23 ? (var_1_21 == ((unsigned long int) ((var_1_22 - (1000000000u - var_1_13)) - var_1_14))) : 1)) && (var_1_31 ? (var_1_23 == ((unsigned char) (var_1_24 && var_1_25))) : (var_1_23 == ((unsigned char) (var_1_24 && (var_1_25 && var_1_26)))))) && (((- ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))) >= -0.875) ? (var_1_31 ? (var_1_27 == ((signed short int) (var_1_19 - var_1_12))) : (var_1_27 == ((signed short int) (var_1_13 - (var_1_28 - (var_1_20 + var_1_19)))))) : (var_1_27 == ((signed short int) ((((var_1_29) < (var_1_28)) ? (var_1_29) : (var_1_28))))))) && (var_1_29 == ((signed char) (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_20)))) && (var_1_31 == ((unsigned char) var_1_26)) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-1, var_1_18=61, var_1_19=1, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-63, var_1_28=16383, var_1_29=-63, var_1_30=0, var_1_31=0, var_1_7=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=5, var_1_17=-1, var_1_18=61, var_1_19=1, var_1_1=2, var_1_20=63, var_1_21=25, var_1_22=3221225470, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=-63, var_1_28=16383, var_1_29=-63, var_1_30=0, var_1_31=0, var_1_7=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 120 mSDsluCounter, 299 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85 IncrementalHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 248 mSDtfsCounter, 85 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 728 NumberOfCodeBlocks, 728 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 3720/3720 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-11 11:50:28,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 de1fbf367ada53f961df067d70787da2faa8a89922a9e8e492dc1c883e977a05 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:50:30,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:50:30,521 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:50:30,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:50:30,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:50:30,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:50:30,558 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:50:30,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:50:30,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:50:30,560 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:50:30,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:50:30,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:50:30,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:50:30,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:50:30,563 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:50:30,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:50:30,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:50:30,564 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:50:30,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:50:30,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:50:30,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:50:30,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:50:30,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:50:30,566 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:50:30,566 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:50:30,566 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:50:30,566 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:50:30,566 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:50:30,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:50:30,567 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:50:30,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:50:30,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:50:30,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:50:30,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:50:30,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:50:30,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:50:30,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:50:30,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:50:30,568 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:50:30,568 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:50:30,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:50:30,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:50:30,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:50:30,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:50:30,575 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:50:30,575 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-clean/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-clean/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 -> de1fbf367ada53f961df067d70787da2faa8a89922a9e8e492dc1c883e977a05 [2024-10-11 11:50:30,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:50:30,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:50:30,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:50:30,887 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:50:30,888 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:50:30,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.i [2024-10-11 11:50:32,301 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:50:32,476 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:50:32,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-55.i [2024-10-11 11:50:32,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ac4925f33/d3805970936f403d82f91d0894b4bf66/FLAGd7b7ea2d9 [2024-10-11 11:50:32,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ac4925f33/d3805970936f403d82f91d0894b4bf66 [2024-10-11 11:50:32,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:50:32,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:50:32,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:50:32,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:50:32,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:50:32,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:50:32" (1/1) ... [2024-10-11 11:50:32,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e461fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:32, skipping insertion in model container [2024-10-11 11:50:32,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:50:32" (1/1) ... [2024-10-11 11:50:32,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:50:33,073 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_loopvsstraightlinecode_50-1loop_file-55.i[915,928] [2024-10-11 11:50:33,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:50:33,153 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:50:33,164 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_loopvsstraightlinecode_50-1loop_file-55.i[915,928] [2024-10-11 11:50:33,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:50:33,220 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:50:33,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:33 WrapperNode [2024-10-11 11:50:33,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:50:33,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:50:33,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:50:33,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:50:33,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:33" (1/1) ... [2024-10-11 11:50:33,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:33" (1/1) ... [2024-10-11 11:50:33,261 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-10-11 11:50:33,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:50:33,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:50:33,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:50:33,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:50:33,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:33" (1/1) ... [2024-10-11 11:50:33,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:33" (1/1) ... [2024-10-11 11:50:33,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:33" (1/1) ... [2024-10-11 11:50:33,298 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-11 11:50:33,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:33" (1/1) ... [2024-10-11 11:50:33,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:33" (1/1) ... [2024-10-11 11:50:33,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:33" (1/1) ... [2024-10-11 11:50:33,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:33" (1/1) ... [2024-10-11 11:50:33,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:33" (1/1) ... [2024-10-11 11:50:33,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:33" (1/1) ... [2024-10-11 11:50:33,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:50:33,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:50:33,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:50:33,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:50:33,338 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:33" (1/1) ... [2024-10-11 11:50:33,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:50:33,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:50:33,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:50:33,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:50:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:50:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:50:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:50:33,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:50:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:50:33,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:50:33,496 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:50:33,498 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:50:33,864 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-11 11:50:33,864 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:50:33,920 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:50:33,920 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:50:33,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:50:33 BoogieIcfgContainer [2024-10-11 11:50:33,921 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:50:33,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:50:33,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:50:33,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:50:33,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:50:32" (1/3) ... [2024-10-11 11:50:33,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73509ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:50:33, skipping insertion in model container [2024-10-11 11:50:33,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:50:33" (2/3) ... [2024-10-11 11:50:33,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73509ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:50:33, skipping insertion in model container [2024-10-11 11:50:33,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:50:33" (3/3) ... [2024-10-11 11:50:33,931 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-55.i [2024-10-11 11:50:33,946 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:50:33,946 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:50:34,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:50:34,023 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;@6d063dd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:50:34,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:50:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 11:50:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-11 11:50:34,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:50:34,043 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:50:34,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:50:34,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:50:34,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1924994074, now seen corresponding path program 1 times [2024-10-11 11:50:34,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:50:34,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890234253] [2024-10-11 11:50:34,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:50:34,064 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-11 11:50:34,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:50:34,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 11:50:34,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:50:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:34,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:50:34,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:50:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 1044 trivial. 0 not checked. [2024-10-11 11:50:34,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:50:34,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:50:34,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890234253] [2024-10-11 11:50:34,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890234253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:50:34,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:50:34,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:50:34,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734581827] [2024-10-11 11:50:34,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:50:34,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:50:34,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:50:34,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:50:34,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:50:34,387 INFO L87 Difference]: Start difference. First operand has 68 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) 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, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-11 11:50:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:50:34,461 INFO L93 Difference]: Finished difference Result 135 states and 246 transitions. [2024-10-11 11:50:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:50:34,464 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, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 182 [2024-10-11 11:50:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:50:34,472 INFO L225 Difference]: With dead ends: 135 [2024-10-11 11:50:34,472 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 11:50:34,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 181 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-11 11:50:34,479 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:50:34,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:50:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 11:50:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 11:50:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 11:50:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-11 11:50:34,527 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 182 [2024-10-11 11:50:34,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:50:34,528 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-11 11:50:34,529 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, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-11 11:50:34,529 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-11 11:50:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-11 11:50:34,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:50:34,534 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:50:34,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:50:34,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 11:50:34,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:50:34,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:50:34,739 INFO L85 PathProgramCache]: Analyzing trace with hash -308372448, now seen corresponding path program 1 times [2024-10-11 11:50:34,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:50:34,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260324593] [2024-10-11 11:50:34,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:50:34,741 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-11 11:50:34,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:50:34,742 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 11:50:34,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:50:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:35,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 11:50:35,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:50:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 498 proven. 12 refuted. 0 times theorem prover too weak. 1350 trivial. 0 not checked. [2024-10-11 11:50:35,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:50:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 78 proven. 12 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-11 11:50:35,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:50:35,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260324593] [2024-10-11 11:50:35,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260324593] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:50:35,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:50:35,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-11 11:50:35,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867737128] [2024-10-11 11:50:35,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:50:35,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 11:50:35,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:50:35,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 11:50:35,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:50:35,572 INFO L87 Difference]: Start difference. First operand 66 states and 102 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, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 11:50:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:50:36,586 INFO L93 Difference]: Finished difference Result 208 states and 314 transitions. [2024-10-11 11:50:36,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 11:50:36,586 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, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 182 [2024-10-11 11:50:36,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:50:36,589 INFO L225 Difference]: With dead ends: 208 [2024-10-11 11:50:36,589 INFO L226 Difference]: Without dead ends: 143 [2024-10-11 11:50:36,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-10-11 11:50:36,590 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 151 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 11:50:36,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 274 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 11:50:36,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-11 11:50:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 74. [2024-10-11 11:50:36,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 11:50:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2024-10-11 11:50:36,606 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 182 [2024-10-11 11:50:36,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:50:36,607 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2024-10-11 11:50:36,607 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, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 11:50:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2024-10-11 11:50:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-11 11:50:36,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:50:36,613 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:50:36,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:50:36,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 11:50:36,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:50:36,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:50:36,817 INFO L85 PathProgramCache]: Analyzing trace with hash -306465824, now seen corresponding path program 1 times [2024-10-11 11:50:36,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:50:36,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158444170] [2024-10-11 11:50:36,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:50:36,818 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-11 11:50:36,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:50:36,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 11:50:36,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:50:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:50:37,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-11 11:50:37,846 INFO L278 TraceCheckSpWp]: Computing forward predicates...