./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:06:38,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:06:38,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:06:38,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:06:38,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:06:38,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:06:38,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:06:38,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:06:38,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:06:38,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:06:38,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:06:38,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:06:38,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:06:38,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:06:38,326 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:06:38,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:06:38,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:06:38,327 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:06:38,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:06:38,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:06:38,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:06:38,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:06:38,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:06:38,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:06:38,331 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:06:38,332 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:06:38,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:06:38,332 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:06:38,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:06:38,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:06:38,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:06:38,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:06:38,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:06:38,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:06:38,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:06:38,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:06:38,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:06:38,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:06:38,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:06:38,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:06:38,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:06:38,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:06:38,338 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 [2024-10-11 11:06:38,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:06:38,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:06:38,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:06:38,643 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:06:38,644 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:06:38,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-10-11 11:06:40,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:06:40,366 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:06:40,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-10-11 11:06:40,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/28e47d8c3/cafa97761f3848a39cb8d69ed2888db8/FLAG0acd80759 [2024-10-11 11:06:40,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/28e47d8c3/cafa97761f3848a39cb8d69ed2888db8 [2024-10-11 11:06:40,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:06:40,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:06:40,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:06:40,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:06:40,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:06:40,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:06:40" (1/1) ... [2024-10-11 11:06:40,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2095af71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:40, skipping insertion in model container [2024-10-11 11:06:40,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:06:40" (1/1) ... [2024-10-11 11:06:40,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:06:40,604 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i[916,929] [2024-10-11 11:06:40,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:06:40,693 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:06:40,705 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i[916,929] [2024-10-11 11:06:40,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:06:40,809 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:06:40,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:40 WrapperNode [2024-10-11 11:06:40,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:06:40,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:06:40,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:06:40,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:06:40,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:40" (1/1) ... [2024-10-11 11:06:40,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:40" (1/1) ... [2024-10-11 11:06:40,923 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2024-10-11 11:06:40,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:06:40,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:06:40,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:06:40,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:06:40,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:40" (1/1) ... [2024-10-11 11:06:40,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:40" (1/1) ... [2024-10-11 11:06:40,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:40" (1/1) ... [2024-10-11 11:06:40,982 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:06:40,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:40" (1/1) ... [2024-10-11 11:06:40,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:40" (1/1) ... [2024-10-11 11:06:41,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:40" (1/1) ... [2024-10-11 11:06:41,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:40" (1/1) ... [2024-10-11 11:06:41,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:40" (1/1) ... [2024-10-11 11:06:41,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:40" (1/1) ... [2024-10-11 11:06:41,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:06:41,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:06:41,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:06:41,031 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:06:41,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:40" (1/1) ... [2024-10-11 11:06:41,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:06:41,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:06:41,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:06:41,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:06:41,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:06:41,113 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:06:41,114 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:06:41,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:06:41,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:06:41,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:06:41,197 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:06:41,199 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:06:41,578 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-11 11:06:41,579 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:06:41,646 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:06:41,646 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:06:41,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:06:41 BoogieIcfgContainer [2024-10-11 11:06:41,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:06:41,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:06:41,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:06:41,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:06:41,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:06:40" (1/3) ... [2024-10-11 11:06:41,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b084cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:06:41, skipping insertion in model container [2024-10-11 11:06:41,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:40" (2/3) ... [2024-10-11 11:06:41,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b084cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:06:41, skipping insertion in model container [2024-10-11 11:06:41,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:06:41" (3/3) ... [2024-10-11 11:06:41,655 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-10-11 11:06:41,671 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:06:41,671 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:06:41,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:06:41,729 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;@68f00f41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:06:41,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:06:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:06:41,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 11:06:41,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:06:41,751 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:06:41,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:06:41,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:06:41,757 INFO L85 PathProgramCache]: Analyzing trace with hash 273692504, now seen corresponding path program 1 times [2024-10-11 11:06:41,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:06:41,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107980461] [2024-10-11 11:06:41,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:06:41,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:06:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:06:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:06:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:06:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:06:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:06:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:06:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:06:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:06:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:06:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:06:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:06:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:06:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:06:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:06:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:06:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:06:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:06:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:06:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:06:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:06:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:06:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:06:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:06:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:06:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:06:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 11:06:42,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:06:42,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107980461] [2024-10-11 11:06:42,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107980461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:06:42,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:06:42,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:06:42,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073213682] [2024-10-11 11:06:42,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:06:42,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:06:42,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:06:42,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:06:42,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:06:42,337 INFO L87 Difference]: Start difference. First operand has 77 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:06:42,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:06:42,402 INFO L93 Difference]: Finished difference Result 153 states and 268 transitions. [2024-10-11 11:06:42,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:06:42,405 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2024-10-11 11:06:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:06:42,414 INFO L225 Difference]: With dead ends: 153 [2024-10-11 11:06:42,415 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 11:06:42,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:06:42,422 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:06:42,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:06:42,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 11:06:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-11 11:06:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:06:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2024-10-11 11:06:42,479 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 161 [2024-10-11 11:06:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:06:42,481 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2024-10-11 11:06:42,481 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:06:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2024-10-11 11:06:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 11:06:42,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:06:42,487 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:06:42,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:06:42,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:06:42,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:06:42,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2140495986, now seen corresponding path program 1 times [2024-10-11 11:06:42,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:06:42,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831842327] [2024-10-11 11:06:42,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:06:42,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:06:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:06:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:06:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:06:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:06:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:06:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:06:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:06:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:06:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:06:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:06:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:06:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:06:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:06:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:06:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:06:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:06:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:06:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:06:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:06:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:06:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:06:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:06:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:06:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:06:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:06:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 11:06:43,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:06:43,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831842327] [2024-10-11 11:06:43,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831842327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:06:43,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:06:43,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:06:43,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245794296] [2024-10-11 11:06:43,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:06:43,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:06:43,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:06:43,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:06:43,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:06:43,216 INFO L87 Difference]: Start difference. First operand 75 states and 117 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 11:06:43,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:06:43,478 INFO L93 Difference]: Finished difference Result 224 states and 350 transitions. [2024-10-11 11:06:43,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:06:43,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2024-10-11 11:06:43,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:06:43,482 INFO L225 Difference]: With dead ends: 224 [2024-10-11 11:06:43,482 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 11:06:43,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:06:43,484 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 85 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:06:43,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 327 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:06:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 11:06:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 120. [2024-10-11 11:06:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 67 states have internal predecessors, (86), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 11:06:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2024-10-11 11:06:43,522 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 161 [2024-10-11 11:06:43,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:06:43,523 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2024-10-11 11:06:43,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 11:06:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2024-10-11 11:06:43,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 11:06:43,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:06:43,531 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:06:43,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:06:43,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:06:43,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:06:43,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1432839074, now seen corresponding path program 1 times [2024-10-11 11:06:43,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:06:43,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829841810] [2024-10-11 11:06:43,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:06:43,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:06:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:43,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:06:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:06:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:06:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:06:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:06:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:06:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:06:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:06:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:06:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:06:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:06:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:06:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:06:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:06:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:06:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:06:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:06:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:06:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:06:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:06:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:06:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:06:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:06:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:06:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:06:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 11:06:44,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:06:44,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829841810] [2024-10-11 11:06:44,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829841810] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:06:44,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007326369] [2024-10-11 11:06:44,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:06:44,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:06:44,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:06:44,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:06:44,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:06:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:44,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:06:44,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:06:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 568 proven. 24 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2024-10-11 11:06:44,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:06:44,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 11:06:44,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007326369] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:06:44,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:06:44,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 11:06:44,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887608567] [2024-10-11 11:06:44,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:06:44,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:06:44,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:06:44,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:06:44,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:06:44,714 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 11:06:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:06:45,039 INFO L93 Difference]: Finished difference Result 210 states and 316 transitions. [2024-10-11 11:06:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:06:45,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 162 [2024-10-11 11:06:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:06:45,042 INFO L225 Difference]: With dead ends: 210 [2024-10-11 11:06:45,043 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 11:06:45,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 369 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:06:45,048 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 176 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:06:45,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 197 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:06:45,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 11:06:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2024-10-11 11:06:45,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 11:06:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2024-10-11 11:06:45,082 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 162 [2024-10-11 11:06:45,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:06:45,082 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2024-10-11 11:06:45,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 11:06:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2024-10-11 11:06:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 11:06:45,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:06:45,085 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:06:45,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:06:45,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:06:45,292 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:06:45,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:06:45,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1818060119, now seen corresponding path program 1 times [2024-10-11 11:06:45,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:06:45,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811302336] [2024-10-11 11:06:45,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:06:45,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:06:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:06:45,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [616719884] [2024-10-11 11:06:45,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:06:45,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:06:45,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:06:45,578 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:06:45,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:06:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:06:45,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:06:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:06:46,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:06:46,027 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:06:46,028 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:06:46,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 11:06:46,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:06:46,235 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 11:06:46,352 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:06:46,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:06:46 BoogieIcfgContainer [2024-10-11 11:06:46,356 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:06:46,357 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:06:46,357 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:06:46,357 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:06:46,358 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:06:41" (3/4) ... [2024-10-11 11:06:46,360 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:06:46,361 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:06:46,362 INFO L158 Benchmark]: Toolchain (without parser) took 5962.46ms. Allocated memory was 172.0MB in the beginning and 232.8MB in the end (delta: 60.8MB). Free memory was 101.0MB in the beginning and 77.7MB in the end (delta: 23.2MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. [2024-10-11 11:06:46,362 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 172.0MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:06:46,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.94ms. Allocated memory is still 172.0MB. Free memory was 100.8MB in the beginning and 142.3MB in the end (delta: -41.5MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-10-11 11:06:46,363 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.56ms. Allocated memory is still 172.0MB. Free memory was 142.3MB in the beginning and 136.4MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:06:46,363 INFO L158 Benchmark]: Boogie Preprocessor took 104.74ms. Allocated memory is still 172.0MB. Free memory was 136.4MB in the beginning and 124.7MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 11:06:46,363 INFO L158 Benchmark]: RCFGBuilder took 616.43ms. Allocated memory is still 172.0MB. Free memory was 124.7MB in the beginning and 87.6MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-11 11:06:46,363 INFO L158 Benchmark]: TraceAbstraction took 4707.10ms. Allocated memory was 172.0MB in the beginning and 232.8MB in the end (delta: 60.8MB). Free memory was 86.9MB in the beginning and 77.7MB in the end (delta: 9.2MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2024-10-11 11:06:46,363 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 232.8MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:06:46,365 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.19ms. Allocated memory is still 172.0MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.94ms. Allocated memory is still 172.0MB. Free memory was 100.8MB in the beginning and 142.3MB in the end (delta: -41.5MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.56ms. Allocated memory is still 172.0MB. Free memory was 142.3MB in the beginning and 136.4MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.74ms. Allocated memory is still 172.0MB. Free memory was 136.4MB in the beginning and 124.7MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 616.43ms. Allocated memory is still 172.0MB. Free memory was 124.7MB in the beginning and 87.6MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4707.10ms. Allocated memory was 172.0MB in the beginning and 232.8MB in the end (delta: 60.8MB). Free memory was 86.9MB in the beginning and 77.7MB in the end (delta: 9.2MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 232.8MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryArithmeticFLOAToperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] unsigned char var_1_3 = 0; [L24] float var_1_8 = 128.5; [L25] float var_1_9 = 127.75; [L26] float var_1_10 = 31.8; [L27] float var_1_11 = 32.5; [L28] unsigned char var_1_12 = 8; [L29] unsigned char var_1_13 = 100; [L30] unsigned char var_1_14 = 25; [L31] unsigned char var_1_15 = 32; [L32] unsigned char var_1_16 = 16; [L33] double var_1_17 = 64.8; [L34] unsigned char var_1_18 = 1; [L35] unsigned char var_1_19 = 0; [L36] unsigned char var_1_20 = 0; [L37] signed char var_1_21 = -100; [L38] signed long int var_1_22 = -1; [L39] float var_1_23 = 5.6; [L40] float var_1_24 = 50.88; [L41] signed short int var_1_25 = -5; [L42] unsigned char var_1_26 = 1; [L43] unsigned char var_1_27 = 128; [L44] unsigned char var_1_28 = 5; [L45] signed short int var_1_29 = -64; [L46] unsigned long int var_1_32 = 16; [L47] unsigned char last_1_var_1_12 = 8; [L48] unsigned char last_1_var_1_18 = 1; [L49] signed short int last_1_var_1_25 = -5; [L50] unsigned char last_1_var_1_26 = 1; [L191] isInitial = 1 [L192] FCALL initially() [L193] int k_loop; [L194] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=0, var_1_8=257/2, var_1_9=511/4] [L194] COND TRUE k_loop < 1 [L195] CALL updateLastVariables() [L181] last_1_var_1_12 = var_1_12 [L182] last_1_var_1_18 = var_1_18 [L183] last_1_var_1_25 = var_1_25 [L184] last_1_var_1_26 = var_1_26 [L195] RET updateLastVariables() [L196] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_8=257/2, var_1_9=511/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_8=257/2, var_1_9=511/4] [L141] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_8=257/2, var_1_9=511/4] [L142] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2, var_1_9=511/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2, var_1_9=511/4] [L142] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2, var_1_9=511/4] [L143] var_1_9 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L144] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L145] var_1_10 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L146] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L147] var_1_11 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L148] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L149] var_1_13 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_13 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L150] RET assume_abort_if_not(var_1_13 >= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L151] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L151] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L152] var_1_14 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L153] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L154] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L154] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L155] var_1_15 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_15 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L156] RET assume_abort_if_not(var_1_15 >= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L157] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L157] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L158] var_1_16 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L159] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L160] CALL assume_abort_if_not(var_1_16 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L160] RET assume_abort_if_not(var_1_16 <= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L161] var_1_19 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L162] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L163] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L163] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L164] var_1_20 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L165] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L166] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L166] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L167] var_1_22 = __VERIFIER_nondet_long() [L168] CALL assume_abort_if_not(var_1_22 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L168] RET assume_abort_if_not(var_1_22 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L169] CALL assume_abort_if_not(var_1_22 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L169] RET assume_abort_if_not(var_1_22 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L170] CALL assume_abort_if_not(var_1_22 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L170] RET assume_abort_if_not(var_1_22 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L171] var_1_24 = __VERIFIER_nondet_float() [L172] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L172] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L173] var_1_27 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L174] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L175] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L175] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L176] var_1_28 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L177] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L178] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L178] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L196] RET updateVariables() [L197] CALL step() [L54] unsigned char stepLocal_1 = last_1_var_1_18; [L55] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_0=8, stepLocal_1=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L56] COND TRUE last_1_var_1_18 || stepLocal_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_0=8, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L57] COND TRUE stepLocal_0 >= last_1_var_1_26 [L58] var_1_1 = (last_1_var_1_12 + last_1_var_1_12) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L65] unsigned long int stepLocal_8 = 10u / var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_8=0, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L66] COND TRUE ! var_1_20 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_8=0, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L67] COND TRUE stepLocal_8 < (var_1_22 + var_1_1) [L68] var_1_26 = ((((var_1_13) < ((var_1_27 - var_1_28))) ? (var_1_13) : ((var_1_27 - var_1_28)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L73] signed long int stepLocal_4 = ((((var_1_16) < (var_1_13)) ? (var_1_16) : (var_1_13))) / var_1_22; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_4=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L74] COND TRUE ((25 + var_1_26) / var_1_15) > stepLocal_4 [L75] var_1_21 = ((((var_1_16) < (var_1_14)) ? (var_1_16) : (var_1_14))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L79] signed short int stepLocal_3 = var_1_1; [L80] signed char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_2=16, stepLocal_3=16, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L81] COND TRUE var_1_1 >= stepLocal_2 [L82] var_1_12 = ((var_1_13 - var_1_14) + (100 - (var_1_15 - var_1_16))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_3=16, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L90] var_1_8 = ((var_1_9 - var_1_10) + var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_3=16, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1] [L91] COND TRUE \read(var_1_3) [L92] var_1_18 = (var_1_19 || ((var_1_10 > var_1_8) && var_1_20)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_3=16, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1] [L96] unsigned char stepLocal_10 = var_1_26; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=127, stepLocal_3=16, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1] [L97] COND FALSE !(var_1_8 <= (var_1_24 * ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) [L104] var_1_32 = var_1_27 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=127, stepLocal_3=16, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=254, var_1_3=1] [L106] COND TRUE (((((var_1_13) > (0)) ? (var_1_13) : (0))) - var_1_32) >= var_1_32 [L107] var_1_17 = (var_1_10 + var_1_9) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=127, stepLocal_3=16, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=254, var_1_3=1] [L113] COND TRUE var_1_32 <= (- var_1_21) [L114] var_1_23 = ((((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) - var_1_24) + var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=127, stepLocal_3=16, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=254, var_1_3=1] [L118] signed long int stepLocal_7 = -32; [L119] unsigned long int stepLocal_6 = var_1_32; [L120] unsigned char stepLocal_5 = 10 > 8; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=127, stepLocal_3=16, stepLocal_5=1, stepLocal_6=254, stepLocal_7=-32, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=254, var_1_3=1] [L121] COND FALSE !(stepLocal_7 > (~ last_1_var_1_25)) [L128] var_1_25 = var_1_14 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=127, stepLocal_3=16, stepLocal_5=1, stepLocal_6=254, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_25=16, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=254, var_1_3=1] [L130] unsigned char stepLocal_9 = var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=127, stepLocal_3=16, stepLocal_5=1, stepLocal_6=254, stepLocal_9=0, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_25=16, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=254, var_1_3=1] [L131] COND FALSE !(stepLocal_9 && var_1_18) [L136] var_1_29 = 1000 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=127, stepLocal_3=16, stepLocal_5=1, stepLocal_6=254, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_25=16, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=1000, var_1_32=254, var_1_3=1] [L197] RET step() [L198] CALL, EXPR property() [L187-L188] return (((((((((((last_1_var_1_18 || last_1_var_1_18) ? ((last_1_var_1_12 >= last_1_var_1_26) ? (var_1_1 == ((signed short int) (last_1_var_1_12 + last_1_var_1_12))) : (var_1_1 == ((signed short int) last_1_var_1_12))) : (var_1_1 == ((signed short int) last_1_var_1_12))) && (var_1_8 == ((float) ((var_1_9 - var_1_10) + var_1_11)))) && ((var_1_1 >= var_1_21) ? (var_1_12 == ((unsigned char) ((var_1_13 - var_1_14) + (100 - (var_1_15 - var_1_16))))) : ((var_1_1 <= 100) ? (var_1_12 == ((unsigned char) ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13))))) : (var_1_12 == ((unsigned char) var_1_13))))) && (((((((var_1_13) > (0)) ? (var_1_13) : (0))) - var_1_32) >= var_1_32) ? (var_1_17 == ((double) (var_1_10 + var_1_9))) : (var_1_18 ? (var_1_17 == ((double) var_1_9)) : 1))) && (var_1_3 ? (var_1_18 == ((unsigned char) (var_1_19 || ((var_1_10 > var_1_8) && var_1_20)))) : (var_1_18 == ((unsigned char) ((! (! var_1_19)) || var_1_20))))) && ((((25 + var_1_26) / var_1_15) > (((((var_1_16) < (var_1_13)) ? (var_1_16) : (var_1_13))) / var_1_22)) ? (var_1_21 == ((signed char) ((((var_1_16) < (var_1_14)) ? (var_1_16) : (var_1_14))))) : (var_1_21 == ((signed char) var_1_14)))) && ((var_1_32 <= (- var_1_21)) ? (var_1_23 == ((float) ((((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) - var_1_24) + var_1_11))) : (var_1_23 == ((float) ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))))))) && ((-32 > (~ last_1_var_1_25)) ? (((var_1_10 <= (- var_1_9)) || (10 > 8)) ? ((last_1_var_1_25 > var_1_32) ? (var_1_25 == ((signed short int) var_1_32)) : 1) : 1) : (var_1_25 == ((signed short int) var_1_14)))) && ((! var_1_20) ? (((10u / var_1_13) < (var_1_22 + var_1_1)) ? (var_1_26 == ((unsigned char) ((((var_1_13) < ((var_1_27 - var_1_28))) ? (var_1_13) : ((var_1_27 - var_1_28)))))) : (var_1_26 == ((unsigned char) (var_1_16 + var_1_15)))) : 1)) && ((var_1_18 && var_1_18) ? (((var_1_10 - (var_1_9 + var_1_24)) == var_1_23) ? (var_1_29 == ((signed short int) ((((var_1_14) < (((((1) < (var_1_21)) ? (1) : (var_1_21))))) ? (var_1_14) : (((((1) < (var_1_21)) ? (1) : (var_1_21)))))))) : 1) : (var_1_29 == ((signed short int) 1000)))) && ((var_1_8 <= (var_1_24 * ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) ? ((var_1_26 > (- (- var_1_26))) ? (var_1_32 == ((unsigned long int) var_1_26)) : (var_1_32 == ((unsigned long int) var_1_13))) : (var_1_32 == ((unsigned long int) var_1_27))) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_25=16, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=1000, var_1_32=254, var_1_3=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_25=16, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=1000, var_1_32=254, var_1_3=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 276 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 638 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 331 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 307 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 513 GetRequests, 499 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 972 NumberOfCodeBlocks, 972 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 803 ConstructedInterpolants, 0 QuantifiedInterpolants, 1675 SizeOfPredicates, 2 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 5928/6000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:06:46,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:06:48,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:06:48,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:06:48,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:06:48,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:06:48,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:06:48,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:06:48,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:06:48,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:06:48,797 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:06:48,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:06:48,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:06:48,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:06:48,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:06:48,799 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:06:48,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:06:48,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:06:48,800 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:06:48,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:06:48,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:06:48,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:06:48,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:06:48,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:06:48,806 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:06:48,807 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:06:48,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:06:48,810 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:06:48,810 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:06:48,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:06:48,811 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:06:48,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:06:48,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:06:48,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:06:48,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:06:48,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:06:48,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:06:48,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:06:48,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:06:48,813 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:06:48,813 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:06:48,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:06:48,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:06:48,815 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:06:48,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:06:48,816 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:06:48,817 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 [2024-10-11 11:06:49,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:06:49,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:06:49,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:06:49,201 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:06:49,203 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:06:49,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-10-11 11:06:50,720 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:06:50,961 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:06:50,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-10-11 11:06:50,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a96f47cea/1d7187a1e60d40a496ccb2edad33428b/FLAGc2f9c111e [2024-10-11 11:06:50,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a96f47cea/1d7187a1e60d40a496ccb2edad33428b [2024-10-11 11:06:50,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:06:50,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:06:51,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:06:51,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:06:51,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:06:51,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:06:50" (1/1) ... [2024-10-11 11:06:51,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ee4a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:51, skipping insertion in model container [2024-10-11 11:06:51,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:06:50" (1/1) ... [2024-10-11 11:06:51,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:06:51,246 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i[916,929] [2024-10-11 11:06:51,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:06:51,358 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:06:51,371 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i[916,929] [2024-10-11 11:06:51,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:06:51,454 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:06:51,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:51 WrapperNode [2024-10-11 11:06:51,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:06:51,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:06:51,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:06:51,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:06:51,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:51" (1/1) ... [2024-10-11 11:06:51,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:51" (1/1) ... [2024-10-11 11:06:51,522 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-10-11 11:06:51,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:06:51,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:06:51,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:06:51,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:06:51,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:51" (1/1) ... [2024-10-11 11:06:51,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:51" (1/1) ... [2024-10-11 11:06:51,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:51" (1/1) ... [2024-10-11 11:06:51,559 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:06:51,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:51" (1/1) ... [2024-10-11 11:06:51,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:51" (1/1) ... [2024-10-11 11:06:51,584 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:51" (1/1) ... [2024-10-11 11:06:51,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:51" (1/1) ... [2024-10-11 11:06:51,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:51" (1/1) ... [2024-10-11 11:06:51,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:51" (1/1) ... [2024-10-11 11:06:51,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:06:51,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:06:51,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:06:51,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:06:51,608 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:51" (1/1) ... [2024-10-11 11:06:51,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:06:51,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:06:51,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:06:51,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:06:51,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:06:51,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:06:51,691 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:06:51,691 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:06:51,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:06:51,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:06:51,788 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:06:51,790 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:06:58,106 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-11 11:06:58,107 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:06:58,186 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:06:58,186 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:06:58,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:06:58 BoogieIcfgContainer [2024-10-11 11:06:58,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:06:58,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:06:58,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:06:58,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:06:58,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:06:50" (1/3) ... [2024-10-11 11:06:58,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49bb4afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:06:58, skipping insertion in model container [2024-10-11 11:06:58,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:51" (2/3) ... [2024-10-11 11:06:58,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49bb4afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:06:58, skipping insertion in model container [2024-10-11 11:06:58,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:06:58" (3/3) ... [2024-10-11 11:06:58,207 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-10-11 11:06:58,230 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:06:58,230 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:06:58,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:06:58,311 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;@b0b0d30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:06:58,312 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:06:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:06:58,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 11:06:58,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:06:58,334 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:06:58,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:06:58,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:06:58,342 INFO L85 PathProgramCache]: Analyzing trace with hash 273692504, now seen corresponding path program 1 times [2024-10-11 11:06:58,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:06:58,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367028159] [2024-10-11 11:06:58,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:06:58,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:06:58,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:06:58,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:06:58,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:06:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:06:58,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:06:58,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:06:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 11:06:58,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:06:58,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:06:58,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367028159] [2024-10-11 11:06:58,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367028159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:06:58,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:06:58,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:06:58,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892341733] [2024-10-11 11:06:58,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:06:59,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:06:59,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:06:59,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:06:59,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:06:59,026 INFO L87 Difference]: Start difference. First operand has 77 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:07:03,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:07:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:07:03,282 INFO L93 Difference]: Finished difference Result 153 states and 268 transitions. [2024-10-11 11:07:03,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:07:03,285 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2024-10-11 11:07:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:07:03,292 INFO L225 Difference]: With dead ends: 153 [2024-10-11 11:07:03,292 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 11:07:03,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:07:03,299 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:07:03,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 11:07:03,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 11:07:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-11 11:07:03,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:07:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2024-10-11 11:07:03,347 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 161 [2024-10-11 11:07:03,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:07:03,347 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2024-10-11 11:07:03,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:07:03,348 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2024-10-11 11:07:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 11:07:03,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:07:03,352 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:07:03,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:07:03,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:07:03,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:07:03,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:07:03,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2140495986, now seen corresponding path program 1 times [2024-10-11 11:07:03,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:07:03,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31401414] [2024-10-11 11:07:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:07:03,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:07:03,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:07:03,559 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:07:03,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:07:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:04,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 11:07:04,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:07:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 11:07:06,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:07:06,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:07:06,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31401414] [2024-10-11 11:07:06,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31401414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:07:06,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:07:06,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:07:06,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021239920] [2024-10-11 11:07:06,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:07:06,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:07:06,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:07:06,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:07:06,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:07:06,082 INFO L87 Difference]: Start difference. First operand 75 states and 117 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 11:07:10,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:07:14,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:07:18,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:07:22,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:07:26,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:07:29,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:07:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:07:29,911 INFO L93 Difference]: Finished difference Result 224 states and 350 transitions. [2024-10-11 11:07:29,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:07:29,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2024-10-11 11:07:29,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:07:29,919 INFO L225 Difference]: With dead ends: 224 [2024-10-11 11:07:29,919 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 11:07:29,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:07:29,921 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 83 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 51 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.7s IncrementalHoareTripleChecker+Time [2024-10-11 11:07:29,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 437 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 23.7s Time] [2024-10-11 11:07:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 11:07:29,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 120. [2024-10-11 11:07:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 67 states have internal predecessors, (86), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 11:07:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2024-10-11 11:07:29,951 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 161 [2024-10-11 11:07:29,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:07:29,952 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2024-10-11 11:07:29,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 11:07:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2024-10-11 11:07:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 11:07:29,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:07:29,954 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:07:29,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 11:07:30,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:07:30,156 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:07:30,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:07:30,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1432839074, now seen corresponding path program 1 times [2024-10-11 11:07:30,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:07:30,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847307923] [2024-10-11 11:07:30,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:07:30,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:07:30,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:07:30,161 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:07:30,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 11:07:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:30,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 11:07:30,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:07:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 568 proven. 24 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2024-10-11 11:07:31,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:07:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 11:07:32,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:07:32,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847307923] [2024-10-11 11:07:32,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847307923] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:07:32,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:07:32,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 11:07:32,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296615971] [2024-10-11 11:07:32,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:07:32,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:07:32,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:07:32,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:07:32,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:07:32,694 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 11:07:38,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:07:42,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:07:46,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:07:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:07:46,327 INFO L93 Difference]: Finished difference Result 210 states and 316 transitions. [2024-10-11 11:07:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:07:46,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 162 [2024-10-11 11:07:46,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:07:46,330 INFO L225 Difference]: With dead ends: 210 [2024-10-11 11:07:46,330 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 11:07:46,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:07:46,337 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 177 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 73 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:07:46,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 194 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 142 Invalid, 3 Unknown, 0 Unchecked, 13.3s Time] [2024-10-11 11:07:46,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 11:07:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2024-10-11 11:07:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 11:07:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2024-10-11 11:07:46,371 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 162 [2024-10-11 11:07:46,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:07:46,372 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2024-10-11 11:07:46,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 11:07:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2024-10-11 11:07:46,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 11:07:46,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:07:46,379 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:07:46,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 11:07:46,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:07:46,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:07:46,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:07:46,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1818060119, now seen corresponding path program 1 times [2024-10-11 11:07:46,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:07:46,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594998811] [2024-10-11 11:07:46,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:07:46,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:07:46,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:07:46,586 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:07:46,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 11:07:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:07:48,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-11 11:07:48,639 INFO L278 TraceCheckSpWp]: Computing forward predicates...