./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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-1loop_file-77.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 0cbe4eb7aae73c01b831078f0e738c68709fa97155cdb7dce934011117170926 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:50:45,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:50:45,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:50:45,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:50:45,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:50:45,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:50:45,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:50:45,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:50:45,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:50:45,412 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:50:45,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:50:45,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:50:45,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:50:45,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:50:45,413 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:50:45,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:50:45,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:50:45,414 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:50:45,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:50:45,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:50:45,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:50:45,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:50:45,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:50:45,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:50:45,414 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:50:45,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:50:45,414 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:50:45,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:50:45,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:50:45,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:50:45,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:50:45,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:50:45,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:50:45,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:50:45,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:50:45,416 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:50:45,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:50:45,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:50:45,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:50:45,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:50:45,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:50:45,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:50:45,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:50:45,416 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 0cbe4eb7aae73c01b831078f0e738c68709fa97155cdb7dce934011117170926 [2025-03-03 22:50:45,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:50:45,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:50:45,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:50:45,694 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:50:45,694 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:50:45,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.i [2025-03-03 22:50:46,852 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c2fb806/5df3cc77eebb4f7f855155f65f4b4e65/FLAG51f012836 [2025-03-03 22:50:47,105 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:50:47,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.i [2025-03-03 22:50:47,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c2fb806/5df3cc77eebb4f7f855155f65f4b4e65/FLAG51f012836 [2025-03-03 22:50:47,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c2fb806/5df3cc77eebb4f7f855155f65f4b4e65 [2025-03-03 22:50:47,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:50:47,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:50:47,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:50:47,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:50:47,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:50:47,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:50:47" (1/1) ... [2025-03-03 22:50:47,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:47, skipping insertion in model container [2025-03-03 22:50:47,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:50:47" (1/1) ... [2025-03-03 22:50:47,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:50:47,571 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-1loop_file-77.i[916,929] [2025-03-03 22:50:47,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:50:47,648 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:50:47,657 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-1loop_file-77.i[916,929] [2025-03-03 22:50:47,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:50:47,723 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:50:47,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:47 WrapperNode [2025-03-03 22:50:47,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:50:47,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:50:47,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:50:47,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:50:47,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:47" (1/1) ... [2025-03-03 22:50:47,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:47" (1/1) ... [2025-03-03 22:50:47,777 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2025-03-03 22:50:47,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:50:47,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:50:47,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:50:47,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:50:47,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:47" (1/1) ... [2025-03-03 22:50:47,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:47" (1/1) ... [2025-03-03 22:50:47,790 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:47" (1/1) ... [2025-03-03 22:50:47,815 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]. [2025-03-03 22:50:47,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:47" (1/1) ... [2025-03-03 22:50:47,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:47" (1/1) ... [2025-03-03 22:50:47,826 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:47" (1/1) ... [2025-03-03 22:50:47,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:47" (1/1) ... [2025-03-03 22:50:47,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:47" (1/1) ... [2025-03-03 22:50:47,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:47" (1/1) ... [2025-03-03 22:50:47,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:50:47,831 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:50:47,831 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:50:47,831 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:50:47,832 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:47" (1/1) ... [2025-03-03 22:50:47,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:50:47,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:50:47,860 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) [2025-03-03 22:50:47,862 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 [2025-03-03 22:50:47,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:50:47,877 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:50:47,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:50:47,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:50:47,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:50:47,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:50:47,943 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:50:47,944 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:50:48,204 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-03 22:50:48,204 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:50:48,211 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:50:48,211 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:50:48,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:50:48 BoogieIcfgContainer [2025-03-03 22:50:48,212 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:50:48,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:50:48,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:50:48,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:50:48,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:50:47" (1/3) ... [2025-03-03 22:50:48,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5d5a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:50:48, skipping insertion in model container [2025-03-03 22:50:48,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:50:47" (2/3) ... [2025-03-03 22:50:48,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5d5a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:50:48, skipping insertion in model container [2025-03-03 22:50:48,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:50:48" (3/3) ... [2025-03-03 22:50:48,221 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-77.i [2025-03-03 22:50:48,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:50:48,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-77.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:50:48,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:50:48,283 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;@7b76b63c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:50:48,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:50:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:50:48,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 22:50:48,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:48,299 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:50:48,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:48,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:48,303 INFO L85 PathProgramCache]: Analyzing trace with hash 477050143, now seen corresponding path program 1 times [2025-03-03 22:50:48,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:48,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408096059] [2025-03-03 22:50:48,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:48,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:48,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 22:50:48,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 22:50:48,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:48,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 22:50:48,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:48,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408096059] [2025-03-03 22:50:48,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408096059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:50:48,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672067917] [2025-03-03 22:50:48,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:48,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:48,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:50:48,589 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) [2025-03-03 22:50:48,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:50:48,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 22:50:48,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 22:50:48,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:48,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:48,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:50:48,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:50:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 22:50:48,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:50:48,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672067917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:50:48,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:50:48,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:50:48,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378471763] [2025-03-03 22:50:48,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:50:48,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:50:48,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:48,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:50:48,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:50:48,824 INFO L87 Difference]: Start difference. First operand has 83 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:50:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:48,849 INFO L93 Difference]: Finished difference Result 163 states and 278 transitions. [2025-03-03 22:50:48,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:50:48,852 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 168 [2025-03-03 22:50:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:48,857 INFO L225 Difference]: With dead ends: 163 [2025-03-03 22:50:48,857 INFO L226 Difference]: Without dead ends: 80 [2025-03-03 22:50:48,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:50:48,861 INFO L435 NwaCegarLoop]: 126 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, 126 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 [2025-03-03 22:50:48,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:50:48,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-03 22:50:48,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-03 22:50:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:50:48,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 123 transitions. [2025-03-03 22:50:48,893 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 123 transitions. Word has length 168 [2025-03-03 22:50:48,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:48,894 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 123 transitions. [2025-03-03 22:50:48,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:50:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 123 transitions. [2025-03-03 22:50:48,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 22:50:48,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:48,898 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:50:48,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:50:49,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:50:49,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:49,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:49,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1791799686, now seen corresponding path program 1 times [2025-03-03 22:50:49,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:49,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731928131] [2025-03-03 22:50:49,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:49,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:49,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 22:50:49,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 22:50:49,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:49,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:50:49,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:49,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731928131] [2025-03-03 22:50:49,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731928131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:50:49,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:50:49,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:50:49,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144283120] [2025-03-03 22:50:49,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:50:49,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:50:49,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:49,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:50:49,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:50:49,426 INFO L87 Difference]: Start difference. First operand 80 states and 123 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:50:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:49,623 INFO L93 Difference]: Finished difference Result 234 states and 363 transitions. [2025-03-03 22:50:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:50:49,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2025-03-03 22:50:49,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:49,627 INFO L225 Difference]: With dead ends: 234 [2025-03-03 22:50:49,628 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 22:50:49,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:50:49,631 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 66 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:49,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 318 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:50:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 22:50:49,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2025-03-03 22:50:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 22:50:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 239 transitions. [2025-03-03 22:50:49,662 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 239 transitions. Word has length 168 [2025-03-03 22:50:49,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:49,663 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 239 transitions. [2025-03-03 22:50:49,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:50:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 239 transitions. [2025-03-03 22:50:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 22:50:49,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:49,668 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:50:49,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:50:49,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:49,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:49,669 INFO L85 PathProgramCache]: Analyzing trace with hash -255333731, now seen corresponding path program 1 times [2025-03-03 22:50:49,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:49,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007021220] [2025-03-03 22:50:49,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:49,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:49,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 22:50:49,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 22:50:49,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:49,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:50:50,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:50,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007021220] [2025-03-03 22:50:50,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007021220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:50:50,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006608503] [2025-03-03 22:50:50,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:50,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:50,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:50:50,239 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) [2025-03-03 22:50:50,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:50:50,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 22:50:50,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 22:50:50,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:50,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:50,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 22:50:50,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:50:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-03-03 22:50:50,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:50:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:50:50,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006608503] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:50:50,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:50:50,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-03 22:50:50,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235126515] [2025-03-03 22:50:50,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:50:50,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 22:50:50,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:50,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 22:50:50,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:50:50,874 INFO L87 Difference]: Start difference. First operand 154 states and 239 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-03 22:50:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:51,156 INFO L93 Difference]: Finished difference Result 317 states and 485 transitions. [2025-03-03 22:50:51,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:50:51,157 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 169 [2025-03-03 22:50:51,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:51,159 INFO L225 Difference]: With dead ends: 317 [2025-03-03 22:50:51,159 INFO L226 Difference]: Without dead ends: 166 [2025-03-03 22:50:51,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:50:51,160 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 243 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:51,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 206 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:50:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-03 22:50:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2025-03-03 22:50:51,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 107 states have internal predecessors, (139), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 22:50:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 239 transitions. [2025-03-03 22:50:51,202 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 239 transitions. Word has length 169 [2025-03-03 22:50:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:51,202 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 239 transitions. [2025-03-03 22:50:51,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-03 22:50:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 239 transitions. [2025-03-03 22:50:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:50:51,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:51,207 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:50:51,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:50:51,411 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 [2025-03-03 22:50:51,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:51,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:51,412 INFO L85 PathProgramCache]: Analyzing trace with hash -742693306, now seen corresponding path program 1 times [2025-03-03 22:50:51,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:51,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84288328] [2025-03-03 22:50:51,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:51,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:51,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:50:51,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:50:51,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:51,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:50:52,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:52,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84288328] [2025-03-03 22:50:52,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84288328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:50:52,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:50:52,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:50:52,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940551933] [2025-03-03 22:50:52,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:50:52,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:50:52,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:52,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:50:52,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:50:52,117 INFO L87 Difference]: Start difference. First operand 162 states and 239 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:50:52,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:52,291 INFO L93 Difference]: Finished difference Result 469 states and 670 transitions. [2025-03-03 22:50:52,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:50:52,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-03-03 22:50:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:52,299 INFO L225 Difference]: With dead ends: 469 [2025-03-03 22:50:52,301 INFO L226 Difference]: Without dead ends: 310 [2025-03-03 22:50:52,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:50:52,303 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 92 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:52,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 524 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:50:52,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-03 22:50:52,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 246. [2025-03-03 22:50:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 173 states have (on average 1.2716763005780347) internal successors, (220), 175 states have internal predecessors, (220), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 22:50:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 352 transitions. [2025-03-03 22:50:52,346 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 352 transitions. Word has length 170 [2025-03-03 22:50:52,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:52,348 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 352 transitions. [2025-03-03 22:50:52,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:50:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 352 transitions. [2025-03-03 22:50:52,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:50:52,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:52,350 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:50:52,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:50:52,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:52,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:52,353 INFO L85 PathProgramCache]: Analyzing trace with hash 144810375, now seen corresponding path program 1 times [2025-03-03 22:50:52,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:52,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339110569] [2025-03-03 22:50:52,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:52,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:52,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:50:52,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:50:52,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:52,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:50:52,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1773664553] [2025-03-03 22:50:52,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:52,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:52,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:50:52,435 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) [2025-03-03 22:50:52,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 22:50:52,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:50:52,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:50:52,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:52,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:52,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 22:50:52,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:50:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 767 proven. 72 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-03 22:50:54,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:50:54,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:54,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339110569] [2025-03-03 22:50:54,890 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:50:54,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773664553] [2025-03-03 22:50:54,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773664553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:50:54,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:50:54,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-03-03 22:50:54,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721100731] [2025-03-03 22:50:54,890 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 22:50:54,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 22:50:54,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:54,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 22:50:54,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2025-03-03 22:50:54,894 INFO L87 Difference]: Start difference. First operand 246 states and 352 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-03 22:50:56,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:56,389 INFO L93 Difference]: Finished difference Result 912 states and 1279 transitions. [2025-03-03 22:50:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 22:50:56,390 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 170 [2025-03-03 22:50:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:56,397 INFO L225 Difference]: With dead ends: 912 [2025-03-03 22:50:56,397 INFO L226 Difference]: Without dead ends: 789 [2025-03-03 22:50:56,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=405, Invalid=1575, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 22:50:56,400 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 950 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:56,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 1137 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:50:56,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-03 22:50:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 409. [2025-03-03 22:50:56,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 279 states have (on average 1.2724014336917562) internal successors, (355), 282 states have internal predecessors, (355), 116 states have call successors, (116), 13 states have call predecessors, (116), 13 states have return successors, (116), 113 states have call predecessors, (116), 116 states have call successors, (116) [2025-03-03 22:50:56,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 587 transitions. [2025-03-03 22:50:56,450 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 587 transitions. Word has length 170 [2025-03-03 22:50:56,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:56,450 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 587 transitions. [2025-03-03 22:50:56,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-03 22:50:56,450 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 587 transitions. [2025-03-03 22:50:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:50:56,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:56,455 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:50:56,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 22:50:56,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:56,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:56,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:56,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1755322631, now seen corresponding path program 1 times [2025-03-03 22:50:56,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:56,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265647283] [2025-03-03 22:50:56,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:56,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:56,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:50:56,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:50:56,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:56,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:50:56,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [938783025] [2025-03-03 22:50:56,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:56,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:56,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:50:56,737 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) [2025-03-03 22:50:56,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 22:50:56,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:50:56,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:50:56,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:56,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:56,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 22:50:56,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:50:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:50:57,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:50:57,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:50:57,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265647283] [2025-03-03 22:50:57,255 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:50:57,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938783025] [2025-03-03 22:50:57,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938783025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:50:57,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:50:57,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:50:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985129424] [2025-03-03 22:50:57,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:50:57,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:50:57,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:50:57,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:50:57,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:50:57,257 INFO L87 Difference]: Start difference. First operand 409 states and 587 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:50:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:50:57,780 INFO L93 Difference]: Finished difference Result 987 states and 1421 transitions. [2025-03-03 22:50:57,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 22:50:57,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-03-03 22:50:57,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:50:57,790 INFO L225 Difference]: With dead ends: 987 [2025-03-03 22:50:57,790 INFO L226 Difference]: Without dead ends: 864 [2025-03-03 22:50:57,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:50:57,792 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 340 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:50:57,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 737 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:50:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-03 22:50:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 607. [2025-03-03 22:50:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 413 states have (on average 1.2663438256658595) internal successors, (523), 418 states have internal predecessors, (523), 174 states have call successors, (174), 19 states have call predecessors, (174), 19 states have return successors, (174), 169 states have call predecessors, (174), 174 states have call successors, (174) [2025-03-03 22:50:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 871 transitions. [2025-03-03 22:50:57,861 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 871 transitions. Word has length 170 [2025-03-03 22:50:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:50:57,861 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 871 transitions. [2025-03-03 22:50:57,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:50:57,862 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 871 transitions. [2025-03-03 22:50:57,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:50:57,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:50:57,863 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:50:57,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 22:50:58,063 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 [2025-03-03 22:50:58,064 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:50:58,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:50:58,064 INFO L85 PathProgramCache]: Analyzing trace with hash 698465028, now seen corresponding path program 1 times [2025-03-03 22:50:58,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:50:58,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357845153] [2025-03-03 22:50:58,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:58,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:50:58,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:50:58,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:50:58,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:58,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:50:58,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254429182] [2025-03-03 22:50:58,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:50:58,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:50:58,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:50:58,118 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) [2025-03-03 22:50:58,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 22:50:58,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:50:58,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:50:58,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:50:58,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:50:58,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 22:50:58,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:50:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-03-03 22:50:59,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:51:07,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:51:07,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357845153] [2025-03-03 22:51:07,644 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:51:07,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254429182] [2025-03-03 22:51:07,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254429182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:51:07,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:51:07,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-03 22:51:07,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286063632] [2025-03-03 22:51:07,645 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 22:51:07,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 22:51:07,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:51:07,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 22:51:07,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=256, Unknown=4, NotChecked=0, Total=306 [2025-03-03 22:51:07,645 INFO L87 Difference]: Start difference. First operand 607 states and 871 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:51:08,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:51:08,673 INFO L93 Difference]: Finished difference Result 1154 states and 1649 transitions. [2025-03-03 22:51:08,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 22:51:08,674 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2025-03-03 22:51:08,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:51:08,679 INFO L225 Difference]: With dead ends: 1154 [2025-03-03 22:51:08,679 INFO L226 Difference]: Without dead ends: 781 [2025-03-03 22:51:08,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=181, Invalid=807, Unknown=4, NotChecked=0, Total=992 [2025-03-03 22:51:08,683 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 319 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 22:51:08,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1056 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 22:51:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-03-03 22:51:08,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 682. [2025-03-03 22:51:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 460 states have (on average 1.2521739130434784) internal successors, (576), 466 states have internal predecessors, (576), 199 states have call successors, (199), 22 states have call predecessors, (199), 22 states have return successors, (199), 193 states have call predecessors, (199), 199 states have call successors, (199) [2025-03-03 22:51:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 974 transitions. [2025-03-03 22:51:08,769 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 974 transitions. Word has length 170 [2025-03-03 22:51:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:51:08,769 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 974 transitions. [2025-03-03 22:51:08,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:51:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 974 transitions. [2025-03-03 22:51:08,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:51:08,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:51:08,771 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:51:08,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 22:51:08,971 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 [2025-03-03 22:51:08,971 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:51:08,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:51:08,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1985990012, now seen corresponding path program 1 times [2025-03-03 22:51:08,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:51:08,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679401329] [2025-03-03 22:51:08,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:51:08,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:51:08,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:51:09,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:51:09,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:51:09,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:51:09,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273941294] [2025-03-03 22:51:09,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:51:09,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:51:09,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:51:09,034 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:51:09,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 22:51:09,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:51:09,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:51:09,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:51:09,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:51:09,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 22:51:09,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:51:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:51:09,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:51:09,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:51:09,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679401329] [2025-03-03 22:51:09,304 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:51:09,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273941294] [2025-03-03 22:51:09,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273941294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:51:09,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:51:09,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:51:09,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578005681] [2025-03-03 22:51:09,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:51:09,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:51:09,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:51:09,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:51:09,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:51:09,305 INFO L87 Difference]: Start difference. First operand 682 states and 974 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:51:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:51:09,473 INFO L93 Difference]: Finished difference Result 1069 states and 1537 transitions. [2025-03-03 22:51:09,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:51:09,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-03-03 22:51:09,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:51:09,477 INFO L225 Difference]: With dead ends: 1069 [2025-03-03 22:51:09,477 INFO L226 Difference]: Without dead ends: 696 [2025-03-03 22:51:09,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:51:09,479 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 105 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:51:09,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 574 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:51:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-03 22:51:09,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 682. [2025-03-03 22:51:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 460 states have (on average 1.2478260869565216) internal successors, (574), 466 states have internal predecessors, (574), 199 states have call successors, (199), 22 states have call predecessors, (199), 22 states have return successors, (199), 193 states have call predecessors, (199), 199 states have call successors, (199) [2025-03-03 22:51:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 972 transitions. [2025-03-03 22:51:09,536 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 972 transitions. Word has length 170 [2025-03-03 22:51:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:51:09,537 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 972 transitions. [2025-03-03 22:51:09,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:51:09,537 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 972 transitions. [2025-03-03 22:51:09,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:51:09,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:51:09,539 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:51:09,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 22:51:09,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:51:09,740 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:51:09,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:51:09,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1470544088, now seen corresponding path program 1 times [2025-03-03 22:51:09,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:51:09,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643284986] [2025-03-03 22:51:09,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:51:09,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:51:09,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:51:09,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:51:09,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:51:09,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:51:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:51:09,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:51:09,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643284986] [2025-03-03 22:51:09,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643284986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:51:09,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:51:09,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:51:09,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138001938] [2025-03-03 22:51:09,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:51:09,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:51:09,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:51:09,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:51:09,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:51:09,835 INFO L87 Difference]: Start difference. First operand 682 states and 972 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:51:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:51:10,042 INFO L93 Difference]: Finished difference Result 1912 states and 2698 transitions. [2025-03-03 22:51:10,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:51:10,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-03-03 22:51:10,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:51:10,050 INFO L225 Difference]: With dead ends: 1912 [2025-03-03 22:51:10,051 INFO L226 Difference]: Without dead ends: 1442 [2025-03-03 22:51:10,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:51:10,054 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 207 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:51:10,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 428 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:51:10,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-03-03 22:51:10,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1244. [2025-03-03 22:51:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 830 states have (on average 1.2289156626506024) internal successors, (1020), 842 states have internal predecessors, (1020), 373 states have call successors, (373), 40 states have call predecessors, (373), 40 states have return successors, (373), 361 states have call predecessors, (373), 373 states have call successors, (373) [2025-03-03 22:51:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1766 transitions. [2025-03-03 22:51:10,185 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1766 transitions. Word has length 170 [2025-03-03 22:51:10,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:51:10,185 INFO L471 AbstractCegarLoop]: Abstraction has 1244 states and 1766 transitions. [2025-03-03 22:51:10,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:51:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1766 transitions. [2025-03-03 22:51:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:51:10,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:51:10,189 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:51:10,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 22:51:10,190 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:51:10,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:51:10,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1259193175, now seen corresponding path program 1 times [2025-03-03 22:51:10,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:51:10,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470913269] [2025-03-03 22:51:10,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:51:10,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:51:10,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:51:10,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:51:10,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:51:10,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:51:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:51:10,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:51:10,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470913269] [2025-03-03 22:51:10,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470913269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:51:10,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:51:10,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 22:51:10,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108418548] [2025-03-03 22:51:10,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:51:10,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:51:10,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:51:10,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:51:10,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:51:10,566 INFO L87 Difference]: Start difference. First operand 1244 states and 1766 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:51:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:51:11,583 INFO L93 Difference]: Finished difference Result 2451 states and 3415 transitions. [2025-03-03 22:51:11,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 22:51:11,584 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2025-03-03 22:51:11,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:51:11,592 INFO L225 Difference]: With dead ends: 2451 [2025-03-03 22:51:11,592 INFO L226 Difference]: Without dead ends: 1948 [2025-03-03 22:51:11,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2025-03-03 22:51:11,594 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 583 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 22:51:11,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 936 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 22:51:11,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2025-03-03 22:51:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1596. [2025-03-03 22:51:11,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1059 states have (on average 1.2058545797922569) internal successors, (1277), 1077 states have internal predecessors, (1277), 475 states have call successors, (475), 61 states have call predecessors, (475), 61 states have return successors, (475), 457 states have call predecessors, (475), 475 states have call successors, (475) [2025-03-03 22:51:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2227 transitions. [2025-03-03 22:51:11,738 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2227 transitions. Word has length 170 [2025-03-03 22:51:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:51:11,739 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 2227 transitions. [2025-03-03 22:51:11,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:51:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2227 transitions. [2025-03-03 22:51:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:51:11,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:51:11,740 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:51:11,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 22:51:11,741 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:51:11,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:51:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash 351319081, now seen corresponding path program 1 times [2025-03-03 22:51:11,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:51:11,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135367198] [2025-03-03 22:51:11,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:51:11,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:51:11,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:51:11,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:51:11,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:51:11,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:51:11,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956083878] [2025-03-03 22:51:11,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:51:11,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:51:11,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:51:11,785 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:51:11,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 22:51:11,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:51:11,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:51:11,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:51:11,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:51:11,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 22:51:11,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:51:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 318 proven. 9 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2025-03-03 22:51:12,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:51:12,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:51:12,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135367198] [2025-03-03 22:51:12,272 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:51:12,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956083878] [2025-03-03 22:51:12,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956083878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:51:12,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:51:12,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-03 22:51:12,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533004862] [2025-03-03 22:51:12,273 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 22:51:12,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:51:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:51:12,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:51:12,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:51:12,273 INFO L87 Difference]: Start difference. First operand 1596 states and 2227 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:51:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:51:12,922 INFO L93 Difference]: Finished difference Result 3286 states and 4554 transitions. [2025-03-03 22:51:12,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 22:51:12,923 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2025-03-03 22:51:12,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:51:12,934 INFO L225 Difference]: With dead ends: 3286 [2025-03-03 22:51:12,934 INFO L226 Difference]: Without dead ends: 2146 [2025-03-03 22:51:12,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2025-03-03 22:51:12,939 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 307 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:51:12,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 817 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:51:12,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2025-03-03 22:51:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 1941. [2025-03-03 22:51:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1307 states have (on average 1.1996939556235655) internal successors, (1568), 1333 states have internal predecessors, (1568), 559 states have call successors, (559), 74 states have call predecessors, (559), 74 states have return successors, (559), 533 states have call predecessors, (559), 559 states have call successors, (559) [2025-03-03 22:51:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2686 transitions. [2025-03-03 22:51:13,136 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2686 transitions. Word has length 170 [2025-03-03 22:51:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:51:13,137 INFO L471 AbstractCegarLoop]: Abstraction has 1941 states and 2686 transitions. [2025-03-03 22:51:13,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:51:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2686 transitions. [2025-03-03 22:51:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:51:13,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:51:13,140 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:51:13,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 22:51:13,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:51:13,344 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:51:13,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:51:13,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1704628778, now seen corresponding path program 1 times [2025-03-03 22:51:13,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:51:13,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993501343] [2025-03-03 22:51:13,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:51:13,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:51:13,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:51:13,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:51:13,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:51:13,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:51:13,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817266952] [2025-03-03 22:51:13,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:51:13,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:51:13,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:51:13,389 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:51:13,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 22:51:13,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:51:13,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:51:13,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:51:13,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:51:13,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 22:51:13,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:51:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:51:13,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:51:13,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:51:13,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993501343] [2025-03-03 22:51:13,982 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:51:13,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817266952] [2025-03-03 22:51:13,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817266952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:51:13,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:51:13,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 22:51:13,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930688885] [2025-03-03 22:51:13,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:51:13,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 22:51:13,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:51:13,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 22:51:13,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:51:13,984 INFO L87 Difference]: Start difference. First operand 1941 states and 2686 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:51:14,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:51:14,531 INFO L93 Difference]: Finished difference Result 3210 states and 4471 transitions. [2025-03-03 22:51:14,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:51:14,532 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-03-03 22:51:14,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:51:14,542 INFO L225 Difference]: With dead ends: 3210 [2025-03-03 22:51:14,543 INFO L226 Difference]: Without dead ends: 2408 [2025-03-03 22:51:14,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:51:14,547 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 389 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:51:14,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1030 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:51:14,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2025-03-03 22:51:14,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2183. [2025-03-03 22:51:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 1477 states have (on average 1.2044685172647258) internal successors, (1779), 1505 states have internal predecessors, (1779), 625 states have call successors, (625), 80 states have call predecessors, (625), 80 states have return successors, (625), 597 states have call predecessors, (625), 625 states have call successors, (625) [2025-03-03 22:51:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3029 transitions. [2025-03-03 22:51:14,850 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3029 transitions. Word has length 170 [2025-03-03 22:51:14,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:51:14,851 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 3029 transitions. [2025-03-03 22:51:14,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:51:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3029 transitions. [2025-03-03 22:51:14,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 22:51:14,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:51:14,854 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:51:14,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 22:51:15,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 22:51:15,055 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:51:15,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:51:15,055 INFO L85 PathProgramCache]: Analyzing trace with hash 2108785115, now seen corresponding path program 1 times [2025-03-03 22:51:15,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:51:15,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390249197] [2025-03-03 22:51:15,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:51:15,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:51:15,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 22:51:15,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 22:51:15,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:51:15,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:51:15,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1738783809] [2025-03-03 22:51:15,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:51:15,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:51:15,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:51:15,109 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:51:15,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 22:51:15,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 22:51:15,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 22:51:15,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:51:15,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:51:15,286 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:51:15,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 22:51:15,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 22:51:15,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:51:15,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:51:15,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:51:15,419 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:51:15,419 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:51:15,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 22:51:15,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 22:51:15,623 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:51:15,703 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:51:15,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:51:15 BoogieIcfgContainer [2025-03-03 22:51:15,705 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:51:15,707 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:51:15,707 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:51:15,707 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:51:15,708 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:50:48" (3/4) ... [2025-03-03 22:51:15,709 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:51:15,709 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:51:15,710 INFO L158 Benchmark]: Toolchain (without parser) took 28284.48ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 104.8MB in the beginning and 260.8MB in the end (delta: -155.9MB). Peak memory consumption was 326.9MB. Max. memory is 16.1GB. [2025-03-03 22:51:15,710 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:51:15,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.04ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 88.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:51:15,710 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.40ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 86.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:51:15,710 INFO L158 Benchmark]: Boogie Preprocessor took 51.78ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 82.2MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:51:15,710 INFO L158 Benchmark]: IcfgBuilder took 381.24ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 59.2MB in the end (delta: 23.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:51:15,711 INFO L158 Benchmark]: TraceAbstraction took 27490.08ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 58.1MB in the beginning and 260.8MB in the end (delta: -202.6MB). Peak memory consumption was 276.6MB. Max. memory is 16.1GB. [2025-03-03 22:51:15,711 INFO L158 Benchmark]: Witness Printer took 2.34ms. Allocated memory is still 629.1MB. Free memory is still 260.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:51:15,711 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.04ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 88.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.40ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 86.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.78ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 82.2MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 381.24ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 59.2MB in the end (delta: 23.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 27490.08ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 58.1MB in the beginning and 260.8MB in the end (delta: -202.6MB). Peak memory consumption was 276.6MB. Max. memory is 16.1GB. * Witness Printer took 2.34ms. Allocated memory is still 629.1MB. Free memory is still 260.8MB. 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 83, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryFLOATComparisonOperation at line 152, overapproximation of someBinaryFLOATComparisonOperation at line 148, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 146, overapproximation of someBinaryFLOATComparisonOperation at line 199, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryArithmeticFLOAToperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -8; [L23] float var_1_2 = 1.5; [L24] float var_1_3 = 24.7; [L25] float var_1_8 = 0.875; [L26] float var_1_9 = 31.875; [L27] float var_1_10 = 255.25; [L28] float var_1_11 = 0.0; [L29] float var_1_12 = 7.58; [L30] float var_1_13 = 8.6; [L31] float var_1_14 = 49.75; [L32] signed short int var_1_16 = -64; [L33] signed long int var_1_18 = 4; [L34] signed long int var_1_19 = 100; [L35] unsigned char var_1_21 = 0; [L36] unsigned char var_1_23 = 0; [L37] signed char var_1_24 = 16; [L38] signed short int var_1_26 = -1; [L39] signed char var_1_27 = -32; [L40] unsigned char var_1_28 = 1; [L41] signed long int var_1_29 = -4; [L42] signed short int var_1_31 = 1000; [L43] signed long int var_1_32 = 4; [L44] signed short int var_1_33 = 8; [L45] signed short int var_1_34 = 25; [L46] signed short int var_1_35 = 100; [L47] signed short int var_1_36 = 10000; [L48] float var_1_38 = 2.125; [L49] signed long int var_1_39 = -1000000; [L50] signed long int last_1_var_1_1 = -8; [L51] float last_1_var_1_8 = 0.875; [L52] signed short int last_1_var_1_16 = -64; [L53] signed long int last_1_var_1_18 = 4; [L54] signed long int last_1_var_1_19 = 100; [L55] signed char last_1_var_1_24 = 16; [L56] signed long int last_1_var_1_29 = -4; [L57] signed short int last_1_var_1_31 = 1000; [L58] signed long int last_1_var_1_39 = -1000000; VAL [isInitial=0, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_2=3/2, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L203] isInitial = 1 [L204] FCALL initially() [L205] int k_loop; [L206] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_2=3/2, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L206] COND TRUE k_loop < 1 [L207] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_8 = var_1_8 [L190] last_1_var_1_16 = var_1_16 [L191] last_1_var_1_18 = var_1_18 [L192] last_1_var_1_19 = var_1_19 [L193] last_1_var_1_24 = var_1_24 [L194] last_1_var_1_29 = var_1_29 [L195] last_1_var_1_31 = var_1_31 [L196] last_1_var_1_39 = var_1_39 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_2=3/2, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L145] var_1_2 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L146] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L147] var_1_3 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8, var_1_9=255/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8, var_1_9=255/8] [L148] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8, var_1_9=255/8] [L149] var_1_9 = __VERIFIER_nondet_float() [L150] 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_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L150] 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_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L151] var_1_10 = __VERIFIER_nondet_float() [L152] 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_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L152] 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_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L153] var_1_11 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_11 >= 6917529.027641073700e+12F && 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_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L154] RET assume_abort_if_not((var_1_11 >= 6917529.027641073700e+12F && 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_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L155] var_1_12 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L156] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L157] var_1_13 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L158] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L159] var_1_14 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L160] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L161] var_1_23 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L162] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L163] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L163] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L164] var_1_26 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_26 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L165] RET assume_abort_if_not(var_1_26 >= -32768) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L166] CALL assume_abort_if_not(var_1_26 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L166] RET assume_abort_if_not(var_1_26 <= 32767) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L167] CALL assume_abort_if_not(var_1_26 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L167] RET assume_abort_if_not(var_1_26 != 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L168] var_1_27 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L169] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L170] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L170] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L171] var_1_32 = __VERIFIER_nondet_long() [L172] CALL assume_abort_if_not(var_1_32 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L172] RET assume_abort_if_not(var_1_32 >= -1) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L173] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L173] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L174] var_1_33 = __VERIFIER_nondet_short() [L175] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L175] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L176] CALL assume_abort_if_not(var_1_33 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L176] RET assume_abort_if_not(var_1_33 <= 16383) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L177] var_1_34 = __VERIFIER_nondet_short() [L178] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L178] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L179] CALL assume_abort_if_not(var_1_34 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L179] RET assume_abort_if_not(var_1_34 <= 16383) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L180] var_1_35 = __VERIFIER_nondet_short() [L181] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L181] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L182] CALL assume_abort_if_not(var_1_35 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L182] RET assume_abort_if_not(var_1_35 <= 32766) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L183] var_1_36 = __VERIFIER_nondet_short() [L184] CALL assume_abort_if_not(var_1_36 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L184] RET assume_abort_if_not(var_1_36 >= 8191) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L185] CALL assume_abort_if_not(var_1_36 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L185] RET assume_abort_if_not(var_1_36 <= 16383) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L208] RET updateVariables() [L209] CALL step() [L62] COND TRUE (var_1_2 - var_1_3) >= last_1_var_1_8 [L63] var_1_1 = ((last_1_var_1_24 + last_1_var_1_31) + last_1_var_1_16) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L67] signed long int stepLocal_6 = -5; [L68] signed long int stepLocal_5 = last_1_var_1_1; [L69] signed long int stepLocal_4 = (var_1_32 - 4) * last_1_var_1_24; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, stepLocal_5=-8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L70] COND TRUE stepLocal_5 <= (last_1_var_1_18 * var_1_27) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L71] COND TRUE ((((last_1_var_1_18) < (last_1_var_1_16)) ? (last_1_var_1_18) : (last_1_var_1_16))) == stepLocal_4 [L72] var_1_31 = ((var_1_33 + var_1_34) - var_1_35) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L83] COND TRUE ((var_1_13 * var_1_12) * var_1_3) != (var_1_14 + last_1_var_1_8) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L84] COND TRUE last_1_var_1_29 >= (last_1_var_1_19 / var_1_26) [L85] var_1_24 = var_1_27 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L90] COND FALSE !((((((var_1_2 * var_1_10)) > (var_1_11)) ? ((var_1_2 * var_1_10)) : (var_1_11))) > var_1_9) [L97] var_1_16 = var_1_24 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L99] COND TRUE var_1_35 <= var_1_27 [L100] var_1_38 = var_1_9 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_8=7/8, var_1_9=2] [L104] COND TRUE var_1_16 <= ((var_1_31 / -128) + var_1_1) [L105] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_8=7/8, var_1_9=2] [L107] signed long int stepLocal_0 = 64; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_0=64, stepLocal_6=-5, var_1_16=5, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_8=7/8, var_1_9=2] [L108] COND FALSE !(stepLocal_0 <= var_1_24) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_8=7/8, var_1_9=2] [L111] COND FALSE !(\read(var_1_21)) [L114] var_1_8 = (var_1_12 - 2.125f) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L117] COND TRUE var_1_9 > var_1_13 [L118] var_1_18 = (var_1_24 + var_1_31) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L120] unsigned char stepLocal_2 = (var_1_31 + var_1_24) >= var_1_1; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_2=0, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L121] COND FALSE !(stepLocal_2 || var_1_23) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L124] COND TRUE ! var_1_21 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=-1000000, var_1_9=2] [L125] COND TRUE (last_1_var_1_39 <= var_1_31) || var_1_28 [L126] var_1_39 = var_1_36 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=8192, var_1_9=2] [L129] unsigned char stepLocal_1 = var_1_21; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_1=0, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=8192, var_1_9=2] [L130] COND TRUE var_1_28 || stepLocal_1 [L131] var_1_19 = (((((var_1_31 + var_1_24)) > ((-8 + var_1_18))) ? ((var_1_31 + var_1_24)) : ((-8 + var_1_18)))) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=3, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=8192, var_1_9=2] [L133] signed long int stepLocal_3 = var_1_24 * (var_1_31 * var_1_16); VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_3=-50, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=3, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-4, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=8192, var_1_9=2] [L134] COND TRUE -50 == stepLocal_3 [L135] var_1_29 = ((((-500) < (var_1_18)) ? (-500) : (var_1_18))) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_6=-5, var_1_16=5, var_1_18=3, var_1_19=3, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-500, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=8192, var_1_9=2] [L209] RET step() [L210] CALL, EXPR property() [L199-L200] return (((((((((((((var_1_2 - var_1_3) >= last_1_var_1_8) ? (var_1_1 == ((signed long int) ((last_1_var_1_24 + last_1_var_1_31) + last_1_var_1_16))) : (var_1_1 == ((signed long int) last_1_var_1_16))) && ((64 <= var_1_24) ? (var_1_8 == ((float) (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) - (var_1_12 + (var_1_13 + var_1_14))))) : (var_1_21 ? (var_1_8 == ((float) (((((((var_1_13) > (var_1_11)) ? (var_1_13) : (var_1_11))) < 0 ) ? -((((var_1_13) > (var_1_11)) ? (var_1_13) : (var_1_11))) : ((((var_1_13) > (var_1_11)) ? (var_1_13) : (var_1_11))))))) : (var_1_8 == ((float) (var_1_12 - 2.125f)))))) && (((((((var_1_2 * var_1_10)) > (var_1_11)) ? ((var_1_2 * var_1_10)) : (var_1_11))) > var_1_9) ? ((var_1_13 != var_1_2) ? (var_1_16 == ((signed short int) var_1_24)) : (var_1_16 == ((signed short int) var_1_24))) : (var_1_16 == ((signed short int) var_1_24)))) && ((var_1_9 > var_1_13) ? (var_1_18 == ((signed long int) (var_1_24 + var_1_31))) : 1)) && ((var_1_28 || var_1_21) ? (var_1_19 == ((signed long int) (((((var_1_31 + var_1_24)) > ((-8 + var_1_18))) ? ((var_1_31 + var_1_24)) : ((-8 + var_1_18)))))) : 1)) && ((var_1_16 <= ((var_1_31 / -128) + var_1_1)) ? (var_1_21 == ((unsigned char) var_1_23)) : 1)) && ((((var_1_13 * var_1_12) * var_1_3) != (var_1_14 + last_1_var_1_8)) ? ((last_1_var_1_29 >= (last_1_var_1_19 / var_1_26)) ? (var_1_24 == ((signed char) var_1_27)) : (var_1_24 == ((signed char) var_1_27))) : 1)) && ((((var_1_31 + var_1_24) >= var_1_1) || var_1_23) ? (var_1_28 == ((unsigned char) (var_1_21 && var_1_23))) : 1)) && ((-50 == (var_1_24 * (var_1_31 * var_1_16))) ? (var_1_29 == ((signed long int) ((((-500) < (var_1_18)) ? (-500) : (var_1_18))))) : (var_1_23 ? (var_1_29 == ((signed long int) var_1_1)) : (var_1_29 == ((signed long int) var_1_1))))) && ((last_1_var_1_1 <= (last_1_var_1_18 * var_1_27)) ? ((((((last_1_var_1_18) < (last_1_var_1_16)) ? (last_1_var_1_18) : (last_1_var_1_16))) == ((var_1_32 - 4) * last_1_var_1_24)) ? (var_1_31 == ((signed short int) ((var_1_33 + var_1_34) - var_1_35))) : (var_1_31 == ((signed short int) (((var_1_36 - 1) - var_1_33) + var_1_34)))) : ((-5 <= last_1_var_1_39) ? (var_1_31 == ((signed short int) var_1_27)) : (var_1_31 == ((signed short int) last_1_var_1_24))))) && ((var_1_35 <= var_1_27) ? (var_1_38 == ((float) var_1_9)) : (var_1_38 == ((float) (((((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))) < 0 ) ? -((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))) : ((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))))))))) && ((! var_1_21) ? (((last_1_var_1_39 <= var_1_31) || var_1_28) ? (var_1_39 == ((signed long int) var_1_36)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=5, var_1_18=3, var_1_19=3, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-500, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=8192, var_1_9=2] [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=5, var_1_18=3, var_1_19=3, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-500, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=8192, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=5, var_1_18=3, var_1_19=3, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=5, var_1_26=-19, var_1_27=5, var_1_28=1, var_1_29=-500, var_1_31=-2, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=3, var_1_36=8192, var_1_38=2, var_1_39=8192, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.4s, OverallIterations: 13, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3626 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3601 mSDsluCounter, 7889 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5871 mSDsCounter, 988 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5015 IncrementalHoareTripleChecker+Invalid, 6003 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 988 mSolverCounterUnsat, 2018 mSDtfsCounter, 5015 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1721 GetRequests, 1550 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2183occurred in iteration=12, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 1801 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 3734 NumberOfCodeBlocks, 3734 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2526 ConstructedInterpolants, 3 QuantifiedInterpolants, 13291 SizeOfPredicates, 53 NumberOfNonLiveVariables, 3479 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 17691/18000 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:51:15,739 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/21.0.5-tem/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.6.800.v20240513-1750.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-1loop_file-77.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 0cbe4eb7aae73c01b831078f0e738c68709fa97155cdb7dce934011117170926 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:51:17,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:51:17,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:51:17,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:51:17,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:51:17,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:51:17,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:51:17,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:51:17,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:51:17,646 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:51:17,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:51:17,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:51:17,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:51:17,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:51:17,647 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:51:17,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:51:17,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:51:17,647 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:51:17,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:51:17,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:51:17,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:51:17,647 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:51:17,647 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:51:17,647 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:51:17,647 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:51:17,647 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:51:17,647 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:51:17,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:51:17,647 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:51:17,647 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:51:17,647 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:51:17,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:51:17,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:51:17,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:51:17,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:51:17,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:51:17,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:51:17,648 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:51:17,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:51:17,648 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:51:17,648 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:51:17,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:51:17,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:51:17,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:51:17,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:51:17,648 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 0cbe4eb7aae73c01b831078f0e738c68709fa97155cdb7dce934011117170926 [2025-03-03 22:51:17,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:51:17,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:51:17,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:51:17,879 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:51:17,879 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:51:17,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.i [2025-03-03 22:51:19,036 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958b92883/e9a6b566a14a4375a8d797d80eaae0a9/FLAGe10beb437 [2025-03-03 22:51:19,253 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:51:19,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.i [2025-03-03 22:51:19,264 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958b92883/e9a6b566a14a4375a8d797d80eaae0a9/FLAGe10beb437 [2025-03-03 22:51:19,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958b92883/e9a6b566a14a4375a8d797d80eaae0a9 [2025-03-03 22:51:19,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:51:19,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:51:19,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:51:19,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:51:19,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:51:19,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:51:19" (1/1) ... [2025-03-03 22:51:19,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7a081e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:19, skipping insertion in model container [2025-03-03 22:51:19,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:51:19" (1/1) ... [2025-03-03 22:51:19,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:51:19,734 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-1loop_file-77.i[916,929] [2025-03-03 22:51:19,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:51:19,795 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:51:19,803 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-1loop_file-77.i[916,929] [2025-03-03 22:51:19,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:51:19,845 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:51:19,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:19 WrapperNode [2025-03-03 22:51:19,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:51:19,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:51:19,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:51:19,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:51:19,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:19" (1/1) ... [2025-03-03 22:51:19,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:19" (1/1) ... [2025-03-03 22:51:19,892 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2025-03-03 22:51:19,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:51:19,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:51:19,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:51:19,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:51:19,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:19" (1/1) ... [2025-03-03 22:51:19,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:19" (1/1) ... [2025-03-03 22:51:19,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:19" (1/1) ... [2025-03-03 22:51:19,917 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]. [2025-03-03 22:51:19,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:19" (1/1) ... [2025-03-03 22:51:19,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:19" (1/1) ... [2025-03-03 22:51:19,929 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:19" (1/1) ... [2025-03-03 22:51:19,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:19" (1/1) ... [2025-03-03 22:51:19,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:19" (1/1) ... [2025-03-03 22:51:19,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:19" (1/1) ... [2025-03-03 22:51:19,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:51:19,945 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:51:19,945 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:51:19,945 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:51:19,947 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:19" (1/1) ... [2025-03-03 22:51:19,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:51:19,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:51:19,973 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) [2025-03-03 22:51:19,978 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 [2025-03-03 22:51:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:51:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:51:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:51:19,994 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:51:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:51:19,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:51:20,066 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:51:20,068 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:51:30,711 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-03 22:51:30,713 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:51:30,720 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:51:30,722 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:51:30,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:51:30 BoogieIcfgContainer [2025-03-03 22:51:30,722 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:51:30,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:51:30,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:51:30,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:51:30,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:51:19" (1/3) ... [2025-03-03 22:51:30,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac1ceeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:51:30, skipping insertion in model container [2025-03-03 22:51:30,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:19" (2/3) ... [2025-03-03 22:51:30,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac1ceeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:51:30, skipping insertion in model container [2025-03-03 22:51:30,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:51:30" (3/3) ... [2025-03-03 22:51:30,729 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-77.i [2025-03-03 22:51:30,739 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:51:30,741 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-77.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:51:30,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:51:30,787 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;@532bef34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:51:30,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:51:30,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:51:30,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 22:51:30,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:51:30,810 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:51:30,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:51:30,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:51:30,813 INFO L85 PathProgramCache]: Analyzing trace with hash 477050143, now seen corresponding path program 1 times [2025-03-03 22:51:30,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:51:30,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864649065] [2025-03-03 22:51:30,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:51:30,821 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 [2025-03-03 22:51:30,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:51:30,827 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) [2025-03-03 22:51:30,828 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 [2025-03-03 22:51:30,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 22:51:31,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 22:51:31,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:51:31,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:51:31,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:51:31,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:51:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-03-03 22:51:31,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:51:31,316 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:51:31,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864649065] [2025-03-03 22:51:31,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864649065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:51:31,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:51:31,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:51:31,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710133502] [2025-03-03 22:51:31,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:51:31,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:51:31,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:51:31,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:51:31,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:51:31,340 INFO L87 Difference]: Start difference. First operand has 83 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:51:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:51:31,359 INFO L93 Difference]: Finished difference Result 163 states and 278 transitions. [2025-03-03 22:51:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:51:31,360 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, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 168 [2025-03-03 22:51:31,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:51:31,364 INFO L225 Difference]: With dead ends: 163 [2025-03-03 22:51:31,364 INFO L226 Difference]: Without dead ends: 80 [2025-03-03 22:51:31,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:51:31,368 INFO L435 NwaCegarLoop]: 126 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, 126 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 [2025-03-03 22:51:31,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:51:31,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-03 22:51:31,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-03 22:51:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:51:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 123 transitions. [2025-03-03 22:51:31,398 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 123 transitions. Word has length 168 [2025-03-03 22:51:31,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:51:31,399 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 123 transitions. [2025-03-03 22:51:31,399 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, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:51:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 123 transitions. [2025-03-03 22:51:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 22:51:31,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:51:31,404 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:51:31,421 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 [2025-03-03 22:51:31,605 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 [2025-03-03 22:51:31,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:51:31,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:51:31,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1791799686, now seen corresponding path program 1 times [2025-03-03 22:51:31,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:51:31,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372111433] [2025-03-03 22:51:31,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:51:31,607 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 [2025-03-03 22:51:31,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:51:31,609 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) [2025-03-03 22:51:31,610 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 [2025-03-03 22:51:31,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 22:51:32,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 22:51:32,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:51:32,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:51:32,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 22:51:32,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:51:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:51:33,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:51:33,338 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:51:33,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372111433] [2025-03-03 22:51:33,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372111433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:51:33,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:51:33,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:51:33,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782802890] [2025-03-03 22:51:33,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:51:33,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:51:33,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:51:33,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:51:33,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:51:33,342 INFO L87 Difference]: Start difference. First operand 80 states and 123 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:51:38,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:51:42,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:51:46,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:51:50,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:51:50,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:51:50,598 INFO L93 Difference]: Finished difference Result 234 states and 363 transitions. [2025-03-03 22:51:50,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:51:50,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2025-03-03 22:51:50,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:51:50,602 INFO L225 Difference]: With dead ends: 234 [2025-03-03 22:51:50,602 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 22:51:50,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:51:50,603 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 37 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:51:50,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 300 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 4 Unknown, 0 Unchecked, 17.2s Time] [2025-03-03 22:51:50,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 22:51:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2025-03-03 22:51:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 22:51:50,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 239 transitions. [2025-03-03 22:51:50,633 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 239 transitions. Word has length 168 [2025-03-03 22:51:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:51:50,634 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 239 transitions. [2025-03-03 22:51:50,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:51:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 239 transitions. [2025-03-03 22:51:50,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 22:51:50,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:51:50,636 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:51:50,652 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 (3)] Ended with exit code 0 [2025-03-03 22:51:50,839 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 [2025-03-03 22:51:50,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:51:50,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:51:50,840 INFO L85 PathProgramCache]: Analyzing trace with hash -255333731, now seen corresponding path program 1 times [2025-03-03 22:51:50,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:51:50,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140162383] [2025-03-03 22:51:50,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:51:50,841 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 [2025-03-03 22:51:50,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:51:50,843 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) [2025-03-03 22:51:50,844 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 [2025-03-03 22:51:50,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 22:51:51,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 22:51:51,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:51:51,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:51:51,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 22:51:51,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:51:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-03-03 22:51:52,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:51:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:51:53,243 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:51:53,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140162383] [2025-03-03 22:51:53,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140162383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:51:53,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:51:53,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-03 22:51:53,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51518302] [2025-03-03 22:51:53,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:51:53,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:51:53,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:51:53,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:51:53,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:51:53,245 INFO L87 Difference]: Start difference. First operand 154 states and 239 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-03 22:51:58,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:52:02,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:52:06,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:52:06,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:52:06,572 INFO L93 Difference]: Finished difference Result 321 states and 489 transitions. [2025-03-03 22:52:06,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:52:06,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 169 [2025-03-03 22:52:06,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:52:06,575 INFO L225 Difference]: With dead ends: 321 [2025-03-03 22:52:06,575 INFO L226 Difference]: Without dead ends: 170 [2025-03-03 22:52:06,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 330 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:52:06,587 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 169 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 88 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:52:06,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 204 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 154 Invalid, 3 Unknown, 0 Unchecked, 13.0s Time] [2025-03-03 22:52:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-03 22:52:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2025-03-03 22:52:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 107 states have internal predecessors, (139), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 22:52:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 239 transitions. [2025-03-03 22:52:06,610 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 239 transitions. Word has length 169 [2025-03-03 22:52:06,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:52:06,614 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 239 transitions. [2025-03-03 22:52:06,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-03 22:52:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 239 transitions. [2025-03-03 22:52:06,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:52:06,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:52:06,619 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:52:06,635 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 (4)] Ended with exit code 0 [2025-03-03 22:52:06,819 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 [2025-03-03 22:52:06,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:52:06,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:52:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash -742693306, now seen corresponding path program 1 times [2025-03-03 22:52:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:52:06,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380810670] [2025-03-03 22:52:06,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:52:06,820 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 [2025-03-03 22:52:06,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:52:06,822 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) [2025-03-03 22:52:06,823 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 [2025-03-03 22:52:06,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:52:07,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:52:07,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:52:07,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:52:07,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 22:52:07,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:52:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-03-03 22:52:08,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:52:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:52:09,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:52:09,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380810670] [2025-03-03 22:52:09,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380810670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:52:09,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:52:09,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-03-03 22:52:09,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633224924] [2025-03-03 22:52:09,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:52:09,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:52:09,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:52:09,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:52:09,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:52:09,275 INFO L87 Difference]: Start difference. First operand 162 states and 239 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-03 22:52:14,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:52:18,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []