./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-27.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-while_file-27.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 a47397d42d1c051541a5ff3ac9fd7fb3b27424bf73827628895ad4267d200b59 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:56:05,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:56:05,632 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:56:05,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:56:05,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:56:05,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:56:05,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:56:05,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:56:05,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:56:05,661 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:56:05,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:56:05,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:56:05,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:56:05,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:56:05,662 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:56:05,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:56:05,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:56:05,663 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:56:05,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:56:05,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:56:05,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:56:05,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:56:05,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:56:05,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:56:05,663 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:56:05,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:56:05,663 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:56:05,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:56:05,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:56:05,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:56:05,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:56:05,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:56:05,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:56:05,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:56:05,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:56:05,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:56:05,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:56:05,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:56:05,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:56:05,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:56:05,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:56:05,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:56:05,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:56:05,665 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 -> a47397d42d1c051541a5ff3ac9fd7fb3b27424bf73827628895ad4267d200b59 [2025-03-03 22:56:05,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:56:05,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:56:05,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:56:05,891 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:56:05,891 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:56:05,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-27.i [2025-03-03 22:56:07,035 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84d1aa2e/3ba6f67ab16d40ed9998d565b27648d4/FLAGfb1306951 [2025-03-03 22:56:07,277 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:56:07,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-27.i [2025-03-03 22:56:07,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84d1aa2e/3ba6f67ab16d40ed9998d565b27648d4/FLAGfb1306951 [2025-03-03 22:56:07,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84d1aa2e/3ba6f67ab16d40ed9998d565b27648d4 [2025-03-03 22:56:07,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:56:07,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:56:07,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:56:07,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:56:07,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:56:07,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:56:07" (1/1) ... [2025-03-03 22:56:07,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c917b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:07, skipping insertion in model container [2025-03-03 22:56:07,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:56:07" (1/1) ... [2025-03-03 22:56:07,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:56:07,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-27.i[916,929] [2025-03-03 22:56:07,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:56:07,818 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:56:07,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-27.i[916,929] [2025-03-03 22:56:07,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:56:07,883 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:56:07,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:07 WrapperNode [2025-03-03 22:56:07,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:56:07,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:56:07,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:56:07,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:56:07,889 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:56:07" (1/1) ... [2025-03-03 22:56:07,897 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:56:07" (1/1) ... [2025-03-03 22:56:07,939 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2025-03-03 22:56:07,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:56:07,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:56:07,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:56:07,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:56:07,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:07" (1/1) ... [2025-03-03 22:56:07,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:07" (1/1) ... [2025-03-03 22:56:07,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:07" (1/1) ... [2025-03-03 22:56:07,976 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:56:07,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:07" (1/1) ... [2025-03-03 22:56:07,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:07" (1/1) ... [2025-03-03 22:56:07,988 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:07" (1/1) ... [2025-03-03 22:56:07,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:07" (1/1) ... [2025-03-03 22:56:07,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:07" (1/1) ... [2025-03-03 22:56:07,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:07" (1/1) ... [2025-03-03 22:56:08,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:56:08,004 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:56:08,004 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:56:08,004 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:56:08,005 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:07" (1/1) ... [2025-03-03 22:56:08,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:56:08,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:56:08,028 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:56:08,030 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:56:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:56:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:56:08,044 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:56:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:56:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:56:08,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:56:08,105 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:56:08,107 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:56:08,463 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L182: havoc property_#t~bitwise20#1;havoc property_#t~short21#1; [2025-03-03 22:56:08,499 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 22:56:08,499 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:56:08,513 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:56:08,513 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:56:08,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:56:08 BoogieIcfgContainer [2025-03-03 22:56:08,514 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:56:08,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:56:08,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:56:08,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:56:08,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:56:07" (1/3) ... [2025-03-03 22:56:08,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bea6fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:56:08, skipping insertion in model container [2025-03-03 22:56:08,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:07" (2/3) ... [2025-03-03 22:56:08,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bea6fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:56:08, skipping insertion in model container [2025-03-03 22:56:08,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:56:08" (3/3) ... [2025-03-03 22:56:08,521 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-27.i [2025-03-03 22:56:08,533 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:56:08,534 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-27.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:56:08,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:56:08,584 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;@655fb4d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:56:08,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:56:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 64 states have (on average 1.421875) internal successors, (91), 65 states have internal predecessors, (91), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 22:56:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 22:56:08,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:08,599 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:08,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:08,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:08,605 INFO L85 PathProgramCache]: Analyzing trace with hash 672213506, now seen corresponding path program 1 times [2025-03-03 22:56:08,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:08,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4529016] [2025-03-03 22:56:08,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:08,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:08,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 22:56:08,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 22:56:08,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:08,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 22:56:08,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:08,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4529016] [2025-03-03 22:56:08,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4529016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:56:08,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129978537] [2025-03-03 22:56:08,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:08,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:56:08,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:56:08,899 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:56:08,900 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:56:08,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 22:56:09,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 22:56:09,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:09,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:09,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:56:09,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:56:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 22:56:09,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:56:09,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129978537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:09,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:56:09,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:56:09,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246547423] [2025-03-03 22:56:09,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:09,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:56:09,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:09,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:56:09,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:56:09,072 INFO L87 Difference]: Start difference. First operand has 94 states, 64 states have (on average 1.421875) internal successors, (91), 65 states have internal predecessors, (91), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) 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, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 22:56:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:09,107 INFO L93 Difference]: Finished difference Result 182 states and 312 transitions. [2025-03-03 22:56:09,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:56:09,110 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, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 180 [2025-03-03 22:56:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:09,115 INFO L225 Difference]: With dead ends: 182 [2025-03-03 22:56:09,115 INFO L226 Difference]: Without dead ends: 91 [2025-03-03 22:56:09,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:56:09,123 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:09,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:56:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-03 22:56:09,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-03 22:56:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 22:56:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions. [2025-03-03 22:56:09,164 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 180 [2025-03-03 22:56:09,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:09,165 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 139 transitions. [2025-03-03 22:56:09,165 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, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 22:56:09,166 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2025-03-03 22:56:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 22:56:09,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:09,169 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:09,177 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:56:09,370 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:56:09,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:09,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:09,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2085569020, now seen corresponding path program 1 times [2025-03-03 22:56:09,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:09,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702140492] [2025-03-03 22:56:09,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:09,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:09,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 22:56:09,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 22:56:09,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:09,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 22:56:09,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:09,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702140492] [2025-03-03 22:56:09,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702140492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:09,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:56:09,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:56:09,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149014498] [2025-03-03 22:56:09,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:09,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:56:09,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:09,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:56:09,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:56:09,603 INFO L87 Difference]: Start difference. First operand 91 states and 139 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 22:56:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:09,674 INFO L93 Difference]: Finished difference Result 263 states and 403 transitions. [2025-03-03 22:56:09,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:56:09,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-03-03 22:56:09,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:09,677 INFO L225 Difference]: With dead ends: 263 [2025-03-03 22:56:09,677 INFO L226 Difference]: Without dead ends: 175 [2025-03-03 22:56:09,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:56:09,678 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 129 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:09,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 275 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:56:09,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-03 22:56:09,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 102. [2025-03-03 22:56:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 22:56:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 153 transitions. [2025-03-03 22:56:09,689 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 153 transitions. Word has length 181 [2025-03-03 22:56:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:09,691 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 153 transitions. [2025-03-03 22:56:09,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 22:56:09,691 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 153 transitions. [2025-03-03 22:56:09,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 22:56:09,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:09,693 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:09,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:56:09,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:09,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:09,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1850234036, now seen corresponding path program 1 times [2025-03-03 22:56:09,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:09,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956867352] [2025-03-03 22:56:09,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:09,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:09,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 22:56:10,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 22:56:10,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:10,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-03 22:56:10,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:10,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956867352] [2025-03-03 22:56:10,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956867352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:56:10,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108433894] [2025-03-03 22:56:10,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:10,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:56:10,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:56:10,717 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:56:10,718 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:56:10,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 22:56:10,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 22:56:10,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:10,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:10,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 22:56:10,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:56:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 861 proven. 261 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-03 22:56:12,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:56:14,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108433894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:56:14,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:56:14,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 24] total 27 [2025-03-03 22:56:14,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013500039] [2025-03-03 22:56:14,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:56:14,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 22:56:14,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:14,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 22:56:14,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1298, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 22:56:14,616 INFO L87 Difference]: Start difference. First operand 102 states and 153 transitions. Second operand has 27 states, 27 states have (on average 4.333333333333333) internal successors, (117), 25 states have internal predecessors, (117), 9 states have call successors, (53), 8 states have call predecessors, (53), 13 states have return successors, (54), 9 states have call predecessors, (54), 9 states have call successors, (54) [2025-03-03 22:56:16,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:16,729 INFO L93 Difference]: Finished difference Result 330 states and 455 transitions. [2025-03-03 22:56:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-03 22:56:16,729 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.333333333333333) internal successors, (117), 25 states have internal predecessors, (117), 9 states have call successors, (53), 8 states have call predecessors, (53), 13 states have return successors, (54), 9 states have call predecessors, (54), 9 states have call successors, (54) Word has length 182 [2025-03-03 22:56:16,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:16,731 INFO L225 Difference]: With dead ends: 330 [2025-03-03 22:56:16,731 INFO L226 Difference]: Without dead ends: 231 [2025-03-03 22:56:16,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1752 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1351, Invalid=5621, Unknown=0, NotChecked=0, Total=6972 [2025-03-03 22:56:16,735 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 555 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1883 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:16,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 910 Invalid, 1952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1883 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 22:56:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-03 22:56:16,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 200. [2025-03-03 22:56:16,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 146 states have internal predecessors, (182), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 22:56:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 262 transitions. [2025-03-03 22:56:16,771 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 262 transitions. Word has length 182 [2025-03-03 22:56:16,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:16,771 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 262 transitions. [2025-03-03 22:56:16,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.333333333333333) internal successors, (117), 25 states have internal predecessors, (117), 9 states have call successors, (53), 8 states have call predecessors, (53), 13 states have return successors, (54), 9 states have call predecessors, (54), 9 states have call successors, (54) [2025-03-03 22:56:16,772 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2025-03-03 22:56:16,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 22:56:16,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:16,777 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:16,784 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:56:16,977 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:56:16,978 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:16,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:16,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1939174635, now seen corresponding path program 1 times [2025-03-03 22:56:16,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:16,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603969212] [2025-03-03 22:56:16,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:16,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:16,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 22:56:17,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 22:56:17,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:17,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 48 proven. 102 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2025-03-03 22:56:17,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:17,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603969212] [2025-03-03 22:56:17,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603969212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:56:17,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248088553] [2025-03-03 22:56:17,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:17,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:56:17,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:56:17,591 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:56:17,593 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:56:17,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 22:56:17,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 22:56:17,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:17,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:17,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 22:56:17,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:56:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 842 proven. 159 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2025-03-03 22:56:18,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:56:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 57 proven. 168 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2025-03-03 22:56:19,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248088553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:56:19,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:56:19,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 34 [2025-03-03 22:56:19,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858689087] [2025-03-03 22:56:19,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:56:19,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 22:56:19,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:19,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 22:56:19,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 22:56:19,148 INFO L87 Difference]: Start difference. First operand 200 states and 262 transitions. Second operand has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 12 states have call successors, (81), 5 states have call predecessors, (81), 11 states have return successors, (81), 9 states have call predecessors, (81), 12 states have call successors, (81) [2025-03-03 22:56:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:20,386 INFO L93 Difference]: Finished difference Result 772 states and 1029 transitions. [2025-03-03 22:56:20,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 22:56:20,387 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 12 states have call successors, (81), 5 states have call predecessors, (81), 11 states have return successors, (81), 9 states have call predecessors, (81), 12 states have call successors, (81) Word has length 182 [2025-03-03 22:56:20,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:20,394 INFO L225 Difference]: With dead ends: 772 [2025-03-03 22:56:20,396 INFO L226 Difference]: Without dead ends: 575 [2025-03-03 22:56:20,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=642, Invalid=2114, Unknown=0, NotChecked=0, Total=2756 [2025-03-03 22:56:20,400 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 1341 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:20,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 913 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 22:56:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-03 22:56:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 425. [2025-03-03 22:56:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 316 states have (on average 1.2879746835443038) internal successors, (407), 318 states have internal predecessors, (407), 80 states have call successors, (80), 28 states have call predecessors, (80), 28 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 22:56:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 567 transitions. [2025-03-03 22:56:20,458 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 567 transitions. Word has length 182 [2025-03-03 22:56:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:20,458 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 567 transitions. [2025-03-03 22:56:20,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 12 states have call successors, (81), 5 states have call predecessors, (81), 11 states have return successors, (81), 9 states have call predecessors, (81), 12 states have call successors, (81) [2025-03-03 22:56:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 567 transitions. [2025-03-03 22:56:20,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 22:56:20,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:20,462 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:20,469 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:56:20,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:56:20,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:20,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:20,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2089124469, now seen corresponding path program 1 times [2025-03-03 22:56:20,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:20,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599119527] [2025-03-03 22:56:20,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:20,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:20,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 22:56:20,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 22:56:20,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:20,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:56:20,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2131235793] [2025-03-03 22:56:20,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:20,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:56:20,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:56:20,783 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:56:20,784 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:56:20,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 22:56:20,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 22:56:20,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:20,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:20,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 22:56:20,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:56:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 152 proven. 147 refuted. 0 times theorem prover too weak. 1105 trivial. 0 not checked. [2025-03-03 22:56:21,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:56:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 3 proven. 150 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2025-03-03 22:56:21,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:56:21,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599119527] [2025-03-03 22:56:21,493 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:56:21,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131235793] [2025-03-03 22:56:21,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131235793] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:56:21,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:56:21,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-03-03 22:56:21,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585217587] [2025-03-03 22:56:21,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:56:21,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 22:56:21,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:56:21,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 22:56:21,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:56:21,495 INFO L87 Difference]: Start difference. First operand 425 states and 567 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 4 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (54), 3 states have call predecessors, (54), 4 states have call successors, (54) [2025-03-03 22:56:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:21,809 INFO L93 Difference]: Finished difference Result 855 states and 1139 transitions. [2025-03-03 22:56:21,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 22:56:21,810 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 4 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (54), 3 states have call predecessors, (54), 4 states have call successors, (54) Word has length 182 [2025-03-03 22:56:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:21,813 INFO L225 Difference]: With dead ends: 855 [2025-03-03 22:56:21,814 INFO L226 Difference]: Without dead ends: 433 [2025-03-03 22:56:21,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2025-03-03 22:56:21,816 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 322 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:21,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 457 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:56:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-03 22:56:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 425. [2025-03-03 22:56:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 316 states have (on average 1.2816455696202531) internal successors, (405), 318 states have internal predecessors, (405), 80 states have call successors, (80), 28 states have call predecessors, (80), 28 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 22:56:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 565 transitions. [2025-03-03 22:56:21,862 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 565 transitions. Word has length 182 [2025-03-03 22:56:21,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:21,862 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 565 transitions. [2025-03-03 22:56:21,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 4 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (54), 3 states have call predecessors, (54), 4 states have call successors, (54) [2025-03-03 22:56:21,862 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 565 transitions. [2025-03-03 22:56:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 22:56:21,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:21,864 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:21,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 22:56:22,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:56:22,068 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:22,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:22,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1127510452, now seen corresponding path program 1 times [2025-03-03 22:56:22,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:56:22,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323347121] [2025-03-03 22:56:22,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:22,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:56:22,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 22:56:22,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 22:56:22,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:22,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:56:22,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [59669031] [2025-03-03 22:56:22,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:22,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:56:22,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:56:22,173 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:56:22,177 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:56:22,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 22:56:22,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 22:56:22,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:22,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:56:22,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:56:22,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 22:56:22,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 22:56:22,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:22,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:56:22,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:56:22,582 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:56:22,582 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:56:22,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 22:56:22,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:56:22,786 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 22:56:22,894 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:56:22,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:56:22 BoogieIcfgContainer [2025-03-03 22:56:22,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:56:22,900 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:56:22,900 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:56:22,900 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:56:22,901 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:56:08" (3/4) ... [2025-03-03 22:56:22,902 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:56:22,903 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:56:22,904 INFO L158 Benchmark]: Toolchain (without parser) took 15296.01ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 106.0MB in the beginning and 191.8MB in the end (delta: -85.8MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. [2025-03-03 22:56:22,904 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:56:22,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.27ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 90.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:56:22,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.79ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 84.1MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:56:22,905 INFO L158 Benchmark]: Boogie Preprocessor took 62.34ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 78.2MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:56:22,905 INFO L158 Benchmark]: IcfgBuilder took 509.86ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 43.3MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 22:56:22,906 INFO L158 Benchmark]: TraceAbstraction took 14384.28ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 43.3MB in the beginning and 191.9MB in the end (delta: -148.6MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2025-03-03 22:56:22,906 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 335.5MB. Free memory was 191.9MB in the beginning and 191.8MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:56:22,907 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.27ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 90.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.79ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 84.1MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.34ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 78.2MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 509.86ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 43.3MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14384.28ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 43.3MB in the beginning and 191.9MB in the end (delta: -148.6MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 335.5MB. Free memory was 191.9MB in the beginning and 191.8MB in the end (delta: 106.2kB). 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 171, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someUnaryDOUBLEoperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 165. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_3 = 25; [L24] signed char var_1_4 = 10; [L25] signed char var_1_5 = -10; [L26] signed char var_1_6 = -1; [L27] signed short int var_1_7 = -4; [L28] signed char var_1_8 = 50; [L29] signed short int var_1_9 = 2; [L30] unsigned long int var_1_10 = 128; [L31] unsigned char var_1_11 = 2; [L32] unsigned long int var_1_12 = 2781423228; [L33] unsigned long int var_1_13 = 3552320529; [L34] double var_1_14 = 2.25; [L35] unsigned char var_1_15 = 5; [L36] unsigned char var_1_16 = 64; [L37] double var_1_17 = 9.48; [L38] double var_1_18 = 256.05; [L39] float var_1_19 = 1.1; [L40] float var_1_21 = 16.5; [L41] float var_1_22 = 9.4; [L42] unsigned short int var_1_23 = 100; [L43] unsigned char var_1_24 = 5; [L44] unsigned short int var_1_25 = 4; [L45] unsigned short int var_1_26 = 48215; [L46] unsigned short int var_1_27 = 10; [L47] unsigned short int var_1_28 = 1; [L48] signed char var_1_29 = 0; [L49] unsigned long int var_1_30 = 1524073358; [L50] unsigned char var_1_31 = 1; [L51] double var_1_32 = 64.45; VAL [isInitial=0, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=25, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] FCALL updateLastVariables() [L190] CALL updateVariables() [L136] var_1_3 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L138] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L138] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L139] var_1_4 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L140] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L141] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L141] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L142] var_1_5 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_5 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L143] RET assume_abort_if_not(var_1_5 >= -63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L144] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L144] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L145] var_1_6 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_6 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L146] RET assume_abort_if_not(var_1_6 >= -63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L147] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L147] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L148] var_1_11 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L149] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L150] CALL assume_abort_if_not(var_1_11 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L150] RET assume_abort_if_not(var_1_11 <= 255) VAL [isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L151] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L151] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L152] var_1_12 = __VERIFIER_nondet_ulong() [L153] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L153] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L154] CALL assume_abort_if_not(var_1_12 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L154] RET assume_abort_if_not(var_1_12 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L155] var_1_13 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_13 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L156] RET assume_abort_if_not(var_1_13 >= 3221225470) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L157] CALL assume_abort_if_not(var_1_13 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L157] RET assume_abort_if_not(var_1_13 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L158] var_1_15 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L159] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L160] CALL assume_abort_if_not(var_1_15 <= 128) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L160] RET assume_abort_if_not(var_1_15 <= 128) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L161] var_1_16 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L162] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L163] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L163] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L164] var_1_17 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L165] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L166] var_1_18 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L167] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L168] var_1_21 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L169] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L170] var_1_22 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L171] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L172] var_1_26 = __VERIFIER_nondet_ushort() [L173] CALL assume_abort_if_not(var_1_26 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L173] RET assume_abort_if_not(var_1_26 >= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L174] CALL assume_abort_if_not(var_1_26 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L174] RET assume_abort_if_not(var_1_26 <= 65534) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L175] var_1_30 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_30 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L176] RET assume_abort_if_not(var_1_30 >= 1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L177] CALL assume_abort_if_not(var_1_30 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L177] RET assume_abort_if_not(var_1_30 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=-4, var_1_8=50, var_1_9=2] [L190] RET updateVariables() [L191] CALL step() [L55] var_1_7 = ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) [L56] signed long int stepLocal_0 = 128 - 256; VAL [isInitial=1, stepLocal_0=-128, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=50, var_1_9=2] [L57] COND FALSE !((var_1_4 * var_1_3) < stepLocal_0) [L60] var_1_8 = -16 VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=2] [L62] var_1_9 = var_1_6 [L63] signed char stepLocal_4 = var_1_4; VAL [isInitial=1, stepLocal_4=0, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L64] COND TRUE var_1_12 >= stepLocal_4 [L65] var_1_23 = var_1_16 VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L67] var_1_24 = (var_1_16 + var_1_3) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L68] COND TRUE var_1_8 != (var_1_11 + var_1_5) [L69] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_19=11/10, var_1_1=32, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L71] var_1_31 = 0 [L72] var_1_32 = var_1_17 VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=2, var_1_19=11/10, var_1_1=32, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L73] COND FALSE !(! (! var_1_31)) VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=2, var_1_19=11/10, var_1_1=32, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L76] COND FALSE !(\read(var_1_31)) [L79] var_1_1 = var_1_4 VAL [isInitial=1, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=2, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L82] signed long int stepLocal_1 = (var_1_9 * 128) / var_1_11; VAL [isInitial=1, stepLocal_1=-73, var_1_10=128, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=2, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L83] COND FALSE !(\read(var_1_31)) [L90] var_1_10 = var_1_13 VAL [isInitial=1, stepLocal_1=-73, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=2, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L92] signed long int stepLocal_2 = (- var_1_11) / (var_1_15 + var_1_16); VAL [isInitial=1, stepLocal_1=-73, stepLocal_2=-2, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=39, var_1_16=5, var_1_17=2, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L93] COND TRUE stepLocal_2 <= var_1_3 [L94] var_1_14 = ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) > (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18))) VAL [isInitial=1, stepLocal_1=-73, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L100] unsigned long int stepLocal_5 = var_1_13; VAL [isInitial=1, stepLocal_1=-73, stepLocal_5=7516192766, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L101] COND FALSE !((~ var_1_10) >= stepLocal_5) VAL [isInitial=1, stepLocal_1=-73, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L104] COND TRUE -16 <= var_1_27 VAL [isInitial=1, stepLocal_1=-73, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L105] COND TRUE var_1_5 == var_1_28 [L106] var_1_25 = ((((var_1_4) > (var_1_8)) ? (var_1_4) : (var_1_8))) VAL [isInitial=1, stepLocal_1=-73, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=0, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L111] unsigned long int stepLocal_3 = var_1_10; VAL [isInitial=1, stepLocal_1=-73, stepLocal_3=7516192766, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=5, var_1_24=5, var_1_25=0, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L112] COND FALSE !(\read(var_1_31)) [L119] var_1_19 = var_1_22 VAL [isInitial=1, stepLocal_1=-73, stepLocal_3=7516192766, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=5, var_1_24=5, var_1_25=0, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L121] EXPR (var_1_6 / var_1_11) | var_1_5 VAL [isInitial=1, stepLocal_1=-73, stepLocal_3=7516192766, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=5, var_1_24=5, var_1_25=0, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L121] COND FALSE !((var_1_16 + var_1_3) < ((var_1_6 / var_1_11) | var_1_5)) [L126] COND FALSE !(((((var_1_19 + var_1_22) < 0 ) ? -(var_1_19 + var_1_22) : (var_1_19 + var_1_22))) < var_1_18) [L131] var_1_29 = var_1_6 VAL [isInitial=1, stepLocal_1=-73, stepLocal_3=7516192766, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=5, var_1_24=5, var_1_25=0, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=-52, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L191] RET step() [L192] CALL, EXPR property() [L182] EXPR (((((((((((((! (! var_1_31)) ? (var_1_1 == ((signed char) ((((((var_1_3 - var_1_4)) > (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5))) + var_1_6))) : (var_1_31 ? (var_1_1 == ((signed char) var_1_3)) : (var_1_1 == ((signed char) var_1_4)))) && (var_1_7 == ((signed short int) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))))) && (((var_1_4 * var_1_3) < (128 - 256)) ? (var_1_8 == ((signed char) (var_1_4 - 4))) : (var_1_8 == ((signed char) -16)))) && (var_1_9 == ((signed short int) var_1_6))) && (var_1_31 ? ((((var_1_9 * 128) / var_1_11) != (((((var_1_4 - var_1_3)) > (var_1_1)) ? ((var_1_4 - var_1_3)) : (var_1_1)))) ? (var_1_10 == ((unsigned long int) (((((var_1_12) < ((var_1_13 - var_1_3))) ? (var_1_12) : ((var_1_13 - var_1_3)))) - var_1_4))) : (var_1_10 == ((unsigned long int) var_1_11))) : (var_1_10 == ((unsigned long int) var_1_13)))) && ((((- var_1_11) / (var_1_15 + var_1_16)) <= var_1_3) ? (var_1_14 == ((double) ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) > (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18))))) : (var_1_31 ? (var_1_14 == ((double) var_1_17)) : 1))) && (var_1_31 ? ((var_1_10 < (var_1_15 + (var_1_13 + var_1_25))) ? (var_1_19 == ((float) (var_1_21 - (var_1_22 + 8.25f)))) : (var_1_19 == ((float) var_1_18))) : (var_1_19 == ((float) var_1_22)))) && ((var_1_12 >= var_1_4) ? (var_1_23 == ((unsigned short int) var_1_16)) : 1)) && (var_1_24 == ((unsigned char) (var_1_16 + var_1_3)))) && ((-16 <= var_1_27) ? ((var_1_5 == var_1_28) ? (var_1_25 == ((unsigned short int) ((((var_1_4) > (var_1_8)) ? (var_1_4) : (var_1_8))))) : 1) : (var_1_25 == ((unsigned short int) (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))) - var_1_4))))) && ((var_1_8 != (var_1_11 + var_1_5)) ? (var_1_27 == ((unsigned short int) var_1_15)) : 1)) && (((~ var_1_10) >= var_1_13) ? (var_1_28 == ((unsigned short int) (var_1_26 - var_1_4))) : 1)) && (((var_1_16 + var_1_3) < ((var_1_6 / var_1_11) | var_1_5)) ? (((3214144168u - (var_1_30 - var_1_10)) != (- var_1_27)) ? (var_1_29 == ((signed char) (((((var_1_3 + var_1_5)) > (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) ? ((var_1_3 + var_1_5)) : (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))))) : 1) : ((((((var_1_19 + var_1_22) < 0 ) ? -(var_1_19 + var_1_22) : (var_1_19 + var_1_22))) < var_1_18) ? ((var_1_22 <= var_1_19) ? (var_1_29 == ((signed char) var_1_4)) : 1) : (var_1_29 == ((signed char) var_1_6)))) VAL [isInitial=1, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=5, var_1_24=5, var_1_25=0, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=-52, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L182-L183] return (((((((((((((((! (! var_1_31)) ? (var_1_1 == ((signed char) ((((((var_1_3 - var_1_4)) > (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5))) + var_1_6))) : (var_1_31 ? (var_1_1 == ((signed char) var_1_3)) : (var_1_1 == ((signed char) var_1_4)))) && (var_1_7 == ((signed short int) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))))) && (((var_1_4 * var_1_3) < (128 - 256)) ? (var_1_8 == ((signed char) (var_1_4 - 4))) : (var_1_8 == ((signed char) -16)))) && (var_1_9 == ((signed short int) var_1_6))) && (var_1_31 ? ((((var_1_9 * 128) / var_1_11) != (((((var_1_4 - var_1_3)) > (var_1_1)) ? ((var_1_4 - var_1_3)) : (var_1_1)))) ? (var_1_10 == ((unsigned long int) (((((var_1_12) < ((var_1_13 - var_1_3))) ? (var_1_12) : ((var_1_13 - var_1_3)))) - var_1_4))) : (var_1_10 == ((unsigned long int) var_1_11))) : (var_1_10 == ((unsigned long int) var_1_13)))) && ((((- var_1_11) / (var_1_15 + var_1_16)) <= var_1_3) ? (var_1_14 == ((double) ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) > (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18))))) : (var_1_31 ? (var_1_14 == ((double) var_1_17)) : 1))) && (var_1_31 ? ((var_1_10 < (var_1_15 + (var_1_13 + var_1_25))) ? (var_1_19 == ((float) (var_1_21 - (var_1_22 + 8.25f)))) : (var_1_19 == ((float) var_1_18))) : (var_1_19 == ((float) var_1_22)))) && ((var_1_12 >= var_1_4) ? (var_1_23 == ((unsigned short int) var_1_16)) : 1)) && (var_1_24 == ((unsigned char) (var_1_16 + var_1_3)))) && ((-16 <= var_1_27) ? ((var_1_5 == var_1_28) ? (var_1_25 == ((unsigned short int) ((((var_1_4) > (var_1_8)) ? (var_1_4) : (var_1_8))))) : 1) : (var_1_25 == ((unsigned short int) (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))) - var_1_4))))) && ((var_1_8 != (var_1_11 + var_1_5)) ? (var_1_27 == ((unsigned short int) var_1_15)) : 1)) && (((~ var_1_10) >= var_1_13) ? (var_1_28 == ((unsigned short int) (var_1_26 - var_1_4))) : 1)) && (((var_1_16 + var_1_3) < ((var_1_6 / var_1_11) | var_1_5)) ? (((3214144168u - (var_1_30 - var_1_10)) != (- var_1_27)) ? (var_1_29 == ((signed char) (((((var_1_3 + var_1_5)) > (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) ? ((var_1_3 + var_1_5)) : (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))))) : 1) : ((((((var_1_19 + var_1_22) < 0 ) ? -(var_1_19 + var_1_22) : (var_1_19 + var_1_22))) < var_1_18) ? ((var_1_22 <= var_1_19) ? (var_1_29 == ((signed char) var_1_4)) : 1) : (var_1_29 == ((signed char) var_1_6))))) && (var_1_31 == ((unsigned char) 0))) && (var_1_32 == ((double) var_1_17)) ; [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=5, var_1_24=5, var_1_25=0, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=-52, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] [L19] reach_error() VAL [isInitial=1, var_1_10=7516192766, var_1_11=90, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=39, var_1_16=5, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=5, var_1_24=5, var_1_25=0, var_1_26=32767, var_1_27=39, var_1_28=1, var_1_29=-52, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=-52, var_1_7=0, var_1_8=-16, var_1_9=-52] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.2s, OverallIterations: 6, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2354 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2347 mSDsluCounter, 2692 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2079 mSDsCounter, 226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3879 IncrementalHoareTripleChecker+Invalid, 4105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 226 mSolverCounterUnsat, 613 mSDtfsCounter, 3879 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1331 GetRequests, 1178 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2478 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=4, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 262 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1997 NumberOfCodeBlocks, 1997 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1805 ConstructedInterpolants, 0 QuantifiedInterpolants, 9954 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1697 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 12962/14040 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:56:22,948 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-while_file-27.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 a47397d42d1c051541a5ff3ac9fd7fb3b27424bf73827628895ad4267d200b59 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:56:24,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:56:24,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:56:24,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:56:24,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:56:24,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:56:24,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:56:24,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:56:24,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:56:24,800 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:56:24,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:56:24,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:56:24,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:56:24,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:56:24,802 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:56:24,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:56:24,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:56:24,802 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:56:24,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:56:24,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:56:24,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:56:24,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:56:24,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:56:24,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:56:24,803 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:56:24,803 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:56:24,803 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:56:24,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:56:24,803 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:56:24,803 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:56:24,803 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:56:24,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:56:24,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:56:24,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:56:24,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:56:24,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:56:24,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:56:24,804 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:56:24,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:56:24,805 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:56:24,805 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:56:24,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:56:24,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:56:24,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:56:24,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:56:24,805 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 -> a47397d42d1c051541a5ff3ac9fd7fb3b27424bf73827628895ad4267d200b59 [2025-03-03 22:56:25,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:56:25,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:56:25,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:56:25,049 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:56:25,049 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:56:25,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-27.i [2025-03-03 22:56:26,229 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d3d31e1/a1d1ed2e87794ffaa35be94ca9b76b75/FLAG008948ddc [2025-03-03 22:56:26,438 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:56:26,438 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-27.i [2025-03-03 22:56:26,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d3d31e1/a1d1ed2e87794ffaa35be94ca9b76b75/FLAG008948ddc [2025-03-03 22:56:26,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d3d31e1/a1d1ed2e87794ffaa35be94ca9b76b75 [2025-03-03 22:56:26,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:56:26,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:56:26,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:56:26,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:56:26,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:56:26,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:56:26" (1/1) ... [2025-03-03 22:56:26,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d0ef76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:26, skipping insertion in model container [2025-03-03 22:56:26,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:56:26" (1/1) ... [2025-03-03 22:56:26,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:56:26,901 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-27.i[916,929] [2025-03-03 22:56:26,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:56:26,963 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:56:26,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-27.i[916,929] [2025-03-03 22:56:26,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:56:27,014 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:56:27,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:27 WrapperNode [2025-03-03 22:56:27,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:56:27,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:56:27,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:56:27,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:56:27,023 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:56:27" (1/1) ... [2025-03-03 22:56:27,032 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:56:27" (1/1) ... [2025-03-03 22:56:27,051 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-03-03 22:56:27,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:56:27,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:56:27,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:56:27,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:56:27,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:27" (1/1) ... [2025-03-03 22:56:27,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:27" (1/1) ... [2025-03-03 22:56:27,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:27" (1/1) ... [2025-03-03 22:56:27,091 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:56:27,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:27" (1/1) ... [2025-03-03 22:56:27,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:27" (1/1) ... [2025-03-03 22:56:27,103 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:27" (1/1) ... [2025-03-03 22:56:27,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:27" (1/1) ... [2025-03-03 22:56:27,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:27" (1/1) ... [2025-03-03 22:56:27,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:27" (1/1) ... [2025-03-03 22:56:27,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:56:27,125 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:56:27,125 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:56:27,125 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:56:27,127 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:27" (1/1) ... [2025-03-03 22:56:27,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:56:27,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:56:27,155 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:56:27,159 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:56:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:56:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:56:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:56:27,182 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:56:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:56:27,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:56:27,252 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:56:27,254 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:56:30,751 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 22:56:30,751 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:56:30,759 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:56:30,759 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:56:30,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:56:30 BoogieIcfgContainer [2025-03-03 22:56:30,760 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:56:30,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:56:30,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:56:30,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:56:30,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:56:26" (1/3) ... [2025-03-03 22:56:30,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a842e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:56:30, skipping insertion in model container [2025-03-03 22:56:30,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:27" (2/3) ... [2025-03-03 22:56:30,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a842e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:56:30, skipping insertion in model container [2025-03-03 22:56:30,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:56:30" (3/3) ... [2025-03-03 22:56:30,769 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-27.i [2025-03-03 22:56:30,779 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:56:30,781 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-27.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:56:30,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:56:30,835 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;@727dd80f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:56:30,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:56:30,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 22:56:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 22:56:30,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:30,850 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:30,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:30,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:30,855 INFO L85 PathProgramCache]: Analyzing trace with hash 2058320315, now seen corresponding path program 1 times [2025-03-03 22:56:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:56:30,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054845114] [2025-03-03 22:56:30,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:30,864 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:56:30,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:56:30,866 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:56:30,878 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:56:30,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 22:56:31,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 22:56:31,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:31,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:31,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:56:31,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:56:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-03 22:56:31,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:56:31,304 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:56:31,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054845114] [2025-03-03 22:56:31,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054845114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:31,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:56:31,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:56:31,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044084972] [2025-03-03 22:56:31,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:31,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:56:31,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:56:31,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:56:31,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:56:31,325 INFO L87 Difference]: Start difference. First operand has 85 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 22:56:31,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:31,349 INFO L93 Difference]: Finished difference Result 164 states and 284 transitions. [2025-03-03 22:56:31,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:56:31,351 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 177 [2025-03-03 22:56:31,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:31,355 INFO L225 Difference]: With dead ends: 164 [2025-03-03 22:56:31,355 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 22:56:31,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 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:56:31,360 INFO L435 NwaCegarLoop]: 125 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, 125 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:56:31,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:56:31,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 22:56:31,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-03 22:56:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 22:56:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2025-03-03 22:56:31,396 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 177 [2025-03-03 22:56:31,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:31,396 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2025-03-03 22:56:31,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 22:56:31,396 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2025-03-03 22:56:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 22:56:31,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:31,399 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:31,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 22:56:31,599 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:56:31,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:31,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:31,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1064133492, now seen corresponding path program 1 times [2025-03-03 22:56:31,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:56:31,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429179097] [2025-03-03 22:56:31,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:31,601 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:56:31,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:56:31,603 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:56:31,605 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:56:31,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 22:56:31,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 22:56:31,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:31,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:31,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 22:56:31,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:56:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 216 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:56:34,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:56:35,934 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:56:35,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429179097] [2025-03-03 22:56:35,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429179097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:56:35,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1945823160] [2025-03-03 22:56:35,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:35,935 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 22:56:35,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 22:56:35,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 22:56:35,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-03 22:56:36,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 22:56:36,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 22:56:36,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:36,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:36,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 22:56:36,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:56:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 22:56:36,527 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:56:36,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1945823160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:56:36,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:56:36,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2025-03-03 22:56:36,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523016727] [2025-03-03 22:56:36,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:56:36,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:56:36,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:56:36,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:56:36,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:56:36,532 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 22:56:38,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:56:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:38,914 INFO L93 Difference]: Finished difference Result 236 states and 361 transitions. [2025-03-03 22:56:38,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:56:38,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 178 [2025-03-03 22:56:38,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:38,945 INFO L225 Difference]: With dead ends: 236 [2025-03-03 22:56:38,945 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 22:56:38,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:56:38,947 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 108 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:38,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 241 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 22:56:38,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 22:56:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 93. [2025-03-03 22:56:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 22:56:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2025-03-03 22:56:38,964 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 178 [2025-03-03 22:56:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:38,966 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2025-03-03 22:56:38,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 22:56:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2025-03-03 22:56:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 22:56:38,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:38,968 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:38,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2025-03-03 22:56:39,181 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:56:39,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:56:39,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:39,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:39,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1691058415, now seen corresponding path program 1 times [2025-03-03 22:56:39,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:56:39,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170822028] [2025-03-03 22:56:39,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:39,371 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:56:39,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:56:39,373 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:56:39,374 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:56:39,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 22:56:39,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 22:56:39,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:39,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:39,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 22:56:39,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:56:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 216 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:56:42,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:56:43,490 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:56:43,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170822028] [2025-03-03 22:56:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170822028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:56:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [786426465] [2025-03-03 22:56:43,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:43,491 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 22:56:43,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 22:56:43,493 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 22:56:43,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-03 22:56:43,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 22:56:44,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 22:56:44,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:44,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:44,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 22:56:44,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:56:46,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 216 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 22:56:46,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:56:47,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [786426465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:56:47,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:56:47,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2025-03-03 22:56:47,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91939928] [2025-03-03 22:56:47,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:56:47,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 22:56:47,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:56:47,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 22:56:47,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:56:47,961 INFO L87 Difference]: Start difference. First operand 93 states and 139 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-03 22:56:52,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:56:52,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:56:52,692 INFO L93 Difference]: Finished difference Result 197 states and 286 transitions. [2025-03-03 22:56:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 22:56:52,693 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 179 [2025-03-03 22:56:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:56:52,694 INFO L225 Difference]: With dead ends: 197 [2025-03-03 22:56:52,694 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 22:56:52,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-03 22:56:52,696 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 52 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:56:52,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 299 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-03 22:56:52,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 22:56:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-03-03 22:56:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 22:56:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2025-03-03 22:56:52,708 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 179 [2025-03-03 22:56:52,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:56:52,708 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2025-03-03 22:56:52,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-03 22:56:52,709 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2025-03-03 22:56:52,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 22:56:52,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:56:52,710 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:52,723 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 (5)] Ended with exit code 0 [2025-03-03 22:56:52,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2025-03-03 22:56:53,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 22:56:53,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:56:53,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:56:53,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1758065168, now seen corresponding path program 1 times [2025-03-03 22:56:53,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:56:53,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384905149] [2025-03-03 22:56:53,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:56:53,112 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:56:53,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:56:53,114 INFO L229 MonitoredProcess]: Starting monitored process 7 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:56:53,117 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 (7)] Waiting until timeout for monitored process [2025-03-03 22:56:53,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 22:56:53,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 22:56:53,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:56:53,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:56:53,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:56:53,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:56:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 728 proven. 39 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-03 22:56:54,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:56:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-03 22:56:54,800 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:56:54,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384905149] [2025-03-03 22:56:54,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384905149] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:56:54,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:56:54,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-03 22:56:54,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601935734] [2025-03-03 22:56:54,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:56:54,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 22:56:54,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:56:54,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 22:56:54,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:56:54,801 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2025-03-03 22:56:59,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:57:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:57:00,184 INFO L93 Difference]: Finished difference Result 269 states and 368 transitions. [2025-03-03 22:57:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:57:00,186 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 179 [2025-03-03 22:57:00,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:57:00,193 INFO L225 Difference]: With dead ends: 269 [2025-03-03 22:57:00,193 INFO L226 Difference]: Without dead ends: 167 [2025-03-03 22:57:00,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2025-03-03 22:57:00,194 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 205 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:57:00,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 423 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-03 22:57:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-03 22:57:00,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2025-03-03 22:57:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 110 states have (on average 1.2363636363636363) internal successors, (136), 111 states have internal predecessors, (136), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 22:57:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 216 transitions. [2025-03-03 22:57:00,212 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 216 transitions. Word has length 179 [2025-03-03 22:57:00,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:57:00,212 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 216 transitions. [2025-03-03 22:57:00,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2025-03-03 22:57:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 216 transitions. [2025-03-03 22:57:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 22:57:00,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:57:00,213 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:00,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2025-03-03 22:57:00,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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:57:00,418 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:57:00,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:57:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash 739950769, now seen corresponding path program 1 times [2025-03-03 22:57:00,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:57:00,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324311631] [2025-03-03 22:57:00,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:00,419 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:57:00,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:57:00,421 INFO L229 MonitoredProcess]: Starting monitored process 8 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:57:00,421 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 (8)] Waiting until timeout for monitored process [2025-03-03 22:57:00,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 22:57:00,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 22:57:00,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:00,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:00,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 22:57:00,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:57:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 22:57:00,834 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:57:00,834 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:57:00,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324311631] [2025-03-03 22:57:00,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324311631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:57:00,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:57:00,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:57:00,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437687042] [2025-03-03 22:57:00,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:57:00,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:57:00,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:57:00,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:57:00,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:57:00,835 INFO L87 Difference]: Start difference. First operand 160 states and 216 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 22:57:03,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 22:57:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:57:03,611 INFO L93 Difference]: Finished difference Result 482 states and 639 transitions. [2025-03-03 22:57:03,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:57:03,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-03-03 22:57:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:57:03,615 INFO L225 Difference]: With dead ends: 482 [2025-03-03 22:57:03,615 INFO L226 Difference]: Without dead ends: 325 [2025-03-03 22:57:03,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 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:57:03,616 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 198 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 22:57:03,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 449 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 22:57:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-03 22:57:03,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 256. [2025-03-03 22:57:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 190 states have (on average 1.2473684210526317) internal successors, (237), 193 states have internal predecessors, (237), 48 states have call successors, (48), 17 states have call predecessors, (48), 17 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 22:57:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 333 transitions. [2025-03-03 22:57:03,660 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 333 transitions. Word has length 179 [2025-03-03 22:57:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:57:03,660 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 333 transitions. [2025-03-03 22:57:03,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 22:57:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 333 transitions. [2025-03-03 22:57:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 22:57:03,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:57:03,662 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:03,675 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 (8)] Ended with exit code 0 [2025-03-03 22:57:03,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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:57:03,862 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:57:03,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:57:03,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1067503694, now seen corresponding path program 1 times [2025-03-03 22:57:03,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:57:03,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121853332] [2025-03-03 22:57:03,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:03,863 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:57:03,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:57:03,865 INFO L229 MonitoredProcess]: Starting monitored process 9 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:57:03,866 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 (9)] Waiting until timeout for monitored process [2025-03-03 22:57:03,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 22:57:04,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 22:57:04,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:04,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:04,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:57:04,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:57:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 26 proven. 78 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 22:57:04,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:57:06,928 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:57:06,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121853332] [2025-03-03 22:57:06,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121853332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:57:06,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2070354954] [2025-03-03 22:57:06,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:06,928 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 22:57:06,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 22:57:06,930 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 22:57:06,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-03 22:57:06,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 22:57:08,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 22:57:08,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:08,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:08,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 22:57:08,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:57:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 26 proven. 78 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 22:57:09,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:57:09,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2070354954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:57:09,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:57:09,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2025-03-03 22:57:09,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124871930] [2025-03-03 22:57:09,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:57:09,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:57:09,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:57:09,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:57:09,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:57:09,970 INFO L87 Difference]: Start difference. First operand 256 states and 333 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 22:57:15,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:57:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:57:15,512 INFO L93 Difference]: Finished difference Result 515 states and 666 transitions. [2025-03-03 22:57:15,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:57:15,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 179 [2025-03-03 22:57:15,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:57:15,515 INFO L225 Difference]: With dead ends: 515 [2025-03-03 22:57:15,516 INFO L226 Difference]: Without dead ends: 262 [2025-03-03 22:57:15,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:57:15,518 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 109 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:57:15,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 253 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-03 22:57:15,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-03 22:57:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2025-03-03 22:57:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 188 states have (on average 1.2287234042553192) internal successors, (231), 191 states have internal predecessors, (231), 48 states have call successors, (48), 17 states have call predecessors, (48), 17 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 22:57:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 327 transitions. [2025-03-03 22:57:15,539 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 327 transitions. Word has length 179 [2025-03-03 22:57:15,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:57:15,539 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 327 transitions. [2025-03-03 22:57:15,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 22:57:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 327 transitions. [2025-03-03 22:57:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 22:57:15,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:57:15,542 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:15,556 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 (9)] Ended with exit code 0 [2025-03-03 22:57:15,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-03 22:57:15,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 22:57:15,943 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:57:15,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:57:15,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1035180459, now seen corresponding path program 1 times [2025-03-03 22:57:15,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:57:15,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525235261] [2025-03-03 22:57:15,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:57:15,944 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:57:15,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:57:15,946 INFO L229 MonitoredProcess]: Starting monitored process 11 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:57:15,947 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 (11)] Waiting until timeout for monitored process [2025-03-03 22:57:15,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 22:57:16,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 22:57:16,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:57:16,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:57:16,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 22:57:16,214 INFO L279 TraceCheckSpWp]: Computing forward predicates...