./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:30:28,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:30:29,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:30:29,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:30:29,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:30:29,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:30:29,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:30:29,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:30:29,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:30:29,070 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:30:29,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:30:29,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:30:29,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:30:29,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:30:29,073 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:30:29,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:30:29,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:30:29,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:30:29,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:30:29,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:30:29,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:30:29,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:30:29,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:30:29,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:30:29,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:30:29,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:30:29,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:30:29,079 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:30:29,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:30:29,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:30:29,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:30:29,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:30:29,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:30:29,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:30:29,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:30:29,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:30:29,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:30:29,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:30:29,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:30:29,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:30:29,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:30:29,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:30:29,083 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 [2024-11-08 23:30:29,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:30:29,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:30:29,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:30:29,368 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:30:29,369 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:30:29,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2024-11-08 23:30:30,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:30:31,015 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:30:31,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2024-11-08 23:30:31,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b8bc0122/92ab3b61ad744252b8d6fbf61e774418/FLAG98f156ea8 [2024-11-08 23:30:31,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b8bc0122/92ab3b61ad744252b8d6fbf61e774418 [2024-11-08 23:30:31,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:30:31,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:30:31,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:30:31,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:30:31,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:30:31,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:30:31" (1/1) ... [2024-11-08 23:30:31,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11032d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:31, skipping insertion in model container [2024-11-08 23:30:31,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:30:31" (1/1) ... [2024-11-08 23:30:31,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:30:31,269 WARN L250 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-while_file-39.i[916,929] [2024-11-08 23:30:31,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:30:31,426 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:30:31,437 WARN L250 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-while_file-39.i[916,929] [2024-11-08 23:30:31,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:30:31,510 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:30:31,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:31 WrapperNode [2024-11-08 23:30:31,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:30:31,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:30:31,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:30:31,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:30:31,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:31" (1/1) ... [2024-11-08 23:30:31,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:31" (1/1) ... [2024-11-08 23:30:31,574 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-11-08 23:30:31,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:30:31,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:30:31,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:30:31,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:30:31,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:31" (1/1) ... [2024-11-08 23:30:31,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:31" (1/1) ... [2024-11-08 23:30:31,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:31" (1/1) ... [2024-11-08 23:30:31,632 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-11-08 23:30:31,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:31" (1/1) ... [2024-11-08 23:30:31,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:31" (1/1) ... [2024-11-08 23:30:31,659 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:31" (1/1) ... [2024-11-08 23:30:31,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:31" (1/1) ... [2024-11-08 23:30:31,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:31" (1/1) ... [2024-11-08 23:30:31,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:31" (1/1) ... [2024-11-08 23:30:31,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:30:31,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:30:31,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:30:31,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:30:31,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:31" (1/1) ... [2024-11-08 23:30:31,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:30:31,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:30:31,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:30:31,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:30:31,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:30:31,784 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:30:31,786 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:30:31,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:30:31,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:30:31,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:30:31,900 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:30:31,905 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:30:32,398 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 23:30:32,398 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:30:32,417 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:30:32,418 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:30:32,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:30:32 BoogieIcfgContainer [2024-11-08 23:30:32,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:30:32,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:30:32,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:30:32,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:30:32,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:30:31" (1/3) ... [2024-11-08 23:30:32,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705c599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:30:32, skipping insertion in model container [2024-11-08 23:30:32,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:31" (2/3) ... [2024-11-08 23:30:32,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705c599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:30:32, skipping insertion in model container [2024-11-08 23:30:32,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:30:32" (3/3) ... [2024-11-08 23:30:32,434 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-39.i [2024-11-08 23:30:32,454 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:30:32,454 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:30:32,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:30:32,551 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;@5d2a7e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:30:32,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:30:32,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 64 states have internal predecessors, (90), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:30:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 23:30:32,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:30:32,578 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:30:32,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:30:32,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:30:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash 56376211, now seen corresponding path program 1 times [2024-11-08 23:30:32,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:30:32,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143287183] [2024-11-08 23:30:32,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:30:32,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:30:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:32,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:30:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:30:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:30:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:30:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:30:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:30:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:30:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:30:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 23:30:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:30:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 23:30:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:30:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 23:30:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:30:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:30:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:30:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:30:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 23:30:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:30:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 23:30:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:30:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 23:30:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:30:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 23:30:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:30:33,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:30:33,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143287183] [2024-11-08 23:30:33,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143287183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:30:33,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:30:33,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:30:33,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12217622] [2024-11-08 23:30:33,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:30:33,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:30:33,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:30:33,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:30:33,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:30:33,214 INFO L87 Difference]: Start difference. First operand has 90 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 64 states have internal predecessors, (90), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:30:33,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:30:33,243 INFO L93 Difference]: Finished difference Result 173 states and 294 transitions. [2024-11-08 23:30:33,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:30:33,245 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 166 [2024-11-08 23:30:33,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:30:33,252 INFO L225 Difference]: With dead ends: 173 [2024-11-08 23:30:33,253 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 23:30:33,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:30:33,260 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:30:33,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:30:33,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 23:30:33,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-08 23:30:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:30:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 131 transitions. [2024-11-08 23:30:33,310 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 131 transitions. Word has length 166 [2024-11-08 23:30:33,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:30:33,311 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 131 transitions. [2024-11-08 23:30:33,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:30:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 131 transitions. [2024-11-08 23:30:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 23:30:33,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:30:33,316 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:30:33,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:30:33,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:30:33,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:30:33,318 INFO L85 PathProgramCache]: Analyzing trace with hash 484201695, now seen corresponding path program 1 times [2024-11-08 23:30:33,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:30:33,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769119999] [2024-11-08 23:30:33,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:30:33,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:30:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:30:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:30:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:30:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:30:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:30:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:30:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:30:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:30:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 23:30:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:30:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 23:30:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:30:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 23:30:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:30:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:30:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:30:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:30:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 23:30:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:30:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 23:30:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:30:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 23:30:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:30:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 23:30:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:30:34,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:30:34,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769119999] [2024-11-08 23:30:34,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769119999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:30:34,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049363615] [2024-11-08 23:30:34,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:30:34,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:30:34,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:30:34,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:30:34,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:30:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:34,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 23:30:34,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:30:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-11-08 23:30:34,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:30:35,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:30:35,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049363615] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:30:35,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:30:35,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-08 23:30:35,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360880169] [2024-11-08 23:30:35,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:30:35,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:30:35,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:30:35,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:30:35,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:30:35,021 INFO L87 Difference]: Start difference. First operand 86 states and 131 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2024-11-08 23:30:35,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:30:35,679 INFO L93 Difference]: Finished difference Result 183 states and 271 transitions. [2024-11-08 23:30:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 23:30:35,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) Word has length 166 [2024-11-08 23:30:35,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:30:35,686 INFO L225 Difference]: With dead ends: 183 [2024-11-08 23:30:35,687 INFO L226 Difference]: Without dead ends: 100 [2024-11-08 23:30:35,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 374 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2024-11-08 23:30:35,690 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 287 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:30:35,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 236 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:30:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-08 23:30:35,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2024-11-08 23:30:35,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:30:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-11-08 23:30:35,722 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 166 [2024-11-08 23:30:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:30:35,723 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-11-08 23:30:35,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2024-11-08 23:30:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-11-08 23:30:35,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 23:30:35,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:30:35,728 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:30:35,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:30:35,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:30:35,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:30:35,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:30:35,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1938536091, now seen corresponding path program 1 times [2024-11-08 23:30:35,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:30:35,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607980466] [2024-11-08 23:30:35,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:30:35,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:30:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:30:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:30:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:30:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:30:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:30:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:30:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:30:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:30:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 23:30:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:30:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 23:30:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:30:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 23:30:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:30:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:30:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:30:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:30:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 23:30:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:30:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 23:30:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:30:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 23:30:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:30:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 23:30:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:30:36,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:30:36,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607980466] [2024-11-08 23:30:36,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607980466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:30:36,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561451292] [2024-11-08 23:30:36,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:30:36,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:30:36,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:30:36,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:30:36,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:30:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:36,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:30:36,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:30:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-08 23:30:36,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:30:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:30:36,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561451292] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:30:36,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:30:36,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-08 23:30:36,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273762895] [2024-11-08 23:30:36,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:30:36,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:30:36,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:30:36,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:30:36,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:30:36,996 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-08 23:30:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:30:37,218 INFO L93 Difference]: Finished difference Result 195 states and 274 transitions. [2024-11-08 23:30:37,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:30:37,219 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 166 [2024-11-08 23:30:37,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:30:37,221 INFO L225 Difference]: With dead ends: 195 [2024-11-08 23:30:37,222 INFO L226 Difference]: Without dead ends: 104 [2024-11-08 23:30:37,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:30:37,223 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 121 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:30:37,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 244 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:30:37,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-08 23:30:37,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2024-11-08 23:30:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 69 states have internal predecessors, (87), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:30:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2024-11-08 23:30:37,240 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 166 [2024-11-08 23:30:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:30:37,241 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2024-11-08 23:30:37,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-08 23:30:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-11-08 23:30:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 23:30:37,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:30:37,244 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:30:37,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:30:37,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-08 23:30:37,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:30:37,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:30:37,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1567125517, now seen corresponding path program 1 times [2024-11-08 23:30:37,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:30:37,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118696265] [2024-11-08 23:30:37,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:30:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:30:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:30:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:30:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:30:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:30:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:30:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:30:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:30:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:30:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 23:30:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:30:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 23:30:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:30:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 23:30:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:30:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:30:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:30:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:30:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 23:30:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:30:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 23:30:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:30:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 23:30:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:30:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 23:30:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:38,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 186 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2024-11-08 23:30:38,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:30:38,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118696265] [2024-11-08 23:30:38,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118696265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:30:38,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2340500] [2024-11-08 23:30:38,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:30:38,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:30:38,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:30:38,945 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:30:38,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 23:30:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:39,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 23:30:39,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:30:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 157 proven. 186 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-11-08 23:30:40,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:30:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 126 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-08 23:30:41,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2340500] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:30:41,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:30:41,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 11] total 29 [2024-11-08 23:30:41,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278895431] [2024-11-08 23:30:41,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:30:41,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-08 23:30:41,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:30:41,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-08 23:30:41,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2024-11-08 23:30:41,519 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand has 29 states, 29 states have (on average 4.689655172413793) internal successors, (136), 28 states have internal predecessors, (136), 7 states have call successors, (70), 4 states have call predecessors, (70), 8 states have return successors, (71), 7 states have call predecessors, (71), 7 states have call successors, (71) [2024-11-08 23:30:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:30:47,076 INFO L93 Difference]: Finished difference Result 404 states and 538 transitions. [2024-11-08 23:30:47,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-08 23:30:47,077 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.689655172413793) internal successors, (136), 28 states have internal predecessors, (136), 7 states have call successors, (70), 4 states have call predecessors, (70), 8 states have return successors, (71), 7 states have call predecessors, (71), 7 states have call successors, (71) Word has length 167 [2024-11-08 23:30:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:30:47,083 INFO L225 Difference]: With dead ends: 404 [2024-11-08 23:30:47,087 INFO L226 Difference]: Without dead ends: 309 [2024-11-08 23:30:47,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1079, Invalid=4033, Unknown=0, NotChecked=0, Total=5112 [2024-11-08 23:30:47,091 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 652 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:30:47,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 935 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 23:30:47,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-08 23:30:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 207. [2024-11-08 23:30:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 146 states have (on average 1.2397260273972603) internal successors, (181), 146 states have internal predecessors, (181), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 23:30:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 277 transitions. [2024-11-08 23:30:47,124 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 277 transitions. Word has length 167 [2024-11-08 23:30:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:30:47,125 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 277 transitions. [2024-11-08 23:30:47,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.689655172413793) internal successors, (136), 28 states have internal predecessors, (136), 7 states have call successors, (70), 4 states have call predecessors, (70), 8 states have return successors, (71), 7 states have call predecessors, (71), 7 states have call successors, (71) [2024-11-08 23:30:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 277 transitions. [2024-11-08 23:30:47,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 23:30:47,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:30:47,128 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:30:47,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 23:30:47,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:30:47,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:30:47,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:30:47,333 INFO L85 PathProgramCache]: Analyzing trace with hash 356102517, now seen corresponding path program 1 times [2024-11-08 23:30:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:30:47,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166504902] [2024-11-08 23:30:47,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:30:47,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:30:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:30:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:30:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:30:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:30:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:30:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:30:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:30:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:30:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 23:30:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:30:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 23:30:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:30:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 23:30:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:30:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:30:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:30:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:30:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 23:30:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:30:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 23:30:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:30:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 23:30:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:30:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 23:30:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:30:47,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:30:47,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166504902] [2024-11-08 23:30:47,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166504902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:30:47,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:30:47,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:30:47,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835371629] [2024-11-08 23:30:47,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:30:47,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:30:47,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:30:47,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:30:47,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:30:47,623 INFO L87 Difference]: Start difference. First operand 207 states and 277 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:30:47,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:30:47,686 INFO L93 Difference]: Finished difference Result 413 states and 552 transitions. [2024-11-08 23:30:47,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:30:47,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2024-11-08 23:30:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:30:47,691 INFO L225 Difference]: With dead ends: 413 [2024-11-08 23:30:47,691 INFO L226 Difference]: Without dead ends: 209 [2024-11-08 23:30:47,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-11-08 23:30:47,694 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 64 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:30:47,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 456 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:30:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-08 23:30:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 106. [2024-11-08 23:30:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 75 states have internal predecessors, (92), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:30:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 140 transitions. [2024-11-08 23:30:47,726 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 140 transitions. Word has length 167 [2024-11-08 23:30:47,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:30:47,727 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 140 transitions. [2024-11-08 23:30:47,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:30:47,727 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 140 transitions. [2024-11-08 23:30:47,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 23:30:47,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:30:47,729 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:30:47,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:30:47,729 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:30:47,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:30:47,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2101571387, now seen corresponding path program 1 times [2024-11-08 23:30:47,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:30:47,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715700685] [2024-11-08 23:30:47,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:30:47,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:30:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:30:47,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1390311984] [2024-11-08 23:30:47,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:30:47,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:30:47,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:30:47,930 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:30:47,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 23:30:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:48,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 23:30:48,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:30:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:30:48,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:30:48,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:30:48,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715700685] [2024-11-08 23:30:48,618 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:30:48,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390311984] [2024-11-08 23:30:48,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390311984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:30:48,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:30:48,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:30:48,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886713672] [2024-11-08 23:30:48,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:30:48,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:30:48,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:30:48,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:30:48,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:30:48,622 INFO L87 Difference]: Start difference. First operand 106 states and 140 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:30:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:30:48,888 INFO L93 Difference]: Finished difference Result 315 states and 418 transitions. [2024-11-08 23:30:48,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:30:48,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168 [2024-11-08 23:30:48,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:30:48,891 INFO L225 Difference]: With dead ends: 315 [2024-11-08 23:30:48,891 INFO L226 Difference]: Without dead ends: 212 [2024-11-08 23:30:48,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:30:48,892 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 106 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:30:48,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 476 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:30:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-08 23:30:48,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 179. [2024-11-08 23:30:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 118 states have internal predecessors, (139), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 23:30:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 235 transitions. [2024-11-08 23:30:48,929 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 235 transitions. Word has length 168 [2024-11-08 23:30:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:30:48,929 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 235 transitions. [2024-11-08 23:30:48,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:30:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 235 transitions. [2024-11-08 23:30:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 23:30:48,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:30:48,931 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:30:48,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 23:30:49,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:30:49,132 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:30:49,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:30:49,133 INFO L85 PathProgramCache]: Analyzing trace with hash 387957575, now seen corresponding path program 1 times [2024-11-08 23:30:49,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:30:49,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397666912] [2024-11-08 23:30:49,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:30:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:30:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:30:49,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [597158137] [2024-11-08 23:30:49,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:30:49,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:30:49,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:30:49,268 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:30:49,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 23:30:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:30:49,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:30:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:30:49,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:30:49,649 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:30:49,650 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:30:49,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 23:30:49,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:30:49,856 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:30:49,981 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:30:49,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:30:49 BoogieIcfgContainer [2024-11-08 23:30:49,985 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:30:49,986 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:30:49,986 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:30:49,986 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:30:49,987 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:30:32" (3/4) ... [2024-11-08 23:30:49,990 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:30:49,991 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:30:49,992 INFO L158 Benchmark]: Toolchain (without parser) took 18938.24ms. Allocated memory was 180.4MB in the beginning and 268.4MB in the end (delta: 88.1MB). Free memory was 112.1MB in the beginning and 191.2MB in the end (delta: -79.2MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-11-08 23:30:49,992 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:30:49,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.23ms. Allocated memory is still 180.4MB. Free memory was 111.9MB in the beginning and 146.1MB in the end (delta: -34.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:30:49,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.25ms. Allocated memory is still 180.4MB. Free memory was 146.1MB in the beginning and 140.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:30:49,993 INFO L158 Benchmark]: Boogie Preprocessor took 113.46ms. Allocated memory is still 180.4MB. Free memory was 140.9MB in the beginning and 130.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 23:30:49,993 INFO L158 Benchmark]: RCFGBuilder took 728.34ms. Allocated memory is still 180.4MB. Free memory was 130.4MB in the beginning and 98.4MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 23:30:49,993 INFO L158 Benchmark]: TraceAbstraction took 17563.06ms. Allocated memory was 180.4MB in the beginning and 268.4MB in the end (delta: 88.1MB). Free memory was 97.9MB in the beginning and 191.2MB in the end (delta: -93.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:30:49,994 INFO L158 Benchmark]: Witness Printer took 5.35ms. Allocated memory is still 268.4MB. Free memory is still 191.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:30:49,995 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.18ms. Allocated memory is still 109.1MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.23ms. Allocated memory is still 180.4MB. Free memory was 111.9MB in the beginning and 146.1MB in the end (delta: -34.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.25ms. Allocated memory is still 180.4MB. Free memory was 146.1MB in the beginning and 140.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.46ms. Allocated memory is still 180.4MB. Free memory was 140.9MB in the beginning and 130.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 728.34ms. Allocated memory is still 180.4MB. Free memory was 130.4MB in the beginning and 98.4MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17563.06ms. Allocated memory was 180.4MB in the beginning and 268.4MB in the end (delta: 88.1MB). Free memory was 97.9MB in the beginning and 191.2MB in the end (delta: -93.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.35ms. Allocated memory is still 268.4MB. Free memory is still 191.2MB. 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 196, overapproximation of someBinaryDOUBLEComparisonOperation at line 196, overapproximation of someBinaryArithmeticFLOAToperation at line 139. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 200; [L23] unsigned short int var_1_4 = 8; [L24] unsigned short int var_1_5 = 5; [L25] unsigned long int var_1_6 = 256; [L26] float var_1_7 = 9999999999999.2; [L27] float var_1_8 = 499.5; [L28] float var_1_9 = 64.4; [L29] float var_1_10 = 0.5; [L30] float var_1_11 = 5.8; [L31] float var_1_12 = 16.75; [L32] float var_1_13 = 99.5; [L33] signed short int var_1_15 = -10; [L34] unsigned char var_1_17 = 0; [L35] unsigned long int var_1_19 = 2743323310; [L36] unsigned long int var_1_20 = 4162860161; [L37] unsigned char var_1_21 = 0; [L38] double var_1_22 = 99.7; [L39] unsigned long int var_1_23 = 8; [L40] unsigned char var_1_24 = 1; [L41] unsigned char var_1_25 = 128; [L42] unsigned char var_1_26 = 128; [L43] unsigned char var_1_27 = 32; [L44] unsigned char var_1_28 = 200; [L45] float var_1_29 = 16.1; [L46] float var_1_30 = 7.9; [L47] unsigned char var_1_31 = 0; [L48] unsigned char var_1_32 = 1; [L49] unsigned char var_1_33 = 8; [L50] signed short int last_1_var_1_15 = -10; [L51] double last_1_var_1_22 = 99.7; [L52] unsigned long int last_1_var_1_23 = 8; [L53] unsigned char last_1_var_1_24 = 1; [L54] unsigned char last_1_var_1_27 = 32; [L55] unsigned char last_1_var_1_31 = 0; VAL [isInitial=0, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] CALL updateLastVariables() [L188] last_1_var_1_15 = var_1_15 [L189] last_1_var_1_22 = var_1_22 [L190] last_1_var_1_23 = var_1_23 [L191] last_1_var_1_24 = var_1_24 [L192] last_1_var_1_27 = var_1_27 [L193] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L203] RET updateLastVariables() [L204] CALL updateVariables() [L147] var_1_4 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_4 >= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L148] RET assume_abort_if_not(var_1_4 >= 8) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L149] CALL assume_abort_if_not(var_1_4 <= 17) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L149] RET assume_abort_if_not(var_1_4 <= 17) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L150] var_1_5 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L151] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L152] CALL assume_abort_if_not(var_1_5 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L152] RET assume_abort_if_not(var_1_5 <= 8) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L153] var_1_8 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_9=322/5] [L154] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_9=322/5] [L155] var_1_9 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L156] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L157] var_1_10 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L158] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L159] var_1_11 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L160] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L161] var_1_12 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L162] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L163] var_1_13 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L164] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L165] var_1_19 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L166] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L167] CALL assume_abort_if_not(var_1_19 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L167] RET assume_abort_if_not(var_1_19 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L168] var_1_20 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_20 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L169] RET assume_abort_if_not(var_1_20 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L170] CALL assume_abort_if_not(var_1_20 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L170] RET assume_abort_if_not(var_1_20 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L171] var_1_21 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L172] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L173] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L173] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L174] var_1_25 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_25 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L175] RET assume_abort_if_not(var_1_25 >= 127) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L176] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L176] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L177] var_1_26 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_26 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L178] RET assume_abort_if_not(var_1_26 >= 127) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L179] CALL assume_abort_if_not(var_1_26 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L179] RET assume_abort_if_not(var_1_26 <= 254) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L180] var_1_28 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_28 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L181] RET assume_abort_if_not(var_1_28 >= 190) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L182] CALL assume_abort_if_not(var_1_28 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L182] RET assume_abort_if_not(var_1_28 <= 254) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L183] var_1_32 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L184] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L185] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L185] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L204] RET updateVariables() [L205] CALL step() [L59] COND TRUE (var_1_4 >= last_1_var_1_24) && (last_1_var_1_27 >= ((((var_1_5) < (last_1_var_1_24)) ? (var_1_5) : (last_1_var_1_24)))) [L60] var_1_6 = 200u VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L62] COND FALSE !(\read(last_1_var_1_31)) [L73] var_1_17 = var_1_21 VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L75] COND FALSE !(\read(var_1_17)) [L78] var_1_31 = (! 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L80] EXPR (last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L80] unsigned long int stepLocal_0 = (last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5); [L81] COND FALSE !(stepLocal_0 <= -128) [L84] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L86] unsigned char stepLocal_4 = var_1_17; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_4=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L87] COND TRUE stepLocal_4 || (last_1_var_1_22 <= var_1_12) [L88] var_1_22 = ((((200.3) < (var_1_9)) ? (200.3) : (var_1_9))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L92] signed long int stepLocal_6 = (((var_1_25) > (256)) ? (var_1_25) : (256)); VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_6=256, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=32, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L93] COND TRUE var_1_5 <= stepLocal_6 [L94] var_1_27 = ((var_1_28 - var_1_4) - var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=174, var_1_28=-66, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L98] var_1_29 = (var_1_12 + ((((9.999999999999995E14f) > (var_1_13)) ? (9.999999999999995E14f) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=174, var_1_28=-66, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L99] COND TRUE var_1_19 != 25u VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=174, var_1_28=-66, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L100] COND TRUE ! var_1_21 [L101] var_1_30 = var_1_8 VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=174, var_1_28=-66, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L106] COND FALSE !(\read(var_1_31)) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=174, var_1_28=-66, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L111] signed long int stepLocal_5 = var_1_33 % var_1_4; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_5=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=174, var_1_28=-66, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L112] COND FALSE !(stepLocal_5 > var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=174, var_1_28=-66, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L115] unsigned long int stepLocal_3 = var_1_6; [L116] signed long int stepLocal_2 = 128; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_2=128, stepLocal_3=200, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=174, var_1_28=-66, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L117] COND FALSE !(var_1_1 > stepLocal_3) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_2=128, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=174, var_1_28=-66, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L120] COND TRUE var_1_33 != stepLocal_2 [L121] var_1_15 = (var_1_5 - 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=174, var_1_28=-66, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L126] COND FALSE !(((((var_1_1) < ((var_1_4 - var_1_5))) ? (var_1_1) : ((var_1_4 - var_1_5)))) > var_1_27) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=174, var_1_28=-66, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L137] signed long int stepLocal_1 = var_1_33 + var_1_5; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_1=16, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=174, var_1_28=-66, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L138] COND TRUE stepLocal_1 > var_1_24 [L139] var_1_7 = (((((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) > (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13)))))) ? ((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) : (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13))))))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=174, var_1_28=-66, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] [L205] RET step() [L206] CALL, EXPR property() [L196] EXPR (last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=174, var_1_28=-66, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] [L196-L197] return (((((((((((((((last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5)) <= -128) ? (var_1_1 == ((unsigned char) (var_1_5 + var_1_4))) : (var_1_1 == ((unsigned char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) && (((var_1_4 >= last_1_var_1_24) && (last_1_var_1_27 >= ((((var_1_5) < (last_1_var_1_24)) ? (var_1_5) : (last_1_var_1_24))))) ? (var_1_6 == ((unsigned long int) 200u)) : 1)) && (((var_1_33 + var_1_5) > var_1_24) ? (var_1_7 == ((float) (((((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) > (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13)))))) ? ((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) : (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13))))))))) : ((! var_1_31) ? (var_1_7 == ((float) ((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13))))) : 1))) && ((var_1_1 > var_1_6) ? (var_1_15 == ((signed short int) last_1_var_1_15)) : ((var_1_33 != 128) ? (var_1_15 == ((signed short int) (var_1_5 - 1))) : (var_1_15 == ((signed short int) var_1_27))))) && (last_1_var_1_31 ? (last_1_var_1_31 ? (((((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))) - ((((10u) > (var_1_5)) ? (10u) : (var_1_5)))) != var_1_4) ? (var_1_17 == ((unsigned char) 0)) : (var_1_17 == ((unsigned char) 0))) : (var_1_17 == ((unsigned char) var_1_21))) : (var_1_17 == ((unsigned char) var_1_21)))) && ((var_1_17 || (last_1_var_1_22 <= var_1_12)) ? (var_1_22 == ((double) ((((200.3) < (var_1_9)) ? (200.3) : (var_1_9))))) : (var_1_22 == ((double) (var_1_8 - var_1_9))))) && ((((((var_1_1) < ((var_1_4 - var_1_5))) ? (var_1_1) : ((var_1_4 - var_1_5)))) > var_1_27) ? (((5 * var_1_27) <= var_1_24) ? ((var_1_5 >= var_1_1) ? (var_1_23 == ((unsigned long int) var_1_24)) : (var_1_23 == ((unsigned long int) var_1_5))) : (var_1_23 == ((unsigned long int) var_1_4))) : 1)) && (((var_1_33 % var_1_4) > var_1_5) ? (var_1_24 == ((unsigned char) (((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26))) - var_1_4))) : 1)) && ((var_1_5 <= ((((var_1_25) > (256)) ? (var_1_25) : (256)))) ? (var_1_27 == ((unsigned char) ((var_1_28 - var_1_4) - var_1_5))) : (var_1_27 == ((unsigned char) (((((var_1_25) > (var_1_28)) ? (var_1_25) : (var_1_28))) - var_1_5))))) && (var_1_29 == ((float) (var_1_12 + ((((9.999999999999995E14f) > (var_1_13)) ? (9.999999999999995E14f) : (var_1_13))))))) && ((var_1_19 != 25u) ? ((! var_1_21) ? (var_1_30 == ((float) var_1_8)) : 1) : (var_1_30 == ((float) (var_1_10 - var_1_9))))) && (var_1_17 ? (var_1_31 == ((unsigned char) (! var_1_32))) : (var_1_31 == ((unsigned char) (! 1))))) && (var_1_31 ? (((var_1_6 / var_1_25) <= var_1_4) ? (var_1_33 == ((unsigned char) var_1_5)) : 1) : 1) ; [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=174, var_1_28=-66, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=254, var_1_26=127, var_1_27=174, var_1_28=-66, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 7, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1241 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1230 mSDsluCounter, 2478 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1729 mSDsCounter, 573 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1917 IncrementalHoareTripleChecker+Invalid, 2490 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 573 mSolverCounterUnsat, 749 mSDtfsCounter, 1917 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1519 GetRequests, 1407 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=4, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 250 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2003 NumberOfCodeBlocks, 2003 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1986 ConstructedInterpolants, 0 QuantifiedInterpolants, 7912 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1630 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 12525/13248 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-11-08 23:30:50,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:30:52,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:30:52,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:30:52,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:30:52,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:30:52,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:30:52,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:30:52,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:30:52,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:30:52,436 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:30:52,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:30:52,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:30:52,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:30:52,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:30:52,438 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:30:52,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:30:52,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:30:52,439 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:30:52,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:30:52,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:30:52,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:30:52,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:30:52,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:30:52,444 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:30:52,444 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:30:52,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:30:52,444 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:30:52,444 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:30:52,445 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:30:52,445 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:30:52,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:30:52,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:30:52,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:30:52,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:30:52,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:30:52,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:30:52,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:30:52,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:30:52,447 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:30:52,447 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:30:52,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:30:52,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:30:52,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:30:52,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:30:52,450 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 [2024-11-08 23:30:52,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:30:52,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:30:52,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:30:52,798 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:30:52,799 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:30:52,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2024-11-08 23:30:54,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:30:54,512 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:30:54,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2024-11-08 23:30:54,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54a912403/b9fddc19e7a5433c94a8561bac35bdff/FLAG131228dd5 [2024-11-08 23:30:54,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54a912403/b9fddc19e7a5433c94a8561bac35bdff [2024-11-08 23:30:54,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:30:54,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:30:54,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:30:54,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:30:54,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:30:54,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:30:54" (1/1) ... [2024-11-08 23:30:54,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea5fed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:54, skipping insertion in model container [2024-11-08 23:30:54,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:30:54" (1/1) ... [2024-11-08 23:30:54,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:30:55,106 WARN L250 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-while_file-39.i[916,929] [2024-11-08 23:30:55,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:30:55,233 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:30:55,247 WARN L250 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-while_file-39.i[916,929] [2024-11-08 23:30:55,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:30:55,330 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:30:55,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:55 WrapperNode [2024-11-08 23:30:55,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:30:55,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:30:55,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:30:55,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:30:55,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:55" (1/1) ... [2024-11-08 23:30:55,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:55" (1/1) ... [2024-11-08 23:30:55,418 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-11-08 23:30:55,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:30:55,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:30:55,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:30:55,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:30:55,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:55" (1/1) ... [2024-11-08 23:30:55,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:55" (1/1) ... [2024-11-08 23:30:55,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:55" (1/1) ... [2024-11-08 23:30:55,465 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-11-08 23:30:55,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:55" (1/1) ... [2024-11-08 23:30:55,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:55" (1/1) ... [2024-11-08 23:30:55,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:55" (1/1) ... [2024-11-08 23:30:55,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:55" (1/1) ... [2024-11-08 23:30:55,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:55" (1/1) ... [2024-11-08 23:30:55,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:55" (1/1) ... [2024-11-08 23:30:55,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:30:55,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:30:55,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:30:55,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:30:55,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:55" (1/1) ... [2024-11-08 23:30:55,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:30:55,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:30:55,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:30:55,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:30:55,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:30:55,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:30:55,589 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:30:55,589 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:30:55,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:30:55,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:30:55,681 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:30:55,688 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:31:01,300 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 23:31:01,300 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:31:01,315 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:31:01,316 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:31:01,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:31:01 BoogieIcfgContainer [2024-11-08 23:31:01,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:31:01,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:31:01,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:31:01,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:31:01,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:30:54" (1/3) ... [2024-11-08 23:31:01,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2b13cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:31:01, skipping insertion in model container [2024-11-08 23:31:01,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:30:55" (2/3) ... [2024-11-08 23:31:01,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2b13cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:31:01, skipping insertion in model container [2024-11-08 23:31:01,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:31:01" (3/3) ... [2024-11-08 23:31:01,325 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-39.i [2024-11-08 23:31:01,340 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:31:01,341 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:31:01,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:31:01,415 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;@6be5d5b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:31:01,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:31:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:31:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 23:31:01,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:31:01,438 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:31:01,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:31:01,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:31:01,445 INFO L85 PathProgramCache]: Analyzing trace with hash 489401910, now seen corresponding path program 1 times [2024-11-08 23:31:01,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:31:01,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391032721] [2024-11-08 23:31:01,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:31:01,462 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-11-08 23:31:01,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:31:01,465 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:31:01,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:31:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:01,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:31:02,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:31:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 566 proven. 0 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2024-11-08 23:31:02,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:31:02,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:31:02,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391032721] [2024-11-08 23:31:02,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391032721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:31:02,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:31:02,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:31:02,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011013605] [2024-11-08 23:31:02,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:31:02,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:31:02,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:31:02,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:31:02,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:31:02,115 INFO L87 Difference]: Start difference. First operand has 85 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:31:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:31:02,144 INFO L93 Difference]: Finished difference Result 163 states and 280 transitions. [2024-11-08 23:31:02,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:31:02,146 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 163 [2024-11-08 23:31:02,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:31:02,153 INFO L225 Difference]: With dead ends: 163 [2024-11-08 23:31:02,153 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 23:31:02,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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-11-08 23:31:02,159 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:31:02,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:31:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 23:31:02,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-08 23:31:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:31:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2024-11-08 23:31:02,199 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 163 [2024-11-08 23:31:02,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:31:02,200 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2024-11-08 23:31:02,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:31:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2024-11-08 23:31:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 23:31:02,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:31:02,204 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:31:02,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:31:02,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:31:02,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:31:02,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:31:02,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1014564758, now seen corresponding path program 1 times [2024-11-08 23:31:02,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:31:02,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117335812] [2024-11-08 23:31:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:31:02,408 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-11-08 23:31:02,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:31:02,411 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:31:02,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:31:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:02,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:31:02,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:31:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-11-08 23:31:03,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:31:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:31:04,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:31:04,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117335812] [2024-11-08 23:31:04,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117335812] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:31:04,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:31:04,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-08 23:31:04,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261318745] [2024-11-08 23:31:04,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:31:04,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:31:04,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:31:04,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:31:04,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:31:04,473 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 23:31:09,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:31:13,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:31:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:31:13,603 INFO L93 Difference]: Finished difference Result 167 states and 252 transitions. [2024-11-08 23:31:13,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:31:13,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 163 [2024-11-08 23:31:13,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:31:13,639 INFO L225 Difference]: With dead ends: 167 [2024-11-08 23:31:13,640 INFO L226 Difference]: Without dead ends: 89 [2024-11-08 23:31:13,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 318 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-08 23:31:13,642 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 205 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 112 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-08 23:31:13,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 221 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 145 Invalid, 1 Unknown, 0 Unchecked, 8.7s Time] [2024-11-08 23:31:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-08 23:31:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-11-08 23:31:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 58 states have internal predecessors, (77), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:31:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2024-11-08 23:31:13,665 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 163 [2024-11-08 23:31:13,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:31:13,666 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2024-11-08 23:31:13,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 23:31:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2024-11-08 23:31:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 23:31:13,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:31:13,669 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:31:13,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:31:13,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:31:13,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:31:13,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:31:13,872 INFO L85 PathProgramCache]: Analyzing trace with hash -591862932, now seen corresponding path program 1 times [2024-11-08 23:31:13,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:31:13,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688377963] [2024-11-08 23:31:13,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:31:13,873 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-11-08 23:31:13,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:31:13,874 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:31:13,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 23:31:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:14,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:31:14,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:31:15,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-08 23:31:15,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:31:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 23:31:16,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:31:16,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688377963] [2024-11-08 23:31:16,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688377963] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:31:16,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:31:16,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-08 23:31:16,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904629823] [2024-11-08 23:31:16,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:31:16,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:31:16,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:31:16,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:31:16,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:31:16,280 INFO L87 Difference]: Start difference. First operand 85 states and 125 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-11-08 23:31:20,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:31:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:31:21,080 INFO L93 Difference]: Finished difference Result 175 states and 254 transitions. [2024-11-08 23:31:21,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:31:21,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 163 [2024-11-08 23:31:21,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:31:21,129 INFO L225 Difference]: With dead ends: 175 [2024-11-08 23:31:21,129 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 23:31:21,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:31:21,131 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 161 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:31:21,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 225 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-08 23:31:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 23:31:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-08 23:31:21,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.278688524590164) internal successors, (78), 61 states have internal predecessors, (78), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:31:21,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-11-08 23:31:21,144 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 163 [2024-11-08 23:31:21,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:31:21,145 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-11-08 23:31:21,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-11-08 23:31:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-11-08 23:31:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 23:31:21,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:31:21,150 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:31:21,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 23:31:21,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:31:21,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:31:21,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:31:21,351 INFO L85 PathProgramCache]: Analyzing trace with hash -464178983, now seen corresponding path program 1 times [2024-11-08 23:31:21,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:31:21,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905548450] [2024-11-08 23:31:21,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:31:21,352 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-11-08 23:31:21,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:31:21,355 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:31:21,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 23:31:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:21,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 23:31:21,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:31:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 219 proven. 123 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2024-11-08 23:31:25,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:31:26,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:31:26,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905548450] [2024-11-08 23:31:26,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905548450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:31:26,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1141102611] [2024-11-08 23:31:26,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:31:26,877 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 23:31:26,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 23:31:26,882 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 23:31:26,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-08 23:31:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:31:28,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 23:31:28,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:31:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 219 proven. 123 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2024-11-08 23:31:32,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:31:34,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1141102611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:31:34,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:31:34,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 13 [2024-11-08 23:31:34,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564748929] [2024-11-08 23:31:34,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:31:34,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 23:31:34,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:31:34,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 23:31:34,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-11-08 23:31:34,419 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-08 23:31:42,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:31:43,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:31:46,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]