./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-nonlinear/color-magicseries1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/floats-nonlinear/color-magicseries1.c -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 ed08e3e430a48521ba795584cfce2de85e65f555827f53c3b3ed6292e2b0c1a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:28:25,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:28:25,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:28:25,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:28:25,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:28:25,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:28:25,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:28:25,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:28:25,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:28:25,621 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:28:25,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:28:25,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:28:25,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:28:25,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:28:25,622 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:28:25,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:28:25,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:28:25,622 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:28:25,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:28:25,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:28:25,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:28:25,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:28:25,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:28:25,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:28:25,623 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:28:25,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:28:25,623 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:28:25,623 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:28:25,623 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:28:25,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:28:25,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:28:25,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:28:25,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:28:25,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:28:25,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:28:25,624 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:28:25,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:28:25,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:28:25,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:28:25,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:28:25,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:28:25,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:28:25,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:28:25,625 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 -> ed08e3e430a48521ba795584cfce2de85e65f555827f53c3b3ed6292e2b0c1a1 [2025-02-05 14:28:25,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:28:25,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:28:25,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:28:25,830 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:28:25,830 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:28:25,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/color-magicseries1.c [2025-02-05 14:28:27,055 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee5b48f5a/d10a807468d84d789626c2da8047ff8a/FLAG429aefda3 [2025-02-05 14:28:27,267 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:28:27,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-magicseries1.c [2025-02-05 14:28:27,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee5b48f5a/d10a807468d84d789626c2da8047ff8a/FLAG429aefda3 [2025-02-05 14:28:27,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee5b48f5a/d10a807468d84d789626c2da8047ff8a [2025-02-05 14:28:27,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:28:27,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:28:27,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:28:27,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:28:27,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:28:27,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:28:27" (1/1) ... [2025-02-05 14:28:27,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74aa84db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:27, skipping insertion in model container [2025-02-05 14:28:27,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:28:27" (1/1) ... [2025-02-05 14:28:27,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:28:27,421 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/floats-nonlinear/color-magicseries1.c[619,632] [2025-02-05 14:28:27,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:28:27,444 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:28:27,452 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/floats-nonlinear/color-magicseries1.c[619,632] [2025-02-05 14:28:27,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:28:27,466 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:28:27,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:27 WrapperNode [2025-02-05 14:28:27,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:28:27,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:28:27,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:28:27,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:28:27,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:27" (1/1) ... [2025-02-05 14:28:27,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:27" (1/1) ... [2025-02-05 14:28:27,490 INFO L138 Inliner]: procedures = 20, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2025-02-05 14:28:27,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:28:27,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:28:27,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:28:27,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:28:27,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:27" (1/1) ... [2025-02-05 14:28:27,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:27" (1/1) ... [2025-02-05 14:28:27,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:27" (1/1) ... [2025-02-05 14:28:27,511 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2025-02-05 14:28:27,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:27" (1/1) ... [2025-02-05 14:28:27,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:27" (1/1) ... [2025-02-05 14:28:27,515 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:27" (1/1) ... [2025-02-05 14:28:27,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:27" (1/1) ... [2025-02-05 14:28:27,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:27" (1/1) ... [2025-02-05 14:28:27,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:27" (1/1) ... [2025-02-05 14:28:27,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:28:27,518 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:28:27,518 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:28:27,518 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:28:27,519 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:27" (1/1) ... [2025-02-05 14:28:27,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:28:27,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:28:27,542 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-02-05 14:28:27,544 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-02-05 14:28:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:28:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:28:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:28:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 14:28:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-05 14:28:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-05 14:28:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2025-02-05 14:28:27,559 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2025-02-05 14:28:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:28:27,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:28:27,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-05 14:28:27,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-05 14:28:27,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:28:27,612 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:28:27,614 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:28:27,779 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L33: call ULTIMATE.dealloc(check_sum_~#s~0#1.base, check_sum_~#s~0#1.offset);havoc check_sum_~#s~0#1.base, check_sum_~#s~0#1.offset; [2025-02-05 14:28:27,800 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-02-05 14:28:27,801 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:28:27,810 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:28:27,810 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:28:27,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:28:27 BoogieIcfgContainer [2025-02-05 14:28:27,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:28:27,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:28:27,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:28:27,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:28:27,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:28:27" (1/3) ... [2025-02-05 14:28:27,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7b9686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:28:27, skipping insertion in model container [2025-02-05 14:28:27,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:27" (2/3) ... [2025-02-05 14:28:27,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7b9686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:28:27, skipping insertion in model container [2025-02-05 14:28:27,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:28:27" (3/3) ... [2025-02-05 14:28:27,819 INFO L128 eAbstractionObserver]: Analyzing ICFG color-magicseries1.c [2025-02-05 14:28:27,832 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:28:27,833 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG color-magicseries1.c that has 2 procedures, 35 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 14:28:27,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:28:27,887 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;@367c500d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:28:27,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:28:27,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 14:28:27,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 14:28:27,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:27,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:27,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:27,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:27,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1587571067, now seen corresponding path program 1 times [2025-02-05 14:28:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:27,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207170321] [2025-02-05 14:28:27,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:27,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:27,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 14:28:27,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 14:28:27,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:27,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:28:28,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:28,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207170321] [2025-02-05 14:28:28,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207170321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:28,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:28,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:28:28,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898788343] [2025-02-05 14:28:28,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:28,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:28:28,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:28,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:28:28,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:28:28,096 INFO L87 Difference]: Start difference. First operand has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:28:28,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:28,141 INFO L93 Difference]: Finished difference Result 67 states and 94 transitions. [2025-02-05 14:28:28,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:28:28,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-02-05 14:28:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:28,146 INFO L225 Difference]: With dead ends: 67 [2025-02-05 14:28:28,147 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 14:28:28,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:28:28,150 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:28,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:28,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 14:28:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-05 14:28:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-05 14:28:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2025-02-05 14:28:28,174 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 17 [2025-02-05 14:28:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:28,177 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2025-02-05 14:28:28,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:28:28,177 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2025-02-05 14:28:28,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 14:28:28,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:28,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:28,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:28:28,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:28,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:28,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1000765053, now seen corresponding path program 1 times [2025-02-05 14:28:28,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:28,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17784444] [2025-02-05 14:28:28,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:28,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:28,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 14:28:28,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 14:28:28,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:28,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:28:28,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:28,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17784444] [2025-02-05 14:28:28,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17784444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:28,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:28,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:28:28,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203258033] [2025-02-05 14:28:28,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:28,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:28:28,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:28,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:28:28,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:28,332 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:28:28,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:28,351 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2025-02-05 14:28:28,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:28:28,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-02-05 14:28:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:28,352 INFO L225 Difference]: With dead ends: 39 [2025-02-05 14:28:28,352 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 14:28:28,353 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-02-05 14:28:28,353 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:28,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 14:28:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-05 14:28:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-05 14:28:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2025-02-05 14:28:28,358 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 17 [2025-02-05 14:28:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:28,358 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2025-02-05 14:28:28,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:28:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2025-02-05 14:28:28,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 14:28:28,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:28,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:28,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:28:28,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:28,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:28,359 INFO L85 PathProgramCache]: Analyzing trace with hash 884345672, now seen corresponding path program 1 times [2025-02-05 14:28:28,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:28,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638340606] [2025-02-05 14:28:28,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:28,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:28,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 14:28:28,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 14:28:28,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:28,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:28:28,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:28,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638340606] [2025-02-05 14:28:28,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638340606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:28,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:28,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:28:28,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069886075] [2025-02-05 14:28:28,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:28,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:28:28,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:28,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:28:28,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:28:28,406 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:28:28,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:28,421 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2025-02-05 14:28:28,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:28:28,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-02-05 14:28:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:28,422 INFO L225 Difference]: With dead ends: 47 [2025-02-05 14:28:28,422 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 14:28:28,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:28:28,423 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:28,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:28,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 14:28:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-05 14:28:28,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-05 14:28:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2025-02-05 14:28:28,427 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 20 [2025-02-05 14:28:28,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:28,427 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2025-02-05 14:28:28,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:28:28,428 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2025-02-05 14:28:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:28:28,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:28,428 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:28,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:28:28,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:28,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:28,429 INFO L85 PathProgramCache]: Analyzing trace with hash 687234605, now seen corresponding path program 1 times [2025-02-05 14:28:28,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:28,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35506050] [2025-02-05 14:28:28,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:28,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:28,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:28:28,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:28:28,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:28,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:28:28,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:28,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35506050] [2025-02-05 14:28:28,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35506050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:28,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:28,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:28:28,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140731281] [2025-02-05 14:28:28,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:28,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:28:28,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:28,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:28:28,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:28,492 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:28:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:28,509 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2025-02-05 14:28:28,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:28:28,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-02-05 14:28:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:28,510 INFO L225 Difference]: With dead ends: 57 [2025-02-05 14:28:28,510 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 14:28:28,510 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-02-05 14:28:28,511 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:28,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:28,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 14:28:28,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-05 14:28:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-05 14:28:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-02-05 14:28:28,515 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 26 [2025-02-05 14:28:28,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:28,515 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-02-05 14:28:28,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:28:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-02-05 14:28:28,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 14:28:28,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:28,516 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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-02-05 14:28:28,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 14:28:28,516 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:28,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash 538012977, now seen corresponding path program 1 times [2025-02-05 14:28:28,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:28,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350523731] [2025-02-05 14:28:28,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:28,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:28,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 14:28:28,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 14:28:28,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:28,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 14:28:28,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:28,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350523731] [2025-02-05 14:28:28,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350523731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:28,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:28,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:28:28,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520200287] [2025-02-05 14:28:28,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:28,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:28:28,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:28,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:28:28,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:28,571 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 14:28:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:28,606 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2025-02-05 14:28:28,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:28:28,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-02-05 14:28:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:28,607 INFO L225 Difference]: With dead ends: 61 [2025-02-05 14:28:28,607 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 14:28:28,608 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-02-05 14:28:28,608 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:28,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 14:28:28,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2025-02-05 14:28:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 14:28:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-02-05 14:28:28,612 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 32 [2025-02-05 14:28:28,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:28,612 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-02-05 14:28:28,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 14:28:28,612 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-02-05 14:28:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 14:28:28,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:28,613 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 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-02-05 14:28:28,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 14:28:28,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:28,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:28,613 INFO L85 PathProgramCache]: Analyzing trace with hash -265041386, now seen corresponding path program 1 times [2025-02-05 14:28:28,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:28,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013893821] [2025-02-05 14:28:28,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:28,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:28,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 14:28:28,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 14:28:28,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:28,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 14:28:28,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:28,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013893821] [2025-02-05 14:28:28,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013893821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:28,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:28,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:28:28,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952618555] [2025-02-05 14:28:28,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:28,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:28:28,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:28,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:28:28,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:28:28,659 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:28,669 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2025-02-05 14:28:28,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:28:28,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2025-02-05 14:28:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:28,670 INFO L225 Difference]: With dead ends: 43 [2025-02-05 14:28:28,671 INFO L226 Difference]: Without dead ends: 37 [2025-02-05 14:28:28,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:28:28,671 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:28,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 67 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:28,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-05 14:28:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2025-02-05 14:28:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 14:28:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-02-05 14:28:28,674 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 38 [2025-02-05 14:28:28,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:28,675 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-02-05 14:28:28,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-02-05 14:28:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 14:28:28,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:28,675 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 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-02-05 14:28:28,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 14:28:28,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:28,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash 349343950, now seen corresponding path program 1 times [2025-02-05 14:28:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:28,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893488608] [2025-02-05 14:28:28,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:28,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 14:28:28,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 14:28:28,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:28,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:28,717 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 14:28:28,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:28,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893488608] [2025-02-05 14:28:28,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893488608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:28,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:28,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:28:28,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123825720] [2025-02-05 14:28:28,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:28,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:28:28,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:28,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:28:28,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:28:28,718 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:28,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:28,728 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2025-02-05 14:28:28,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:28:28,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2025-02-05 14:28:28,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:28,729 INFO L225 Difference]: With dead ends: 46 [2025-02-05 14:28:28,729 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 14:28:28,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:28:28,730 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:28,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 68 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 14:28:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-02-05 14:28:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 14:28:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-02-05 14:28:28,733 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 40 [2025-02-05 14:28:28,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:28,733 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-02-05 14:28:28,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:28,733 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-02-05 14:28:28,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 14:28:28,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:28,734 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 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-02-05 14:28:28,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 14:28:28,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:28,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:28,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1996356345, now seen corresponding path program 1 times [2025-02-05 14:28:28,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:28,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471035873] [2025-02-05 14:28:28,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:28,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:28,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 14:28:28,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 14:28:28,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:28,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 14:28:28,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:28,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471035873] [2025-02-05 14:28:28,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471035873] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:28:28,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288522167] [2025-02-05 14:28:28,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:28,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:28:28,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:28:28,821 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-02-05 14:28:28,824 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-02-05 14:28:28,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 14:28:28,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 14:28:28,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:28,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:28,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 14:28:28,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:28:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 14:28:28,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:28:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 14:28:29,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288522167] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:28:29,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:28:29,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 14:28:29,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70256239] [2025-02-05 14:28:29,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:28:29,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:28:29,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:29,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:28:29,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:28:29,018 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:29,040 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2025-02-05 14:28:29,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:28:29,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2025-02-05 14:28:29,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:29,041 INFO L225 Difference]: With dead ends: 54 [2025-02-05 14:28:29,041 INFO L226 Difference]: Without dead ends: 42 [2025-02-05 14:28:29,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:28:29,042 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:29,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 164 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:29,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-05 14:28:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-05 14:28:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 14:28:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2025-02-05 14:28:29,045 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 43 [2025-02-05 14:28:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:29,046 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2025-02-05 14:28:29,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2025-02-05 14:28:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 14:28:29,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:29,047 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 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-02-05 14:28:29,055 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-02-05 14:28:29,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:28:29,248 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:29,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:29,248 INFO L85 PathProgramCache]: Analyzing trace with hash -306736882, now seen corresponding path program 2 times [2025-02-05 14:28:29,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:29,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042882476] [2025-02-05 14:28:29,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:28:29,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:29,260 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-02-05 14:28:29,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 52 statements. [2025-02-05 14:28:29,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 14:28:29,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 14:28:29,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:29,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042882476] [2025-02-05 14:28:29,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042882476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:29,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:29,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:28:29,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928084062] [2025-02-05 14:28:29,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:29,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:28:29,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:29,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:28:29,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:29,284 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:29,296 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2025-02-05 14:28:29,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:28:29,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2025-02-05 14:28:29,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:29,297 INFO L225 Difference]: With dead ends: 48 [2025-02-05 14:28:29,298 INFO L226 Difference]: Without dead ends: 42 [2025-02-05 14:28:29,299 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-02-05 14:28:29,299 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:29,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-05 14:28:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-05 14:28:29,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 14:28:29,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-02-05 14:28:29,304 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 52 [2025-02-05 14:28:29,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:29,305 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-02-05 14:28:29,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:29,305 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-02-05 14:28:29,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 14:28:29,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:29,308 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 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-02-05 14:28:29,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 14:28:29,308 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:29,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:29,308 INFO L85 PathProgramCache]: Analyzing trace with hash 944818174, now seen corresponding path program 1 times [2025-02-05 14:28:29,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:29,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106865272] [2025-02-05 14:28:29,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:29,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:29,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 14:28:29,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 14:28:29,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:29,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 14:28:29,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:29,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106865272] [2025-02-05 14:28:29,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106865272] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:28:29,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48499422] [2025-02-05 14:28:29,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:29,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:28:29,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:28:29,423 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-02-05 14:28:29,424 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-02-05 14:28:29,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 14:28:29,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 14:28:29,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:29,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:29,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 14:28:29,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:28:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 14:28:29,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:28:29,574 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 14:28:29,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48499422] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:28:29,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:28:29,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 14:28:29,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546881317] [2025-02-05 14:28:29,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:28:29,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:28:29,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:29,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:28:29,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:28:29,575 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:29,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:29,597 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2025-02-05 14:28:29,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:28:29,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2025-02-05 14:28:29,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:29,599 INFO L225 Difference]: With dead ends: 93 [2025-02-05 14:28:29,599 INFO L226 Difference]: Without dead ends: 87 [2025-02-05 14:28:29,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:28:29,599 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:29,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 104 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-05 14:28:29,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-05 14:28:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 81 states have (on average 1.271604938271605) internal successors, (103), 81 states have internal predecessors, (103), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 14:28:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2025-02-05 14:28:29,604 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 53 [2025-02-05 14:28:29,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:29,604 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2025-02-05 14:28:29,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2025-02-05 14:28:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 14:28:29,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:29,606 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 4, 4, 4, 4, 4, 4, 1, 1, 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-02-05 14:28:29,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 14:28:29,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:28:29,810 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:29,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:29,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1775726614, now seen corresponding path program 2 times [2025-02-05 14:28:29,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:29,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121424211] [2025-02-05 14:28:29,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:28:29,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:29,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 98 statements into 2 equivalence classes. [2025-02-05 14:28:29,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 14:28:29,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:28:29,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 14:28:29,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 14:28:29,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 14:28:29,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 14:28:29,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:29,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 14:28:29,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 14:28:29,906 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 14:28:29,906 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 14:28:29,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 14:28:29,911 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:29,937 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 14:28:29,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 02:28:29 BoogieIcfgContainer [2025-02-05 14:28:29,939 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 14:28:29,939 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 14:28:29,939 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 14:28:29,940 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 14:28:29,940 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:28:27" (3/4) ... [2025-02-05 14:28:29,941 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 14:28:29,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 14:28:29,942 INFO L158 Benchmark]: Toolchain (without parser) took 2632.27ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 87.8MB in the end (delta: 34.5MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2025-02-05 14:28:29,942 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 192.9MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:28:29,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.62ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 110.7MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:28:29,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.15ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 109.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:28:29,943 INFO L158 Benchmark]: Boogie Preprocessor took 26.44ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 107.6MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:28:29,943 INFO L158 Benchmark]: IcfgBuilder took 292.62ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 93.0MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:28:29,943 INFO L158 Benchmark]: TraceAbstraction took 2126.28ms. Allocated memory is still 167.8MB. Free memory was 92.4MB in the beginning and 87.8MB in the end (delta: 4.6MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2025-02-05 14:28:29,943 INFO L158 Benchmark]: Witness Printer took 2.45ms. Allocated memory is still 167.8MB. Free memory was 87.8MB in the beginning and 87.8MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:28:29,944 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.17ms. Allocated memory is still 192.9MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.62ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 110.7MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.15ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 109.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.44ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 107.6MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 292.62ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 93.0MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2126.28ms. Allocated memory is still 167.8MB. Free memory was 92.4MB in the beginning and 87.8MB in the end (delta: 4.6MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Witness Printer took 2.45ms. Allocated memory is still 167.8MB. Free memory was 87.8MB in the beginning and 87.8MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 20]: 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 someBinaryDOUBLEComparisonOperation at line 37, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryDOUBLEComparisonOperation at line 38. Possible FailurePath: [L56] double x, y, z, w; [L57] x = __VERIFIER_nondet_double() [L58] y = __VERIFIER_nondet_double() [L59] z = __VERIFIER_nondet_double() [L60] w = __VERIFIER_nondet_double() [L61] CALL, EXPR solve(x, y, z, w) [L44] CALL, EXPR check_domain(s0) VAL [\old(x)=56] [L28] COND TRUE x >= 0.0 && x <= 4.0 [L28] return 1; VAL [\old(x)=56, \result=1] [L44] RET, EXPR check_domain(s0) VAL [s0=56, s1=57, s2=55, s3=54] [L44] EXPR check_domain(s0) && check_domain(s1) VAL [s0=56, s1=57, s2=55, s3=54] [L44] CALL, EXPR check_domain(s1) VAL [\old(x)=57] [L28] COND TRUE x >= 0.0 && x <= 4.0 [L28] return 1; VAL [\old(x)=57, \result=1] [L44] RET, EXPR check_domain(s1) VAL [s0=56, s1=57, s2=55, s3=54] [L44] EXPR check_domain(s0) && check_domain(s1) VAL [s0=56, s1=57, s2=55, s3=54] [L44] EXPR check_domain(s0) && check_domain(s1) && check_domain(s2) VAL [s0=56, s1=57, s2=55, s3=54] [L44] CALL, EXPR check_domain(s2) VAL [\old(x)=55] [L28] COND TRUE x >= 0.0 && x <= 4.0 [L28] return 1; VAL [\old(x)=55, \result=1] [L44] RET, EXPR check_domain(s2) VAL [s0=56, s1=57, s2=55, s3=54] [L44] EXPR check_domain(s0) && check_domain(s1) && check_domain(s2) VAL [s0=56, s1=57, s2=55, s3=54] [L44-L45] check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) VAL [s0=56, s1=57, s2=55, s3=54] [L45] CALL, EXPR check_domain(s3) VAL [\old(x)=54] [L28] COND TRUE x >= 0.0 && x <= 4.0 [L28] return 1; VAL [\old(x)=54, \result=1] [L45] RET, EXPR check_domain(s3) VAL [s0=56, s1=57, s2=55, s3=54] [L44-L45] check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) VAL [s0=56, s1=57, s2=55, s3=54] [L44-L45] COND TRUE check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) [L46] CALL check_sum(s0, s1, s2, s3) [L33] double s[4] = {s0, s1, s2, s3}; [L33] double s[4] = {s0, s1, s2, s3}; [L33] double s[4] = {s0, s1, s2, s3}; [L33] double s[4] = {s0, s1, s2, s3}; [L33] double s[4] = {s0, s1, s2, s3}; [L34] int i = 0; VAL [i=0, s={4:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=0, j=0, s={4:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=0, j=0, s={4:0}, sum=1] [L36] j++ VAL [i=0, j=1, s={4:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=0, j=1, s={4:0}, sum=2] [L36] j++ VAL [i=0, j=2, s={4:0}, sum=2] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=0, j=2, s={4:0}, sum=3] [L36] j++ VAL [i=0, j=3, s={4:0}, sum=3] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=0, j=3, s={4:0}, sum=4] [L36] j++ VAL [i=0, j=4, s={4:0}, sum=4] [L36] COND FALSE !(j < 4) [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=1, s={4:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=1, j=0, s={4:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=1, j=0, s={4:0}, sum=1] [L36] j++ VAL [i=1, j=1, s={4:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=1, j=1, s={4:0}, sum=2] [L36] j++ VAL [i=1, j=2, s={4:0}, sum=2] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=1, j=2, s={4:0}, sum=3] [L36] j++ VAL [i=1, j=3, s={4:0}, sum=3] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=1, j=3, s={4:0}, sum=4] [L36] j++ VAL [i=1, j=4, s={4:0}, sum=4] [L36] COND FALSE !(j < 4) [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=2, s={4:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=2, j=0, s={4:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=2, j=0, s={4:0}, sum=1] [L36] j++ VAL [i=2, j=1, s={4:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=2, j=1, s={4:0}, sum=2] [L36] j++ VAL [i=2, j=2, s={4:0}, sum=2] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=2, j=2, s={4:0}, sum=3] [L36] j++ VAL [i=2, j=3, s={4:0}, sum=3] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=2, j=3, s={4:0}, sum=4] [L36] j++ VAL [i=2, j=4, s={4:0}, sum=4] [L36] COND FALSE !(j < 4) [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=3, s={4:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=3, j=0, s={4:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=3, j=0, s={4:0}, sum=1] [L36] j++ VAL [i=3, j=1, s={4:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=3, j=1, s={4:0}, sum=2] [L36] j++ VAL [i=3, j=2, s={4:0}, sum=2] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=3, j=2, s={4:0}, sum=3] [L36] j++ VAL [i=3, j=3, s={4:0}, sum=3] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=3, j=3, s={4:0}, sum=4] [L36] j++ VAL [i=3, j=4, s={4:0}, sum=4] [L36] COND FALSE !(j < 4) [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=4, s={4:0}] [L34] COND FALSE !(i < 4) [L40] return 1; [L33] double s[4] = {s0, s1, s2, s3}; [L40] return 1; VAL [\result=1] [L46] RET check_sum(s0, s1, s2, s3) [L46] COND TRUE check_sum(s0, s1, s2, s3) [L47] return 1; VAL [\result=1] [L61] RET, EXPR solve(x, y, z, w) [L61] CALL __VERIFIER_assert(!solve(x, y, z, w)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 11, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 1077 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 694 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 127 IncrementalHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 383 mSDtfsCounter, 127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=10, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 532 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 516 ConstructedInterpolants, 0 QuantifiedInterpolants, 660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 407 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 320/326 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-02-05 14:28:29,958 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/floats-nonlinear/color-magicseries1.c -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 ed08e3e430a48521ba795584cfce2de85e65f555827f53c3b3ed6292e2b0c1a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:28:32,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:28:32,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 14:28:32,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:28:32,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:28:32,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:28:32,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:28:32,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:28:32,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:28:32,145 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:28:32,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:28:32,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:28:32,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:28:32,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:28:32,146 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:28:32,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:28:32,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:28:32,147 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:28:32,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:28:32,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:28:32,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:28:32,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:28:32,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:28:32,148 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 14:28:32,148 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 14:28:32,148 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 14:28:32,148 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:28:32,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:28:32,148 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:28:32,148 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:28:32,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:28:32,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:28:32,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:28:32,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:28:32,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:28:32,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:28:32,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:28:32,149 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:28:32,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:28:32,149 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 14:28:32,149 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 14:28:32,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:28:32,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:28:32,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:28:32,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:28:32,149 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 -> ed08e3e430a48521ba795584cfce2de85e65f555827f53c3b3ed6292e2b0c1a1 [2025-02-05 14:28:32,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:28:32,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:28:32,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:28:32,398 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:28:32,398 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:28:32,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/color-magicseries1.c [2025-02-05 14:28:34,250 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4263b3c8d/bb6ee2a4bce94710ab953fae9963b9db/FLAGf00d4f77a [2025-02-05 14:28:34,447 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:28:34,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-magicseries1.c [2025-02-05 14:28:34,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4263b3c8d/bb6ee2a4bce94710ab953fae9963b9db/FLAGf00d4f77a [2025-02-05 14:28:34,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4263b3c8d/bb6ee2a4bce94710ab953fae9963b9db [2025-02-05 14:28:34,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:28:34,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:28:34,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:28:34,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:28:34,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:28:34,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:28:34" (1/1) ... [2025-02-05 14:28:34,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d192b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:34, skipping insertion in model container [2025-02-05 14:28:34,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:28:34" (1/1) ... [2025-02-05 14:28:34,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:28:34,594 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/floats-nonlinear/color-magicseries1.c[619,632] [2025-02-05 14:28:34,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:28:34,628 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:28:34,636 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/floats-nonlinear/color-magicseries1.c[619,632] [2025-02-05 14:28:34,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:28:34,666 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:28:34,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:34 WrapperNode [2025-02-05 14:28:34,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:28:34,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:28:34,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:28:34,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:28:34,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:34" (1/1) ... [2025-02-05 14:28:34,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:34" (1/1) ... [2025-02-05 14:28:34,700 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 122 [2025-02-05 14:28:34,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:28:34,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:28:34,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:28:34,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:28:34,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:34" (1/1) ... [2025-02-05 14:28:34,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:34" (1/1) ... [2025-02-05 14:28:34,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:34" (1/1) ... [2025-02-05 14:28:34,722 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2025-02-05 14:28:34,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:34" (1/1) ... [2025-02-05 14:28:34,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:34" (1/1) ... [2025-02-05 14:28:34,728 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:34" (1/1) ... [2025-02-05 14:28:34,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:34" (1/1) ... [2025-02-05 14:28:34,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:34" (1/1) ... [2025-02-05 14:28:34,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:34" (1/1) ... [2025-02-05 14:28:34,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:28:34,736 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:28:34,736 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:28:34,736 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:28:34,737 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:34" (1/1) ... [2025-02-05 14:28:34,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:28:34,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:28:34,768 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-02-05 14:28:34,774 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-02-05 14:28:34,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:28:34,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-05 14:28:34,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-05 14:28:34,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 14:28:34,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-05 14:28:34,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 14:28:34,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-05 14:28:34,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-05 14:28:34,795 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2025-02-05 14:28:34,795 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2025-02-05 14:28:34,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:28:34,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:28:34,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:28:34,853 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:28:34,855 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:28:35,275 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L33: call ULTIMATE.dealloc(check_sum_~#s~0#1.base, check_sum_~#s~0#1.offset);havoc check_sum_~#s~0#1.base, check_sum_~#s~0#1.offset; [2025-02-05 14:28:35,286 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-02-05 14:28:35,286 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:28:35,295 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:28:35,295 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:28:35,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:28:35 BoogieIcfgContainer [2025-02-05 14:28:35,295 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:28:35,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:28:35,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:28:35,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:28:35,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:28:34" (1/3) ... [2025-02-05 14:28:35,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172147b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:28:35, skipping insertion in model container [2025-02-05 14:28:35,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:34" (2/3) ... [2025-02-05 14:28:35,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172147b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:28:35, skipping insertion in model container [2025-02-05 14:28:35,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:28:35" (3/3) ... [2025-02-05 14:28:35,302 INFO L128 eAbstractionObserver]: Analyzing ICFG color-magicseries1.c [2025-02-05 14:28:35,311 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:28:35,312 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG color-magicseries1.c that has 2 procedures, 35 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 14:28:35,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:28:35,377 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;@f534da5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:28:35,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:28:35,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 14:28:35,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 14:28:35,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:35,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:35,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:35,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:35,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1587571067, now seen corresponding path program 1 times [2025-02-05 14:28:35,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:28:35,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667319608] [2025-02-05 14:28:35,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:35,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 14:28:35,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 14:28:35,421 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-02-05 14:28:35,422 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-02-05 14:28:35,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 14:28:35,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 14:28:35,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:35,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:35,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 14:28:35,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:28:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:28:35,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:28:35,588 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:28:35,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667319608] [2025-02-05 14:28:35,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667319608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:35,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:35,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:28:35,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269058686] [2025-02-05 14:28:35,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:35,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:28:35,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:28:35,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:28:35,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:28:35,607 INFO L87 Difference]: Start difference. First operand has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:28:36,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:36,024 INFO L93 Difference]: Finished difference Result 67 states and 94 transitions. [2025-02-05 14:28:36,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:28:36,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-02-05 14:28:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:36,030 INFO L225 Difference]: With dead ends: 67 [2025-02-05 14:28:36,030 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 14:28:36,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:28:36,033 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:36,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 14:28:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 14:28:36,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-05 14:28:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-05 14:28:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2025-02-05 14:28:36,060 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 17 [2025-02-05 14:28:36,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:36,060 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2025-02-05 14:28:36,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:28:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2025-02-05 14:28:36,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 14:28:36,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:36,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:36,067 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 (2)] Ended with exit code 0 [2025-02-05 14:28:36,264 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-02-05 14:28:36,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:36,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1000765053, now seen corresponding path program 1 times [2025-02-05 14:28:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:28:36,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925436993] [2025-02-05 14:28:36,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:36,266 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-02-05 14:28:36,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 14:28:36,267 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-02-05 14:28:36,271 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-02-05 14:28:36,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 14:28:36,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 14:28:36,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:36,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:36,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 14:28:36,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:28:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:28:36,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:28:36,329 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:28:36,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925436993] [2025-02-05 14:28:36,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925436993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:36,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:36,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:28:36,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105089193] [2025-02-05 14:28:36,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:36,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:28:36,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:28:36,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:28:36,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:36,331 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:28:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:36,348 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2025-02-05 14:28:36,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:28:36,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-02-05 14:28:36,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:36,349 INFO L225 Difference]: With dead ends: 39 [2025-02-05 14:28:36,349 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 14:28:36,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-02-05 14:28:36,350 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:36,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:36,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 14:28:36,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-05 14:28:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-05 14:28:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2025-02-05 14:28:36,354 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 17 [2025-02-05 14:28:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:36,354 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2025-02-05 14:28:36,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:28:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2025-02-05 14:28:36,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 14:28:36,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:36,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:36,359 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-02-05 14:28:36,558 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-02-05 14:28:36,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:36,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:36,559 INFO L85 PathProgramCache]: Analyzing trace with hash 884345672, now seen corresponding path program 1 times [2025-02-05 14:28:36,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:28:36,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266571518] [2025-02-05 14:28:36,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:36,560 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-02-05 14:28:36,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 14:28:36,563 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-02-05 14:28:36,564 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-02-05 14:28:36,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 14:28:36,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 14:28:36,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:36,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:36,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 14:28:36,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:28:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:28:36,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:28:36,693 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:28:36,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266571518] [2025-02-05 14:28:36,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266571518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:36,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:36,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 14:28:36,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666399923] [2025-02-05 14:28:36,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:36,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:28:36,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:28:36,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:28:36,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:28:36,695 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:28:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:36,798 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2025-02-05 14:28:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 14:28:36,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-02-05 14:28:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:36,802 INFO L225 Difference]: With dead ends: 68 [2025-02-05 14:28:36,802 INFO L226 Difference]: Without dead ends: 33 [2025-02-05 14:28:36,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:28:36,802 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:36,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:28:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-05 14:28:36,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-05 14:28:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 14:28:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2025-02-05 14:28:36,809 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 20 [2025-02-05 14:28:36,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:36,809 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-02-05 14:28:36,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:28:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2025-02-05 14:28:36,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 14:28:36,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:36,810 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 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-02-05 14:28:36,818 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-02-05 14:28:37,011 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-02-05 14:28:37,011 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:37,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:37,012 INFO L85 PathProgramCache]: Analyzing trace with hash -265041386, now seen corresponding path program 1 times [2025-02-05 14:28:37,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:28:37,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329773741] [2025-02-05 14:28:37,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:37,013 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-02-05 14:28:37,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 14:28:37,016 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-02-05 14:28:37,018 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-02-05 14:28:37,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 14:28:37,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 14:28:37,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:37,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:37,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 14:28:37,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:28:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 14:28:37,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:28:37,110 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:28:37,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329773741] [2025-02-05 14:28:37,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329773741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:37,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:37,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:28:37,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324517299] [2025-02-05 14:28:37,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:37,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:28:37,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:28:37,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:28:37,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:28:37,112 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:37,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:37,443 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2025-02-05 14:28:37,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:28:37,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2025-02-05 14:28:37,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:37,449 INFO L225 Difference]: With dead ends: 45 [2025-02-05 14:28:37,449 INFO L226 Difference]: Without dead ends: 39 [2025-02-05 14:28:37,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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-02-05 14:28:37,450 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:37,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 63 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 14:28:37,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-05 14:28:37,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2025-02-05 14:28:37,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 14:28:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2025-02-05 14:28:37,454 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 38 [2025-02-05 14:28:37,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:37,454 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2025-02-05 14:28:37,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2025-02-05 14:28:37,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 14:28:37,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:37,455 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 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-02-05 14:28:37,459 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 (5)] Ended with exit code 0 [2025-02-05 14:28:37,655 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-02-05 14:28:37,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:37,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:37,656 INFO L85 PathProgramCache]: Analyzing trace with hash 349343950, now seen corresponding path program 1 times [2025-02-05 14:28:37,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:28:37,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761531534] [2025-02-05 14:28:37,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:37,656 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-02-05 14:28:37,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 14:28:37,659 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-02-05 14:28:37,660 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-02-05 14:28:37,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 14:28:37,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 14:28:37,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:37,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:37,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 14:28:37,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:28:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 14:28:37,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:28:37,761 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:28:37,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761531534] [2025-02-05 14:28:37,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761531534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:37,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:37,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:28:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701533540] [2025-02-05 14:28:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:37,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:28:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:28:37,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:28:37,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:28:37,762 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:37,786 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2025-02-05 14:28:37,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:28:37,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2025-02-05 14:28:37,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:37,787 INFO L225 Difference]: With dead ends: 48 [2025-02-05 14:28:37,787 INFO L226 Difference]: Without dead ends: 37 [2025-02-05 14:28:37,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-02-05 14:28:37,788 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:37,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 68 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:37,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-05 14:28:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-02-05 14:28:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 14:28:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2025-02-05 14:28:37,792 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 40 [2025-02-05 14:28:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:37,792 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-02-05 14:28:37,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2025-02-05 14:28:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 14:28:37,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:37,793 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 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-02-05 14:28:37,801 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-02-05 14:28:37,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-02-05 14:28:37,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:37,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:37,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1996356345, now seen corresponding path program 1 times [2025-02-05 14:28:37,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:28:37,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487371165] [2025-02-05 14:28:37,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:37,995 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-02-05 14:28:37,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 14:28:37,998 INFO L229 MonitoredProcess]: Starting monitored process 7 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-02-05 14:28:37,998 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 (7)] Waiting until timeout for monitored process [2025-02-05 14:28:38,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 14:28:38,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 14:28:38,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:38,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:38,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 14:28:38,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:28:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 14:28:38,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:28:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 14:28:38,157 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:28:38,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487371165] [2025-02-05 14:28:38,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487371165] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:28:38,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:28:38,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-02-05 14:28:38,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051958936] [2025-02-05 14:28:38,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:28:38,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 14:28:38,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:28:38,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 14:28:38,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:28:38,158 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:38,221 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2025-02-05 14:28:38,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:28:38,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2025-02-05 14:28:38,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:38,222 INFO L225 Difference]: With dead ends: 56 [2025-02-05 14:28:38,222 INFO L226 Difference]: Without dead ends: 44 [2025-02-05 14:28:38,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:28:38,223 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:38,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 104 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-05 14:28:38,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-05 14:28:38,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 14:28:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2025-02-05 14:28:38,227 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 43 [2025-02-05 14:28:38,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:38,227 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2025-02-05 14:28:38,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2025-02-05 14:28:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 14:28:38,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:38,228 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 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-02-05 14:28:38,235 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 (7)] Ended with exit code 0 [2025-02-05 14:28:38,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-02-05 14:28:38,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:38,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:38,432 INFO L85 PathProgramCache]: Analyzing trace with hash -306736882, now seen corresponding path program 2 times [2025-02-05 14:28:38,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:28:38,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100670436] [2025-02-05 14:28:38,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:28:38,433 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-02-05 14:28:38,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 14:28:38,436 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-02-05 14:28:38,437 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-02-05 14:28:38,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-02-05 14:28:38,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 52 statements. [2025-02-05 14:28:38,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 14:28:38,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:38,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 14:28:38,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:28:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 14:28:38,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:28:38,572 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:28:38,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100670436] [2025-02-05 14:28:38,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100670436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:38,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:38,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:28:38,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67085140] [2025-02-05 14:28:38,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:38,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:28:38,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:28:38,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:28:38,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:38,576 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:38,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:38,679 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2025-02-05 14:28:38,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:28:38,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2025-02-05 14:28:38,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:38,681 INFO L225 Difference]: With dead ends: 50 [2025-02-05 14:28:38,682 INFO L226 Difference]: Without dead ends: 44 [2025-02-05 14:28:38,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 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-02-05 14:28:38,682 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:38,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:28:38,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-05 14:28:38,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-05 14:28:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 38 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 14:28:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2025-02-05 14:28:38,688 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 52 [2025-02-05 14:28:38,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:38,688 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2025-02-05 14:28:38,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:28:38,688 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2025-02-05 14:28:38,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 14:28:38,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:38,689 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 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-02-05 14:28:38,696 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 (8)] Ended with exit code 0 [2025-02-05 14:28:38,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-02-05 14:28:38,890 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:38,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:38,890 INFO L85 PathProgramCache]: Analyzing trace with hash 944818174, now seen corresponding path program 1 times [2025-02-05 14:28:38,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:28:38,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750173878] [2025-02-05 14:28:38,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:38,891 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-02-05 14:28:38,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 14:28:38,893 INFO L229 MonitoredProcess]: Starting monitored process 9 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-02-05 14:28:38,894 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 (9)] Waiting until timeout for monitored process [2025-02-05 14:28:38,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 14:28:39,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 14:28:39,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:39,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:39,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 14:28:39,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:28:39,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:28:39,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 33 [2025-02-05 14:28:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 14:28:39,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:29:04,073 WARN L286 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 28 DAG size of output: 17 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-02-05 14:29:04,073 INFO L349 Elim1Store]: treesize reduction 28, result has 47.2 percent of original size [2025-02-05 14:29:04,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 63 [2025-02-05 14:29:29,058 WARN L286 SmtUtils]: Spent 7.41s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-05 14:29:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 14:29:52,113 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:29:52,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750173878] [2025-02-05 14:29:52,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750173878] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:29:52,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:29:52,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-02-05 14:29:52,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020135096] [2025-02-05 14:29:52,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:29:52,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 14:29:52,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:29:52,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 14:29:52,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=235, Unknown=2, NotChecked=0, Total=306 [2025-02-05 14:29:52,114 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:29:56,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []