./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-57.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c969fd24711e8e1435b6ebbcc95d2d51ddca4d264d4ae9716ffc89d5150558e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:15:10,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:15:10,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:15:10,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:15:10,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:15:11,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:15:11,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:15:11,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:15:11,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:15:11,022 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:15:11,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:15:11,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:15:11,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:15:11,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:15:11,024 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:15:11,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:15:11,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:15:11,025 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:15:11,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:15:11,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:15:11,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:15:11,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:15:11,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:15:11,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:15:11,032 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:15:11,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:15:11,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:15:11,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:15:11,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:15:11,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:15:11,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:15:11,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:15:11,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:15:11,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:15:11,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:15:11,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:15:11,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:15:11,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:15:11,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:15:11,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:15:11,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:15:11,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:15:11,038 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c969fd24711e8e1435b6ebbcc95d2d51ddca4d264d4ae9716ffc89d5150558e [2024-10-13 00:15:11,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:15:11,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:15:11,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:15:11,313 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:15:11,314 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:15:11,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-57.i [2024-10-13 00:15:12,699 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:15:12,935 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:15:12,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-57.i [2024-10-13 00:15:12,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48e1bcc19/51e9eace578e4568943cee97f4a2dafd/FLAG9cacbf498 [2024-10-13 00:15:12,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48e1bcc19/51e9eace578e4568943cee97f4a2dafd [2024-10-13 00:15:12,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:15:12,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:15:12,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:15:12,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:15:12,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:15:12,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:15:12" (1/1) ... [2024-10-13 00:15:12,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42409ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:12, skipping insertion in model container [2024-10-13 00:15:12,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:15:12" (1/1) ... [2024-10-13 00:15:13,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:15:13,183 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-57.i[917,930] [2024-10-13 00:15:13,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:15:13,285 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:15:13,301 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-57.i[917,930] [2024-10-13 00:15:13,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:15:13,361 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:15:13,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:13 WrapperNode [2024-10-13 00:15:13,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:15:13,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:15:13,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:15:13,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:15:13,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:13" (1/1) ... [2024-10-13 00:15:13,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:13" (1/1) ... [2024-10-13 00:15:13,448 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2024-10-13 00:15:13,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:15:13,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:15:13,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:15:13,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:15:13,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:13" (1/1) ... [2024-10-13 00:15:13,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:13" (1/1) ... [2024-10-13 00:15:13,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:13" (1/1) ... [2024-10-13 00:15:13,496 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:15:13,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:13" (1/1) ... [2024-10-13 00:15:13,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:13" (1/1) ... [2024-10-13 00:15:13,512 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:13" (1/1) ... [2024-10-13 00:15:13,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:13" (1/1) ... [2024-10-13 00:15:13,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:13" (1/1) ... [2024-10-13 00:15:13,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:13" (1/1) ... [2024-10-13 00:15:13,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:15:13,533 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:15:13,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:15:13,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:15:13,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:13" (1/1) ... [2024-10-13 00:15:13,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:15:13,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:15:13,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:15:13,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:15:13,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:15:13,623 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:15:13,624 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:15:13,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:15:13,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:15:13,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:15:13,702 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:15:13,704 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:15:14,085 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-13 00:15:14,085 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:15:14,117 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:15:14,119 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:15:14,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:14 BoogieIcfgContainer [2024-10-13 00:15:14,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:15:14,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:15:14,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:15:14,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:15:14,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:15:12" (1/3) ... [2024-10-13 00:15:14,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be9ac64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:15:14, skipping insertion in model container [2024-10-13 00:15:14,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:13" (2/3) ... [2024-10-13 00:15:14,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be9ac64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:15:14, skipping insertion in model container [2024-10-13 00:15:14,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:14" (3/3) ... [2024-10-13 00:15:14,130 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-57.i [2024-10-13 00:15:14,144 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:15:14,144 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:15:14,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:15:14,206 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;@4d1aaebb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:15:14,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:15:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 00:15:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-13 00:15:14,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:15:14,223 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:15:14,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:15:14,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:15:14,228 INFO L85 PathProgramCache]: Analyzing trace with hash 995987174, now seen corresponding path program 1 times [2024-10-13 00:15:14,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:15:14,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222984345] [2024-10-13 00:15:14,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:15:14,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:15:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:15:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:15:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:15:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:15:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:15:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:15:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:15:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:15:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:15:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:15:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:15:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:15:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:15:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:15:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:15:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:15:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 00:15:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:15:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 00:15:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:15:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 00:15:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:15:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:15:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:15:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 00:15:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:15:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 00:15:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 00:15:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 00:15:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 00:15:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 00:15:14,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:15:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222984345] [2024-10-13 00:15:14,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222984345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:15:14,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:15:14,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:15:14,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874559101] [2024-10-13 00:15:14,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:15:14,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:15:14,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:15:14,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:15:14,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:15:14,826 INFO L87 Difference]: Start difference. First operand has 92 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-13 00:15:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:15:14,876 INFO L93 Difference]: Finished difference Result 181 states and 316 transitions. [2024-10-13 00:15:14,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:15:14,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 188 [2024-10-13 00:15:14,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:15:14,891 INFO L225 Difference]: With dead ends: 181 [2024-10-13 00:15:14,891 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 00:15:14,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:15:14,903 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:15:14,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:15:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 00:15:14,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-13 00:15:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 58 states have internal predecessors, (79), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 00:15:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2024-10-13 00:15:14,968 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 188 [2024-10-13 00:15:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:15:14,969 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2024-10-13 00:15:14,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-13 00:15:14,969 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2024-10-13 00:15:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-13 00:15:14,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:15:14,973 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:15:14,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:15:14,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:15:14,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:15:14,975 INFO L85 PathProgramCache]: Analyzing trace with hash -6644066, now seen corresponding path program 1 times [2024-10-13 00:15:14,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:15:14,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14284340] [2024-10-13 00:15:14,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:15:14,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:15:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:15:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:15:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:15:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:15:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:15:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:15:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:15:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:15:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:15:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:15:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:15:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:15:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:15:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:15:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:15:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:15:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 00:15:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:15:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 00:15:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:15:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 00:15:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:15:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:15:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:15:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 00:15:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:15:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 00:15:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 00:15:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 00:15:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 00:15:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 6 proven. 81 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-13 00:15:15,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:15:15,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14284340] [2024-10-13 00:15:15,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14284340] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:15:15,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554983470] [2024-10-13 00:15:15,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:15:15,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:15:15,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:15:15,944 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:15:15,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 00:15:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:16,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 00:15:16,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:15:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 249 proven. 81 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-10-13 00:15:16,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:15:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 6 proven. 81 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-13 00:15:16,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554983470] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:15:16,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 00:15:16,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-13 00:15:16,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913871104] [2024-10-13 00:15:16,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 00:15:16,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 00:15:16,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:15:16,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 00:15:16,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-13 00:15:16,728 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2024-10-13 00:15:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:15:17,144 INFO L93 Difference]: Finished difference Result 187 states and 285 transitions. [2024-10-13 00:15:17,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 00:15:17,145 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) Word has length 188 [2024-10-13 00:15:17,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:15:17,148 INFO L225 Difference]: With dead ends: 187 [2024-10-13 00:15:17,148 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 00:15:17,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 428 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-13 00:15:17,150 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 57 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:15:17,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 301 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:15:17,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 00:15:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2024-10-13 00:15:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 00:15:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 144 transitions. [2024-10-13 00:15:17,176 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 144 transitions. Word has length 188 [2024-10-13 00:15:17,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:15:17,177 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 144 transitions. [2024-10-13 00:15:17,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2024-10-13 00:15:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 144 transitions. [2024-10-13 00:15:17,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-13 00:15:17,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:15:17,188 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:15:17,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 00:15:17,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:15:17,389 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:15:17,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:15:17,390 INFO L85 PathProgramCache]: Analyzing trace with hash -593450080, now seen corresponding path program 1 times [2024-10-13 00:15:17,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:15:17,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077674041] [2024-10-13 00:15:17,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:15:17,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:15:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 00:15:17,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [880320190] [2024-10-13 00:15:17,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:15:17,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:15:17,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:15:17,537 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:15:17,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 00:15:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:15:17,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:15:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:15:17,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:15:17,890 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:15:17,892 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:15:17,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 00:15:18,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-13 00:15:18,098 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 00:15:18,212 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:15:18,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:15:18 BoogieIcfgContainer [2024-10-13 00:15:18,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:15:18,220 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:15:18,220 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:15:18,220 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:15:18,221 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:14" (3/4) ... [2024-10-13 00:15:18,223 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:15:18,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:15:18,228 INFO L158 Benchmark]: Toolchain (without parser) took 5265.82ms. Allocated memory was 163.6MB in the beginning and 216.0MB in the end (delta: 52.4MB). Free memory was 130.2MB in the beginning and 66.9MB in the end (delta: 63.2MB). Peak memory consumption was 115.7MB. Max. memory is 16.1GB. [2024-10-13 00:15:18,229 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 123.7MB. Free memory was 84.8MB in the beginning and 84.7MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:15:18,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.52ms. Allocated memory is still 163.6MB. Free memory was 130.2MB in the beginning and 114.5MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 00:15:18,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.81ms. Allocated memory is still 163.6MB. Free memory was 114.5MB in the beginning and 110.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 00:15:18,229 INFO L158 Benchmark]: Boogie Preprocessor took 79.18ms. Allocated memory is still 163.6MB. Free memory was 110.3MB in the beginning and 105.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 00:15:18,230 INFO L158 Benchmark]: RCFGBuilder took 586.59ms. Allocated memory is still 163.6MB. Free memory was 105.1MB in the beginning and 75.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-13 00:15:18,230 INFO L158 Benchmark]: TraceAbstraction took 4097.73ms. Allocated memory was 163.6MB in the beginning and 216.0MB in the end (delta: 52.4MB). Free memory was 75.7MB in the beginning and 66.9MB in the end (delta: 8.8MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2024-10-13 00:15:18,230 INFO L158 Benchmark]: Witness Printer took 4.08ms. Allocated memory is still 216.0MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:15:18,234 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.16ms. Allocated memory is still 123.7MB. Free memory was 84.8MB in the beginning and 84.7MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.52ms. Allocated memory is still 163.6MB. Free memory was 130.2MB in the beginning and 114.5MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.81ms. Allocated memory is still 163.6MB. Free memory was 114.5MB in the beginning and 110.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.18ms. Allocated memory is still 163.6MB. Free memory was 110.3MB in the beginning and 105.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 586.59ms. Allocated memory is still 163.6MB. Free memory was 105.1MB in the beginning and 75.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4097.73ms. Allocated memory was 163.6MB in the beginning and 216.0MB in the end (delta: 52.4MB). Free memory was 75.7MB in the beginning and 66.9MB in the end (delta: 8.8MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * Witness Printer took 4.08ms. Allocated memory is still 216.0MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryArithmeticDOUBLEoperation at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] signed char var_1_2 = -1; [L24] signed char var_1_3 = 10; [L25] signed long int var_1_4 = 32; [L26] signed long int var_1_5 = 5; [L27] unsigned char var_1_6 = 0; [L28] double var_1_7 = 24.8; [L29] double var_1_8 = 500.5; [L30] double var_1_9 = 2.4; [L31] double var_1_10 = 0.4; [L32] double var_1_11 = 255.8; [L33] double var_1_12 = 50.75; [L34] unsigned char var_1_13 = 4; [L35] unsigned char var_1_14 = 200; [L36] unsigned char var_1_15 = 25; [L37] unsigned char var_1_16 = 128; [L38] unsigned char var_1_17 = 64; [L39] unsigned char var_1_18 = 32; [L40] unsigned char var_1_19 = 32; [L41] unsigned long int var_1_20 = 1; [L42] float var_1_21 = 9999999999.2; [L43] signed char var_1_22 = 10; [L44] double var_1_23 = 10.875; [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] FCALL updateLastVariables() [L149] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_char() [L91] CALL assume_abort_if_not(var_1_2 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=10, var_1_4=32, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=10, var_1_4=32, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L91] RET assume_abort_if_not(var_1_2 >= -1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=10, var_1_4=32, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L92] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=10, var_1_4=32, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=10, var_1_4=32, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L92] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=10, var_1_4=32, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L93] var_1_3 = __VERIFIER_nondet_char() [L94] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=32, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=32, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L94] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=32, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L95] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=32, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=32, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L95] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=32, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L96] var_1_4 = __VERIFIER_nondet_long() [L97] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L97] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L98] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L98] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L99] var_1_5 = __VERIFIER_nondet_long() [L100] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L100] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L101] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L101] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L102] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L102] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L103] var_1_6 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L104] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L105] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L105] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L106] var_1_8 = __VERIFIER_nondet_double() [L107] 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=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L107] 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=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L108] var_1_9 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L109] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L110] var_1_10 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L111] RET assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L112] var_1_11 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L113] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L114] var_1_12 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L115] RET assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L116] var_1_14 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_14 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L117] RET assume_abort_if_not(var_1_14 >= 190) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L118] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L118] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L119] var_1_15 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L120] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L121] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L121] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L122] var_1_16 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_16 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L123] RET assume_abort_if_not(var_1_16 >= 127) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L124] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L124] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L125] var_1_17 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L126] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L127] CALL assume_abort_if_not(var_1_17 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L127] RET assume_abort_if_not(var_1_17 <= 64) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L128] var_1_18 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L129] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L130] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L130] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L131] var_1_19 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L132] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L133] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L133] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=10, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L134] var_1_22 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_22 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L135] RET assume_abort_if_not(var_1_22 >= -128) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L136] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L136] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L149] RET updateVariables() [L150] CALL step() [L48] COND TRUE (var_1_2 - var_1_3) > (var_1_4 / var_1_5) [L49] var_1_1 = (128 - var_1_3) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L57] signed long int stepLocal_0 = -256; VAL [isInitial=1, stepLocal_0=-256, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1, var_1_7=124/5] [L58] COND TRUE stepLocal_0 <= var_1_2 [L59] var_1_7 = (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1] [L65] COND TRUE var_1_11 <= var_1_9 [L66] var_1_13 = ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) VAL [isInitial=1, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1] [L68] EXPR (var_1_2 * var_1_4) & var_1_13 VAL [isInitial=1, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1] [L68] signed long int stepLocal_1 = (var_1_2 * var_1_4) & var_1_13; [L69] COND FALSE !(var_1_3 < stepLocal_1) VAL [isInitial=1, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1] [L72] signed long int stepLocal_2 = ((((var_1_22) > (var_1_5)) ? (var_1_22) : (var_1_5))) + (var_1_1 / var_1_14); VAL [isInitial=1, stepLocal_2=3, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1] [L73] EXPR var_1_20 & var_1_3 VAL [isInitial=1, stepLocal_2=3, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1] [L73] COND FALSE !(stepLocal_2 <= (var_1_20 & var_1_3)) [L80] var_1_21 = var_1_12 VAL [isInitial=1, var_1_12=2, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1] [L82] unsigned char stepLocal_3 = var_1_1; VAL [isInitial=1, stepLocal_3=128, var_1_12=2, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1] [L83] COND FALSE !(stepLocal_3 > var_1_13) VAL [isInitial=1, var_1_12=2, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1] [L150] RET step() [L151] CALL, EXPR property() [L141] EXPR (((((var_1_2 - var_1_3) > (var_1_4 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_4) & var_1_13)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1) VAL [isInitial=1, var_1_12=2, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1] [L141] EXPR ((((((var_1_2 - var_1_3) > (var_1_4 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_4) & var_1_13)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_22) > (var_1_5)) ? (var_1_22) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_20 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12))) VAL [isInitial=1, var_1_12=2, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1] [L141-L142] return (((((((var_1_2 - var_1_3) > (var_1_4 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_4) & var_1_13)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_22) > (var_1_5)) ? (var_1_22) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_20 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12)))) && ((var_1_1 > var_1_13) ? ((! (! var_1_6)) ? (var_1_23 == ((double) var_1_8)) : 1) : 1) ; [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=2, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1] [L19] reach_error() VAL [isInitial=1, var_1_12=2, var_1_13=254, var_1_14=254, var_1_15=0, var_1_16=254, var_1_17=0, var_1_18=0, var_1_19=-256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_22=-128, var_1_23=87/8, var_1_2=0, var_1_3=0, var_1_4=-5, var_1_5=3, var_1_6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 3, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 437 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 215 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 401 IncrementalHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 222 mSDtfsCounter, 401 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 535 GetRequests, 520 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 940 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 748 ConstructedInterpolants, 0 QuantifiedInterpolants, 1328 SizeOfPredicates, 0 NumberOfNonLiveVariables, 401 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6717/6960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 00:15:18,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-57.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c969fd24711e8e1435b6ebbcc95d2d51ddca4d264d4ae9716ffc89d5150558e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:15:20,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:15:20,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:15:20,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:15:20,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:15:20,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:15:20,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:15:20,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:15:20,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:15:20,695 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:15:20,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:15:20,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:15:20,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:15:20,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:15:20,697 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:15:20,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:15:20,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:15:20,700 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:15:20,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:15:20,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:15:20,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:15:20,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:15:20,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:15:20,702 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:15:20,703 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:15:20,703 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:15:20,703 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:15:20,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:15:20,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:15:20,704 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:15:20,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:15:20,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:15:20,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:15:20,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:15:20,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:15:20,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:15:20,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:15:20,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:15:20,707 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:15:20,707 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:15:20,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:15:20,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:15:20,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:15:20,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:15:20,709 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:15:20,710 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c969fd24711e8e1435b6ebbcc95d2d51ddca4d264d4ae9716ffc89d5150558e [2024-10-13 00:15:21,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:15:21,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:15:21,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:15:21,069 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:15:21,070 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:15:21,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-57.i [2024-10-13 00:15:22,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:15:22,907 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:15:22,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-57.i [2024-10-13 00:15:22,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4169c2b94/09017b83b0e64c6884905f715c29f0d5/FLAG1be3a20f8 [2024-10-13 00:15:22,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4169c2b94/09017b83b0e64c6884905f715c29f0d5 [2024-10-13 00:15:22,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:15:22,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:15:22,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:15:22,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:15:22,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:15:22,944 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:15:22" (1/1) ... [2024-10-13 00:15:22,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127dc8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:22, skipping insertion in model container [2024-10-13 00:15:22,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:15:22" (1/1) ... [2024-10-13 00:15:22,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:15:23,137 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-57.i[917,930] [2024-10-13 00:15:23,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:15:23,228 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:15:23,242 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-57.i[917,930] [2024-10-13 00:15:23,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:15:23,320 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:15:23,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:23 WrapperNode [2024-10-13 00:15:23,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:15:23,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:15:23,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:15:23,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:15:23,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:23" (1/1) ... [2024-10-13 00:15:23,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:23" (1/1) ... [2024-10-13 00:15:23,385 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2024-10-13 00:15:23,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:15:23,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:15:23,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:15:23,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:15:23,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:23" (1/1) ... [2024-10-13 00:15:23,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:23" (1/1) ... [2024-10-13 00:15:23,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:23" (1/1) ... [2024-10-13 00:15:23,430 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:15:23,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:23" (1/1) ... [2024-10-13 00:15:23,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:23" (1/1) ... [2024-10-13 00:15:23,448 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:23" (1/1) ... [2024-10-13 00:15:23,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:23" (1/1) ... [2024-10-13 00:15:23,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:23" (1/1) ... [2024-10-13 00:15:23,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:23" (1/1) ... [2024-10-13 00:15:23,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:15:23,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:15:23,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:15:23,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:15:23,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:23" (1/1) ... [2024-10-13 00:15:23,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:15:23,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:15:23,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:15:23,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:15:23,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:15:23,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:15:23,556 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:15:23,556 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:15:23,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:15:23,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:15:23,668 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:15:23,670 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:15:30,176 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 00:15:30,177 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:15:30,246 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:15:30,246 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:15:30,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:30 BoogieIcfgContainer [2024-10-13 00:15:30,247 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:15:30,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:15:30,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:15:30,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:15:30,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:15:22" (1/3) ... [2024-10-13 00:15:30,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bbbc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:15:30, skipping insertion in model container [2024-10-13 00:15:30,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:23" (2/3) ... [2024-10-13 00:15:30,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bbbc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:15:30, skipping insertion in model container [2024-10-13 00:15:30,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:30" (3/3) ... [2024-10-13 00:15:30,258 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-57.i [2024-10-13 00:15:30,274 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:15:30,274 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:15:30,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:15:30,330 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;@13eb0f7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:15:30,331 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:15:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 00:15:30,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-13 00:15:30,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:15:30,355 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:15:30,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:15:30,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:15:30,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1722034434, now seen corresponding path program 1 times [2024-10-13 00:15:30,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:15:30,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434829122] [2024-10-13 00:15:30,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:15:30,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:15:30,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:15:30,376 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:15:30,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 00:15:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:30,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:15:30,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:15:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 874 proven. 0 refuted. 0 times theorem prover too weak. 866 trivial. 0 not checked. [2024-10-13 00:15:30,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:15:30,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:15:30,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434829122] [2024-10-13 00:15:30,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434829122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:15:30,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:15:30,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:15:30,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900239689] [2024-10-13 00:15:30,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:15:30,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:15:30,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:15:31,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:15:31,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:15:31,004 INFO L87 Difference]: Start difference. First operand has 74 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-13 00:15:34,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:15:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:15:34,912 INFO L93 Difference]: Finished difference Result 145 states and 260 transitions. [2024-10-13 00:15:34,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:15:34,958 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 182 [2024-10-13 00:15:34,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:15:34,964 INFO L225 Difference]: With dead ends: 145 [2024-10-13 00:15:34,964 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 00:15:34,967 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-13 00:15:34,970 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-13 00:15:34,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-13 00:15:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 00:15:35,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-13 00:15:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 00:15:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 111 transitions. [2024-10-13 00:15:35,010 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 111 transitions. Word has length 182 [2024-10-13 00:15:35,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:15:35,011 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 111 transitions. [2024-10-13 00:15:35,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-13 00:15:35,012 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 111 transitions. [2024-10-13 00:15:35,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-13 00:15:35,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:15:35,016 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:15:35,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 00:15:35,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:15:35,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:15:35,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:15:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1437405366, now seen corresponding path program 1 times [2024-10-13 00:15:35,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:15:35,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877118742] [2024-10-13 00:15:35,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:15:35,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:15:35,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:15:35,222 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:15:35,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 00:15:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:36,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-13 00:15:36,058 INFO L278 TraceCheckSpWp]: Computing forward predicates...