./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 7aa3a904bc60f2a44dbd946a0bac28cae5735c78d2e315e46c1ea5e4f1be7712 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:59:08,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:59:08,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:59:08,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:59:08,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:59:08,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:59:08,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:59:08,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:59:08,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:59:08,498 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:59:08,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:59:08,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:59:08,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:59:08,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:59:08,500 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:59:08,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:59:08,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:59:08,500 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:59:08,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:59:08,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:59:08,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:59:08,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:59:08,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:59:08,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:59:08,501 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:59:08,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:59:08,501 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:59:08,501 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:59:08,501 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:59:08,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:59:08,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:59:08,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:59:08,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:59:08,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:59:08,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:59:08,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:59:08,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:59:08,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:59:08,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:59:08,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:59:08,502 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:59:08,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:59:08,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:59:08,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:59:08,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:59:08,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:59:08,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:59:08,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:59:08,503 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-jdk21/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 -> 7aa3a904bc60f2a44dbd946a0bac28cae5735c78d2e315e46c1ea5e4f1be7712 [2025-01-09 13:59:08,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:59:08,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:59:08,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:59:08,729 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:59:08,730 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:59:08,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i [2025-01-09 13:59:09,833 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64960f045/90df4254e2c746338c0e0cf689228679/FLAG993227f6c [2025-01-09 13:59:10,117 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:59:10,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i [2025-01-09 13:59:10,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64960f045/90df4254e2c746338c0e0cf689228679/FLAG993227f6c [2025-01-09 13:59:10,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64960f045/90df4254e2c746338c0e0cf689228679 [2025-01-09 13:59:10,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:59:10,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:59:10,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:59:10,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:59:10,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:59:10,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:59:10" (1/1) ... [2025-01-09 13:59:10,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e7d3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:10, skipping insertion in model container [2025-01-09 13:59:10,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:59:10" (1/1) ... [2025-01-09 13:59:10,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:59:10,497 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i[915,928] [2025-01-09 13:59:10,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:59:10,577 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:59:10,590 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i[915,928] [2025-01-09 13:59:10,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:59:10,630 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:59:10,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:10 WrapperNode [2025-01-09 13:59:10,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:59:10,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:59:10,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:59:10,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:59:10,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:10" (1/1) ... [2025-01-09 13:59:10,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:10" (1/1) ... [2025-01-09 13:59:10,693 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2025-01-09 13:59:10,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:59:10,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:59:10,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:59:10,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:59:10,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:10" (1/1) ... [2025-01-09 13:59:10,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:10" (1/1) ... [2025-01-09 13:59:10,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:10" (1/1) ... [2025-01-09 13:59:10,733 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-01-09 13:59:10,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:10" (1/1) ... [2025-01-09 13:59:10,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:10" (1/1) ... [2025-01-09 13:59:10,746 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:10" (1/1) ... [2025-01-09 13:59:10,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:10" (1/1) ... [2025-01-09 13:59:10,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:10" (1/1) ... [2025-01-09 13:59:10,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:10" (1/1) ... [2025-01-09 13:59:10,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:10" (1/1) ... [2025-01-09 13:59:10,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:59:10,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:59:10,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:59:10,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:59:10,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:10" (1/1) ... [2025-01-09 13:59:10,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:59:10,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:59:10,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:59:10,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:59:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:59:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:59:10,819 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:59:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:59:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:59:10,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:59:10,875 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:59:10,876 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:59:11,173 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 13:59:11,173 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:59:11,179 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:59:11,179 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:59:11,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:59:11 BoogieIcfgContainer [2025-01-09 13:59:11,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:59:11,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:59:11,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:59:11,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:59:11,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:59:10" (1/3) ... [2025-01-09 13:59:11,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320fad9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:59:11, skipping insertion in model container [2025-01-09 13:59:11,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:10" (2/3) ... [2025-01-09 13:59:11,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320fad9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:59:11, skipping insertion in model container [2025-01-09 13:59:11,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:59:11" (3/3) ... [2025-01-09 13:59:11,187 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-78.i [2025-01-09 13:59:11,196 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:59:11,199 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-78.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:59:11,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:59:11,253 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;@357fe3f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:59:11,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:59:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:59:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 13:59:11,264 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:11,265 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:59:11,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:11,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:11,269 INFO L85 PathProgramCache]: Analyzing trace with hash -713521469, now seen corresponding path program 1 times [2025-01-09 13:59:11,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:59:11,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773688149] [2025-01-09 13:59:11,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:11,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:59:11,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 13:59:11,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 13:59:11,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:11,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 13:59:11,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:59:11,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773688149] [2025-01-09 13:59:11,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773688149] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:59:11,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102317272] [2025-01-09 13:59:11,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:11,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:59:11,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:59:11,525 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:59:11,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 13:59:11,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 13:59:11,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 13:59:11,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:11,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:11,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:59:11,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:59:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 13:59:11,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:59:11,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102317272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:59:11,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:59:11,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:59:11,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745902262] [2025-01-09 13:59:11,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:59:11,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:59:11,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:59:11,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:59:11,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:59:11,657 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:59:11,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:59:11,671 INFO L93 Difference]: Finished difference Result 148 states and 243 transitions. [2025-01-09 13:59:11,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:59:11,673 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2025-01-09 13:59:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:59:11,677 INFO L225 Difference]: With dead ends: 148 [2025-01-09 13:59:11,677 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 13:59:11,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-01-09 13:59:11,681 INFO L435 NwaCegarLoop]: 110 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, 110 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-01-09 13:59:11,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:59:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 13:59:11,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-09 13:59:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:59:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 110 transitions. [2025-01-09 13:59:11,713 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 110 transitions. Word has length 124 [2025-01-09 13:59:11,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:59:11,713 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 110 transitions. [2025-01-09 13:59:11,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:59:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 110 transitions. [2025-01-09 13:59:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 13:59:11,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:11,715 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:59:11,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 13:59:11,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:59:11,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:11,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:11,922 INFO L85 PathProgramCache]: Analyzing trace with hash 647173327, now seen corresponding path program 1 times [2025-01-09 13:59:11,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:59:11,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360931283] [2025-01-09 13:59:11,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:11,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:59:11,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 13:59:11,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 13:59:11,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:11,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:59:12,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:59:12,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360931283] [2025-01-09 13:59:12,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360931283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:59:12,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:59:12,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:59:12,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528834829] [2025-01-09 13:59:12,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:59:12,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:59:12,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:59:12,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:59:12,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:59:12,188 INFO L87 Difference]: Start difference. First operand 74 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:12,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:59:12,215 INFO L93 Difference]: Finished difference Result 145 states and 217 transitions. [2025-01-09 13:59:12,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:59:12,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2025-01-09 13:59:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:59:12,216 INFO L225 Difference]: With dead ends: 145 [2025-01-09 13:59:12,216 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 13:59:12,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:59:12,217 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:59:12,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:59:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 13:59:12,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-09 13:59:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:59:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2025-01-09 13:59:12,230 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 124 [2025-01-09 13:59:12,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:59:12,232 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2025-01-09 13:59:12,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2025-01-09 13:59:12,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 13:59:12,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:12,233 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:59:12,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:59:12,234 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:12,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:12,234 INFO L85 PathProgramCache]: Analyzing trace with hash 81621033, now seen corresponding path program 1 times [2025-01-09 13:59:12,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:59:12,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110647308] [2025-01-09 13:59:12,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:12,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:59:12,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 13:59:12,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 13:59:12,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:12,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:59:12,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:59:12,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110647308] [2025-01-09 13:59:12,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110647308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:59:12,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:59:12,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:59:12,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529639699] [2025-01-09 13:59:12,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:59:12,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:59:12,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:59:12,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:59:12,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:59:12,408 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:12,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:59:12,567 INFO L93 Difference]: Finished difference Result 217 states and 322 transitions. [2025-01-09 13:59:12,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:59:12,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2025-01-09 13:59:12,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:59:12,569 INFO L225 Difference]: With dead ends: 217 [2025-01-09 13:59:12,569 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 13:59:12,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-01-09 13:59:12,570 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 84 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:59:12,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 284 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:59:12,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 13:59:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 129. [2025-01-09 13:59:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 13:59:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 192 transitions. [2025-01-09 13:59:12,595 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 192 transitions. Word has length 125 [2025-01-09 13:59:12,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:59:12,595 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 192 transitions. [2025-01-09 13:59:12,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2025-01-09 13:59:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 13:59:12,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:12,598 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:59:12,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:59:12,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:12,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:12,600 INFO L85 PathProgramCache]: Analyzing trace with hash -497696005, now seen corresponding path program 1 times [2025-01-09 13:59:12,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:59:12,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573631533] [2025-01-09 13:59:12,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:12,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:59:12,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 13:59:12,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 13:59:12,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:12,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:12,803 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:59:12,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:59:12,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573631533] [2025-01-09 13:59:12,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573631533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:59:12,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:59:12,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:59:12,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201236544] [2025-01-09 13:59:12,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:59:12,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:59:12,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:59:12,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:59:12,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:59:12,809 INFO L87 Difference]: Start difference. First operand 129 states and 192 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:59:12,935 INFO L93 Difference]: Finished difference Result 309 states and 458 transitions. [2025-01-09 13:59:12,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:59:12,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2025-01-09 13:59:12,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:59:12,940 INFO L225 Difference]: With dead ends: 309 [2025-01-09 13:59:12,941 INFO L226 Difference]: Without dead ends: 223 [2025-01-09 13:59:12,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-09 13:59:12,942 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 122 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:59:12,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 311 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:59:12,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-01-09 13:59:12,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 205. [2025-01-09 13:59:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 147 states have (on average 1.3333333333333333) internal successors, (196), 147 states have internal predecessors, (196), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 13:59:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 304 transitions. [2025-01-09 13:59:12,979 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 304 transitions. Word has length 126 [2025-01-09 13:59:12,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:59:12,980 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 304 transitions. [2025-01-09 13:59:12,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 304 transitions. [2025-01-09 13:59:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 13:59:12,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:12,983 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:59:12,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:59:12,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:12,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:12,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1967049468, now seen corresponding path program 1 times [2025-01-09 13:59:12,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:59:12,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119291225] [2025-01-09 13:59:12,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:12,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:59:12,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 13:59:13,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 13:59:13,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:13,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:59:13,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:59:13,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119291225] [2025-01-09 13:59:13,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119291225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:59:13,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:59:13,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:59:13,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573143547] [2025-01-09 13:59:13,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:59:13,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:59:13,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:59:13,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:59:13,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:59:13,237 INFO L87 Difference]: Start difference. First operand 205 states and 304 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:59:13,477 INFO L93 Difference]: Finished difference Result 582 states and 855 transitions. [2025-01-09 13:59:13,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 13:59:13,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2025-01-09 13:59:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:59:13,482 INFO L225 Difference]: With dead ends: 582 [2025-01-09 13:59:13,483 INFO L226 Difference]: Without dead ends: 431 [2025-01-09 13:59:13,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:59:13,484 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 265 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:59:13,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 621 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:59:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-01-09 13:59:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 365. [2025-01-09 13:59:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 269 states have (on average 1.3531598513011152) internal successors, (364), 269 states have internal predecessors, (364), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 13:59:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 544 transitions. [2025-01-09 13:59:13,541 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 544 transitions. Word has length 127 [2025-01-09 13:59:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:59:13,542 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 544 transitions. [2025-01-09 13:59:13,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 544 transitions. [2025-01-09 13:59:13,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 13:59:13,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:13,547 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:59:13,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:59:13,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:13,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:13,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1934890818, now seen corresponding path program 1 times [2025-01-09 13:59:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:59:13,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84019909] [2025-01-09 13:59:13,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:13,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:59:13,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 13:59:13,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 13:59:13,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:13,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:59:13,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:59:13,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84019909] [2025-01-09 13:59:13,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84019909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:59:13,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:59:13,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:59:13,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645196876] [2025-01-09 13:59:13,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:59:13,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:59:13,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:59:13,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:59:13,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:59:13,788 INFO L87 Difference]: Start difference. First operand 365 states and 544 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:13,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:59:13,919 INFO L93 Difference]: Finished difference Result 749 states and 1107 transitions. [2025-01-09 13:59:13,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:59:13,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2025-01-09 13:59:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:59:13,926 INFO L225 Difference]: With dead ends: 749 [2025-01-09 13:59:13,926 INFO L226 Difference]: Without dead ends: 427 [2025-01-09 13:59:13,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-01-09 13:59:13,927 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 76 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:59:13,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 284 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:59:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-01-09 13:59:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 373. [2025-01-09 13:59:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 277 states have (on average 1.339350180505415) internal successors, (371), 277 states have internal predecessors, (371), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 13:59:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 551 transitions. [2025-01-09 13:59:13,970 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 551 transitions. Word has length 127 [2025-01-09 13:59:13,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:59:13,970 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 551 transitions. [2025-01-09 13:59:13,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 551 transitions. [2025-01-09 13:59:13,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 13:59:13,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:13,971 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:59:13,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:59:13,972 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:13,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash 638356662, now seen corresponding path program 1 times [2025-01-09 13:59:13,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:59:13,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919446415] [2025-01-09 13:59:13,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:13,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:59:13,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 13:59:13,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 13:59:14,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:14,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:59:14,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:59:14,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919446415] [2025-01-09 13:59:14,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919446415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:59:14,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:59:14,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:59:14,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225717376] [2025-01-09 13:59:14,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:59:14,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:59:14,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:59:14,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:59:14,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:59:14,212 INFO L87 Difference]: Start difference. First operand 373 states and 551 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:59:14,401 INFO L93 Difference]: Finished difference Result 948 states and 1396 transitions. [2025-01-09 13:59:14,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:59:14,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 128 [2025-01-09 13:59:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:59:14,405 INFO L225 Difference]: With dead ends: 948 [2025-01-09 13:59:14,405 INFO L226 Difference]: Without dead ends: 614 [2025-01-09 13:59:14,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:59:14,406 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 127 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:59:14,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 447 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:59:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-01-09 13:59:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 526. [2025-01-09 13:59:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 392 states have (on average 1.336734693877551) internal successors, (524), 392 states have internal predecessors, (524), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 13:59:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 776 transitions. [2025-01-09 13:59:14,465 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 776 transitions. Word has length 128 [2025-01-09 13:59:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:59:14,466 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 776 transitions. [2025-01-09 13:59:14,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 776 transitions. [2025-01-09 13:59:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 13:59:14,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:14,467 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:59:14,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 13:59:14,467 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:14,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:14,468 INFO L85 PathProgramCache]: Analyzing trace with hash 857211380, now seen corresponding path program 1 times [2025-01-09 13:59:14,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:59:14,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169871974] [2025-01-09 13:59:14,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:14,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:59:14,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 13:59:14,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 13:59:14,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:14,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:59:14,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:59:14,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169871974] [2025-01-09 13:59:14,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169871974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:59:14,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:59:14,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:59:14,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650519183] [2025-01-09 13:59:14,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:59:14,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:59:14,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:59:14,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:59:14,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:59:14,644 INFO L87 Difference]: Start difference. First operand 526 states and 776 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:59:14,739 INFO L93 Difference]: Finished difference Result 1104 states and 1638 transitions. [2025-01-09 13:59:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:59:14,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 128 [2025-01-09 13:59:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:59:14,743 INFO L225 Difference]: With dead ends: 1104 [2025-01-09 13:59:14,743 INFO L226 Difference]: Without dead ends: 674 [2025-01-09 13:59:14,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:59:14,745 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 71 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:59:14,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 414 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:59:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-01-09 13:59:14,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 604. [2025-01-09 13:59:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 470 states have (on average 1.3425531914893618) internal successors, (631), 470 states have internal predecessors, (631), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 13:59:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 883 transitions. [2025-01-09 13:59:14,787 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 883 transitions. Word has length 128 [2025-01-09 13:59:14,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:59:14,788 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 883 transitions. [2025-01-09 13:59:14,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 883 transitions. [2025-01-09 13:59:14,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 13:59:14,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:14,789 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:59:14,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 13:59:14,789 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:14,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:14,790 INFO L85 PathProgramCache]: Analyzing trace with hash 273903692, now seen corresponding path program 1 times [2025-01-09 13:59:14,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:59:14,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417986692] [2025-01-09 13:59:14,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:14,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:59:14,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 13:59:14,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 13:59:14,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:14,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:59:14,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058506310] [2025-01-09 13:59:14,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:14,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:59:14,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:59:14,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:59:14,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 13:59:14,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 13:59:15,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 13:59:15,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:15,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:15,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 13:59:15,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:59:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-01-09 13:59:15,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:59:15,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:59:15,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417986692] [2025-01-09 13:59:15,908 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 13:59:15,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058506310] [2025-01-09 13:59:15,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058506310] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:59:15,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:59:15,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-01-09 13:59:15,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128245644] [2025-01-09 13:59:15,908 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 13:59:15,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 13:59:15,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:59:15,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 13:59:15,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:59:15,910 INFO L87 Difference]: Start difference. First operand 604 states and 883 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:59:16,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:59:16,297 INFO L93 Difference]: Finished difference Result 1461 states and 2091 transitions. [2025-01-09 13:59:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 13:59:16,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 133 [2025-01-09 13:59:16,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:59:16,302 INFO L225 Difference]: With dead ends: 1461 [2025-01-09 13:59:16,302 INFO L226 Difference]: Without dead ends: 1078 [2025-01-09 13:59:16,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2025-01-09 13:59:16,304 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 106 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:59:16,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 524 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:59:16,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2025-01-09 13:59:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1034. [2025-01-09 13:59:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 804 states have (on average 1.3258706467661692) internal successors, (1066), 808 states have internal predecessors, (1066), 206 states have call successors, (206), 23 states have call predecessors, (206), 23 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206) [2025-01-09 13:59:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1478 transitions. [2025-01-09 13:59:16,359 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1478 transitions. Word has length 133 [2025-01-09 13:59:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:59:16,359 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1478 transitions. [2025-01-09 13:59:16,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:59:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1478 transitions. [2025-01-09 13:59:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 13:59:16,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:16,360 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:59:16,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:59:16,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:59:16,565 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:16,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:16,566 INFO L85 PathProgramCache]: Analyzing trace with hash 736118920, now seen corresponding path program 1 times [2025-01-09 13:59:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:59:16,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469555257] [2025-01-09 13:59:16,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:16,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:59:16,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 13:59:16,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 13:59:16,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:16,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:59:16,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:59:16,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469555257] [2025-01-09 13:59:16,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469555257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:59:16,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:59:16,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:59:16,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446847419] [2025-01-09 13:59:16,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:59:16,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:59:16,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:59:16,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:59:16,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:59:16,692 INFO L87 Difference]: Start difference. First operand 1034 states and 1478 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:59:16,777 INFO L93 Difference]: Finished difference Result 1790 states and 2584 transitions. [2025-01-09 13:59:16,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:59:16,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2025-01-09 13:59:16,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:59:16,784 INFO L225 Difference]: With dead ends: 1790 [2025-01-09 13:59:16,785 INFO L226 Difference]: Without dead ends: 1375 [2025-01-09 13:59:16,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:59:16,787 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 69 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:59:16,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 325 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:59:16,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-01-09 13:59:16,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1037. [2025-01-09 13:59:16,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 807 states have (on average 1.3246592317224288) internal successors, (1069), 811 states have internal predecessors, (1069), 206 states have call successors, (206), 23 states have call predecessors, (206), 23 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206) [2025-01-09 13:59:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1481 transitions. [2025-01-09 13:59:16,868 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1481 transitions. Word has length 133 [2025-01-09 13:59:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:59:16,868 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1481 transitions. [2025-01-09 13:59:16,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1481 transitions. [2025-01-09 13:59:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 13:59:16,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:16,869 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:59:16,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 13:59:16,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:16,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:16,870 INFO L85 PathProgramCache]: Analyzing trace with hash -543744758, now seen corresponding path program 1 times [2025-01-09 13:59:16,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:59:16,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018026063] [2025-01-09 13:59:16,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:16,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:59:16,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 13:59:16,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 13:59:16,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:16,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:59:16,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1105235666] [2025-01-09 13:59:16,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:16,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:59:16,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:59:16,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:59:16,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 13:59:16,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 13:59:17,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 13:59:17,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:17,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:59:17,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:59:17,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 13:59:17,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 13:59:17,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:17,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:59:17,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:59:17,169 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:59:17,169 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:59:17,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 13:59:17,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:59:17,374 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:59:17,422 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:59:17,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:59:17 BoogieIcfgContainer [2025-01-09 13:59:17,424 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:59:17,424 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:59:17,424 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:59:17,425 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:59:17,425 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:59:11" (3/4) ... [2025-01-09 13:59:17,426 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:59:17,427 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:59:17,427 INFO L158 Benchmark]: Toolchain (without parser) took 7028.29ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.4MB in the beginning and 189.3MB in the end (delta: -84.0MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2025-01-09 13:59:17,428 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:59:17,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.26ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 89.9MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:59:17,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.41ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 83.4MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:59:17,428 INFO L158 Benchmark]: Boogie Preprocessor took 64.89ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 73.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:59:17,428 INFO L158 Benchmark]: RCFGBuilder took 420.56ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 42.4MB in the end (delta: 30.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 13:59:17,428 INFO L158 Benchmark]: TraceAbstraction took 6241.84ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 41.4MB in the beginning and 192.9MB in the end (delta: -151.4MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2025-01-09 13:59:17,429 INFO L158 Benchmark]: Witness Printer took 2.52ms. Allocated memory is still 318.8MB. Free memory was 192.9MB in the beginning and 189.3MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:59:17,430 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.61ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.26ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 89.9MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.41ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 83.4MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.89ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 73.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 420.56ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 42.4MB in the end (delta: 30.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6241.84ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 41.4MB in the beginning and 192.9MB in the end (delta: -151.4MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Witness Printer took 2.52ms. Allocated memory is still 318.8MB. Free memory was 192.9MB in the beginning and 189.3MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. 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 someBinaryArithmeticDOUBLEoperation at line 64, overapproximation of bitwiseOr at line 53, overapproximation of bitwiseOr at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char last_1_var_1_3 = 64; [L42] unsigned short int last_1_var_1_6 = 10; [L43] unsigned short int last_1_var_1_15 = 5; [L44] unsigned short int last_1_var_1_20 = 50; [L45] unsigned short int last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L123] isInitial = 1 [L124] FCALL initially() [L126] CALL updateLastVariables() [L112] last_1_var_1_3 = var_1_3 [L113] last_1_var_1_6 = var_1_6 [L114] last_1_var_1_15 = var_1_15 [L115] last_1_var_1_20 = var_1_20 [L116] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L126] RET updateLastVariables() [L127] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L83] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L83] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L84] var_1_5 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L86] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L86] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L87] var_1_9 = __VERIFIER_nondet_long() [L88] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L88] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L89] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L89] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L90] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L90] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L91] var_1_10 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L92] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L93] var_1_11 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L94] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L95] var_1_12 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L96] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L97] var_1_13 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L98] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L99] var_1_14 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L100] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L101] var_1_17 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L102] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L104] var_1_18 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L105] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L106] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L106] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L107] var_1_19 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L108] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L109] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L109] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L127] RET updateVariables() [L128] CALL step() [L49] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L50] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L53] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L53] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L54] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=197, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L55] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=197, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L58] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L62] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L63] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L64] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L70] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L71] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L72] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L73] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L73] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L76] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L77] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L119] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L119] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L119] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L119-L120] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 924 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 920 mSDsluCounter, 3633 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2495 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 760 IncrementalHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 1138 mSDtfsCounter, 760 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1037occurred in iteration=10, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 695 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1798 NumberOfCodeBlocks, 1798 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1388 ConstructedInterpolants, 0 QuantifiedInterpolants, 4092 SizeOfPredicates, 4 NumberOfNonLiveVariables, 635 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 6656/6732 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-01-09 13:59:17,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 7aa3a904bc60f2a44dbd946a0bac28cae5735c78d2e315e46c1ea5e4f1be7712 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:59:19,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:59:19,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:59:19,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:59:19,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:59:19,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:59:19,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:59:19,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:59:19,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:59:19,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:59:19,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:59:19,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:59:19,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:59:19,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:59:19,569 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:59:19,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:59:19,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:59:19,569 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:59:19,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:59:19,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:59:19,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:59:19,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:59:19,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:59:19,570 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:59:19,570 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:59:19,570 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:59:19,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:59:19,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:59:19,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:59:19,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:59:19,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:59:19,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:59:19,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:59:19,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:59:19,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:59:19,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:59:19,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:59:19,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:59:19,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:59:19,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:59:19,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:59:19,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:59:19,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:59:19,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:59:19,572 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:59:19,572 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:59:19,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:59:19,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:59:19,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:59:19,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:59:19,572 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-jdk21/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 -> 7aa3a904bc60f2a44dbd946a0bac28cae5735c78d2e315e46c1ea5e4f1be7712 [2025-01-09 13:59:19,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:59:19,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:59:19,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:59:19,816 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:59:19,816 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:59:19,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i [2025-01-09 13:59:21,077 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4c7c7d9f/7e14a8d229b54a0fa4025f69109aa71a/FLAGa24b0aa53 [2025-01-09 13:59:21,274 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:59:21,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i [2025-01-09 13:59:21,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4c7c7d9f/7e14a8d229b54a0fa4025f69109aa71a/FLAGa24b0aa53 [2025-01-09 13:59:21,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4c7c7d9f/7e14a8d229b54a0fa4025f69109aa71a [2025-01-09 13:59:21,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:59:21,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:59:21,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:59:21,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:59:21,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:59:21,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:59:21" (1/1) ... [2025-01-09 13:59:21,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2031bc04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:21, skipping insertion in model container [2025-01-09 13:59:21,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:59:21" (1/1) ... [2025-01-09 13:59:21,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:59:21,765 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i[915,928] [2025-01-09 13:59:21,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:59:21,818 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:59:21,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-78.i[915,928] [2025-01-09 13:59:21,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:59:21,873 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:59:21,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:21 WrapperNode [2025-01-09 13:59:21,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:59:21,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:59:21,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:59:21,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:59:21,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:21" (1/1) ... [2025-01-09 13:59:21,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:21" (1/1) ... [2025-01-09 13:59:21,918 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2025-01-09 13:59:21,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:59:21,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:59:21,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:59:21,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:59:21,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:21" (1/1) ... [2025-01-09 13:59:21,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:21" (1/1) ... [2025-01-09 13:59:21,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:21" (1/1) ... [2025-01-09 13:59:21,937 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-01-09 13:59:21,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:21" (1/1) ... [2025-01-09 13:59:21,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:21" (1/1) ... [2025-01-09 13:59:21,943 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:21" (1/1) ... [2025-01-09 13:59:21,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:21" (1/1) ... [2025-01-09 13:59:21,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:21" (1/1) ... [2025-01-09 13:59:21,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:21" (1/1) ... [2025-01-09 13:59:21,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:21" (1/1) ... [2025-01-09 13:59:21,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:59:21,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:59:21,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:59:21,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:59:21,960 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:21" (1/1) ... [2025-01-09 13:59:21,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:59:21,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:59:21,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:59:21,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:59:22,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:59:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:59:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:59:22,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:59:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:59:22,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:59:22,074 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:59:22,075 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:59:29,439 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 13:59:29,439 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:59:29,445 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:59:29,445 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:59:29,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:59:29 BoogieIcfgContainer [2025-01-09 13:59:29,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:59:29,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:59:29,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:59:29,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:59:29,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:59:21" (1/3) ... [2025-01-09 13:59:29,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188ccd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:59:29, skipping insertion in model container [2025-01-09 13:59:29,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:59:21" (2/3) ... [2025-01-09 13:59:29,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188ccd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:59:29, skipping insertion in model container [2025-01-09 13:59:29,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:59:29" (3/3) ... [2025-01-09 13:59:29,452 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-78.i [2025-01-09 13:59:29,461 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:59:29,462 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-78.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:59:29,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:59:29,517 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;@1f5d6b63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:59:29,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:59:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:59:29,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 13:59:29,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:29,531 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:59:29,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:29,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:29,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1711176539, now seen corresponding path program 1 times [2025-01-09 13:59:29,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:59:29,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056882034] [2025-01-09 13:59:29,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:29,545 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-01-09 13:59:29,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:59:29,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 13:59:29,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:59:29,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 13:59:29,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 13:59:29,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:29,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:29,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:59:29,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:59:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-01-09 13:59:30,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:59:30,017 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:59:30,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056882034] [2025-01-09 13:59:30,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056882034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:59:30,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:59:30,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:59:30,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196399386] [2025-01-09 13:59:30,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:59:30,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:59:30,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:59:30,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:59:30,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:59:30,037 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:59:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:59:30,058 INFO L93 Difference]: Finished difference Result 108 states and 179 transitions. [2025-01-09 13:59:30,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:59:30,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2025-01-09 13:59:30,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:59:30,064 INFO L225 Difference]: With dead ends: 108 [2025-01-09 13:59:30,064 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 13:59:30,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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-01-09 13:59:30,069 INFO L435 NwaCegarLoop]: 78 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, 78 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-01-09 13:59:30,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:59:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 13:59:30,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-01-09 13:59:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:59:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2025-01-09 13:59:30,103 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 118 [2025-01-09 13:59:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:59:30,104 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2025-01-09 13:59:30,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:59:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2025-01-09 13:59:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 13:59:30,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:30,107 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:59:30,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:59:30,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 13:59:30,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:30,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:30,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1030917041, now seen corresponding path program 1 times [2025-01-09 13:59:30,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:59:30,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019708284] [2025-01-09 13:59:30,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:30,313 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-01-09 13:59:30,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:59:30,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 13:59:30,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:59:30,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 13:59:30,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 13:59:30,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:30,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:30,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 13:59:30,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:59:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:59:31,626 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:59:31,626 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:59:31,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019708284] [2025-01-09 13:59:31,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019708284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:59:31,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:59:31,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:59:31,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168549223] [2025-01-09 13:59:31,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:59:31,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:59:31,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:59:31,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:59:31,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:59:31,629 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:36,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:59:38,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:59:42,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:59:43,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:59:47,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:59:47,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:59:47,352 INFO L93 Difference]: Finished difference Result 169 states and 245 transitions. [2025-01-09 13:59:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:59:47,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2025-01-09 13:59:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:59:47,386 INFO L225 Difference]: With dead ends: 169 [2025-01-09 13:59:47,386 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 13:59:47,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:59:47,387 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 60 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:59:47,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 268 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 69 Invalid, 2 Unknown, 0 Unchecked, 15.6s Time] [2025-01-09 13:59:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 13:59:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2025-01-09 13:59:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 13:59:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2025-01-09 13:59:47,429 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 118 [2025-01-09 13:59:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:59:47,430 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2025-01-09 13:59:47,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2025-01-09 13:59:47,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 13:59:47,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:47,432 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:59:47,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:59:47,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 13:59:47,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:47,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:47,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1289082479, now seen corresponding path program 1 times [2025-01-09 13:59:47,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:59:47,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039820378] [2025-01-09 13:59:47,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:47,642 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-01-09 13:59:47,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:59:47,645 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 13:59:47,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 13:59:47,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 13:59:47,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 13:59:47,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:47,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:47,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 13:59:47,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:59:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:59:47,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:59:47,980 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:59:47,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039820378] [2025-01-09 13:59:47,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039820378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:59:47,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:59:47,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:59:47,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836000137] [2025-01-09 13:59:47,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:59:47,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:59:47,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:59:47,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:59:47,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:59:47,981 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:52,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:59:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:59:52,133 INFO L93 Difference]: Finished difference Result 154 states and 226 transitions. [2025-01-09 13:59:52,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:59:52,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2025-01-09 13:59:52,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:59:52,165 INFO L225 Difference]: With dead ends: 154 [2025-01-09 13:59:52,165 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 13:59:52,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 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-01-09 13:59:52,166 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:59:52,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 13:59:52,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 13:59:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-09 13:59:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.203125) internal successors, (77), 64 states have internal predecessors, (77), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 13:59:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2025-01-09 13:59:52,175 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 118 [2025-01-09 13:59:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:59:52,175 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2025-01-09 13:59:52,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2025-01-09 13:59:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:59:52,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:59:52,177 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:59:52,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 13:59:52,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-01-09 13:59:52,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:59:52,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:59:52,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1717067720, now seen corresponding path program 1 times [2025-01-09 13:59:52,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:59:52,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997049122] [2025-01-09 13:59:52,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:59:52,379 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-01-09 13:59:52,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:59:52,381 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-01-09 13:59:52,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:59:52,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:59:52,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:59:52,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:59:52,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:59:52,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 13:59:52,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:59:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:59:53,846 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:59:53,846 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:59:53,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997049122] [2025-01-09 13:59:53,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997049122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:59:53,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:59:53,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:59:53,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984509841] [2025-01-09 13:59:53,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:59:53,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:59:53,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:59:53,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:59:53,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:59:53,847 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:59:56,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:59:58,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:00:02,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:00:04,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:00:07,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:00:09,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:00:13,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:00:16,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:00:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:00:16,388 INFO L93 Difference]: Finished difference Result 276 states and 396 transitions. [2025-01-09 14:00:16,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:00:16,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 14:00:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:00:16,427 INFO L225 Difference]: With dead ends: 276 [2025-01-09 14:00:16,430 INFO L226 Difference]: Without dead ends: 225 [2025-01-09 14:00:16,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:00:16,435 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 139 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:00:16,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 266 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 249 Invalid, 2 Unknown, 0 Unchecked, 22.4s Time] [2025-01-09 14:00:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-01-09 14:00:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 191. [2025-01-09 14:00:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 114 states have (on average 1.1754385964912282) internal successors, (134), 114 states have internal predecessors, (134), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 14:00:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 278 transitions. [2025-01-09 14:00:16,488 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 278 transitions. Word has length 119 [2025-01-09 14:00:16,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:00:16,489 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 278 transitions. [2025-01-09 14:00:16,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 14:00:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 278 transitions. [2025-01-09 14:00:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 14:00:16,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:00:16,490 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:00:16,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-01-09 14:00:16,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-01-09 14:00:16,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:00:16,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:00:16,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1659809418, now seen corresponding path program 1 times [2025-01-09 14:00:16,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:00:16,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731792587] [2025-01-09 14:00:16,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:00:16,692 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-01-09 14:00:16,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:00:16,699 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-01-09 14:00:16,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Waiting until timeout for monitored process [2025-01-09 14:00:16,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:00:17,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:00:17,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:00:17,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:00:17,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:00:17,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:00:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-01-09 14:00:18,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:00:20,620 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:00:20,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731792587] [2025-01-09 14:00:20,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731792587] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:00:20,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [310163280] [2025-01-09 14:00:20,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:00:20,621 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 14:00:20,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 14:00:20,623 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 14:00:20,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-01-09 14:00:20,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:00:21,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:00:21,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:00:21,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:00:21,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 14:00:21,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:00:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 14:00:22,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:00:22,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [310163280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:00:22,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:00:22,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-01-09 14:00:22,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42605642] [2025-01-09 14:00:22,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:00:22,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:00:22,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:00:22,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:00:22,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:00:22,340 INFO L87 Difference]: Start difference. First operand 191 states and 278 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 14:00:25,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:00:29,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:00:33,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:00:35,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:00:39,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:00:43,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:00:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:00:43,226 INFO L93 Difference]: Finished difference Result 386 states and 551 transitions. [2025-01-09 14:00:43,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:00:43,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 14:00:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:00:43,231 INFO L225 Difference]: With dead ends: 386 [2025-01-09 14:00:43,232 INFO L226 Difference]: Without dead ends: 286 [2025-01-09 14:00:43,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:00:43,233 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 45 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:00:43,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 197 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 3 Unknown, 0 Unchecked, 20.9s Time] [2025-01-09 14:00:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-01-09 14:00:43,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 280. [2025-01-09 14:00:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 177 states have (on average 1.192090395480226) internal successors, (211), 179 states have internal predecessors, (211), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 14:00:43,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 399 transitions. [2025-01-09 14:00:43,285 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 399 transitions. Word has length 119 [2025-01-09 14:00:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:00:43,286 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 399 transitions. [2025-01-09 14:00:43,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 14:00:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 399 transitions. [2025-01-09 14:00:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 14:00:43,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:00:43,288 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:00:43,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-01-09 14:00:43,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2025-01-09 14:00:43,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate-jdk21/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-01-09 14:00:43,691 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:00:43,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:00:43,692 INFO L85 PathProgramCache]: Analyzing trace with hash -2110094730, now seen corresponding path program 1 times [2025-01-09 14:00:43,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:00:43,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652663402] [2025-01-09 14:00:43,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:00:43,692 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-01-09 14:00:43,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:00:43,695 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/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-01-09 14:00:43,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 14:00:43,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:00:43,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:00:43,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:00:43,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:00:44,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 14:00:44,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:00:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 14:00:45,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:00:45,236 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:00:45,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652663402] [2025-01-09 14:00:45,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652663402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:00:45,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:00:45,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:00:45,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218660386] [2025-01-09 14:00:45,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:00:45,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:00:45,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:00:45,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:00:45,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:00:45,238 INFO L87 Difference]: Start difference. First operand 280 states and 399 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 14:00:47,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:00:51,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []