./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.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-sendmoremoney.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 3295093de4d211bffc15ed0a2994c81b442a590cdd92ae45e7cf4082ee88576f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:28:34,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:28:34,291 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:34,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:28:34,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:28:34,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:28:34,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:28:34,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:28:34,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:28:34,334 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:28:34,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:28:34,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:28:34,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:28:34,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:28:34,335 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:28:34,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:28:34,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:28:34,335 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:28:34,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:28:34,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:28:34,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:28:34,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:28:34,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:28:34,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:28:34,336 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:28:34,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:28:34,336 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:28:34,336 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:28:34,337 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:28:34,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:28:34,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:28:34,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:28:34,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:28:34,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:28:34,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:28:34,338 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:28:34,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:28:34,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:28:34,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:28:34,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:28:34,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:28:34,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:28:34,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:28:34,338 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 -> 3295093de4d211bffc15ed0a2994c81b442a590cdd92ae45e7cf4082ee88576f [2025-02-05 14:28:34,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:28:34,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:28:34,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:28:34,608 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:28:34,608 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:28:34,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c [2025-02-05 14:28:35,884 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09700a279/8b0e3d77dc374d4eacaa53b3900f944b/FLAG7920edcaf [2025-02-05 14:28:36,140 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:28:36,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c [2025-02-05 14:28:36,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09700a279/8b0e3d77dc374d4eacaa53b3900f944b/FLAG7920edcaf [2025-02-05 14:28:36,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09700a279/8b0e3d77dc374d4eacaa53b3900f944b [2025-02-05 14:28:36,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:28:36,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:28:36,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:28:36,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:28:36,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:28:36,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:28:36" (1/1) ... [2025-02-05 14:28:36,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c4c093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:36, skipping insertion in model container [2025-02-05 14:28:36,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:28:36" (1/1) ... [2025-02-05 14:28:36,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:28:36,565 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-sendmoremoney.c[620,633] [2025-02-05 14:28:36,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:28:36,602 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:28:36,609 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-sendmoremoney.c[620,633] [2025-02-05 14:28:36,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:28:36,635 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:28:36,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:36 WrapperNode [2025-02-05 14:28:36,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:28:36,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:28:36,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:28:36,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:28:36,642 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:36" (1/1) ... [2025-02-05 14:28:36,648 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:36" (1/1) ... [2025-02-05 14:28:36,663 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 188 [2025-02-05 14:28:36,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:28:36,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:28:36,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:28:36,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:28:36,671 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:36" (1/1) ... [2025-02-05 14:28:36,671 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:36" (1/1) ... [2025-02-05 14:28:36,674 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:36" (1/1) ... [2025-02-05 14:28:36,684 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-05 14:28:36,685 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:36" (1/1) ... [2025-02-05 14:28:36,685 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:36" (1/1) ... [2025-02-05 14:28:36,691 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:36" (1/1) ... [2025-02-05 14:28:36,692 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:36" (1/1) ... [2025-02-05 14:28:36,696 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:36" (1/1) ... [2025-02-05 14:28:36,696 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:36" (1/1) ... [2025-02-05 14:28:36,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:28:36,699 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:28:36,699 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:28:36,699 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:28:36,703 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:36" (1/1) ... [2025-02-05 14:28:36,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:28:36,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:28:36,731 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:36,733 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:36,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:28:36,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:28:36,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:28:36,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 14:28:36,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-05 14:28:36,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-05 14:28:36,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:28:36,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:28:36,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-05 14:28:36,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-05 14:28:36,753 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_0 [2025-02-05 14:28:36,753 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_0 [2025-02-05 14:28:36,753 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_1 [2025-02-05 14:28:36,754 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_1 [2025-02-05 14:28:36,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:28:36,843 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:28:36,845 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:28:37,029 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: call ULTIMATE.dealloc(check_diff_~#d~0#1.base, check_diff_~#d~0#1.offset);havoc check_diff_~#d~0#1.base, check_diff_~#d~0#1.offset; [2025-02-05 14:28:37,072 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2025-02-05 14:28:37,072 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:28:37,082 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:28:37,082 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:28:37,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:28:37 BoogieIcfgContainer [2025-02-05 14:28:37,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:28:37,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:28:37,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:28:37,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:28:37,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:28:36" (1/3) ... [2025-02-05 14:28:37,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6451b4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:28:37, skipping insertion in model container [2025-02-05 14:28:37,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:36" (2/3) ... [2025-02-05 14:28:37,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6451b4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:28:37, skipping insertion in model container [2025-02-05 14:28:37,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:28:37" (3/3) ... [2025-02-05 14:28:37,093 INFO L128 eAbstractionObserver]: Analyzing ICFG color-sendmoremoney.c [2025-02-05 14:28:37,104 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:28:37,106 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG color-sendmoremoney.c that has 3 procedures, 54 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 14:28:37,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:28:37,158 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;@2bd6ce3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:28:37,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:28:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:28:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 14:28:37,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:37,170 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:37,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:37,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:37,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1033323295, now seen corresponding path program 1 times [2025-02-05 14:28:37,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:37,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227302726] [2025-02-05 14:28:37,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:37,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:37,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 14:28:37,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 14:28:37,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:37,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:37,505 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:37,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:37,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227302726] [2025-02-05 14:28:37,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227302726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:37,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:37,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:28:37,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202322031] [2025-02-05 14:28:37,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:37,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:28:37,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:37,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:28:37,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:28:37,537 INFO L87 Difference]: Start difference. First operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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:37,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:37,594 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2025-02-05 14:28:37,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:28:37,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 27 [2025-02-05 14:28:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:37,601 INFO L225 Difference]: With dead ends: 105 [2025-02-05 14:28:37,601 INFO L226 Difference]: Without dead ends: 54 [2025-02-05 14:28:37,606 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:37,608 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 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:37,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 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:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-05 14:28:37,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-05 14:28:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 14:28:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2025-02-05 14:28:37,648 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 27 [2025-02-05 14:28:37,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:37,649 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2025-02-05 14:28:37,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2025-02-05 14:28:37,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 14:28:37,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:37,653 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:37,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:28:37,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:37,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:37,655 INFO L85 PathProgramCache]: Analyzing trace with hash -772115039, now seen corresponding path program 1 times [2025-02-05 14:28:37,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:37,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680835145] [2025-02-05 14:28:37,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:37,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 14:28:37,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 14:28:37,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:37,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:37,726 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:37,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:37,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680835145] [2025-02-05 14:28:37,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680835145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:37,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:37,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:28:37,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048436546] [2025-02-05 14:28:37,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:37,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:28:37,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:37,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:28:37,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:28:37,730 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:37,756 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2025-02-05 14:28:37,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:28:37,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 27 [2025-02-05 14:28:37,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:37,760 INFO L225 Difference]: With dead ends: 59 [2025-02-05 14:28:37,760 INFO L226 Difference]: Without dead ends: 55 [2025-02-05 14:28:37,760 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:37,761 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 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:37,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 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:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-05 14:28:37,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-05 14:28:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 14:28:37,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2025-02-05 14:28:37,770 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 27 [2025-02-05 14:28:37,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:37,771 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2025-02-05 14:28:37,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2025-02-05 14:28:37,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 14:28:37,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:37,772 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:37,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:28:37,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:37,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:37,773 INFO L85 PathProgramCache]: Analyzing trace with hash -772055457, now seen corresponding path program 1 times [2025-02-05 14:28:37,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:37,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414318854] [2025-02-05 14:28:37,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:37,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:37,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 14:28:37,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 14:28:37,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:37,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:37,904 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:37,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:37,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414318854] [2025-02-05 14:28:37,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414318854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:37,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:37,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:28:37,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208463444] [2025-02-05 14:28:37,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:37,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:28:37,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:37,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:28:37,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:37,906 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:37,925 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2025-02-05 14:28:37,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:28:37,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 27 [2025-02-05 14:28:37,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:37,928 INFO L225 Difference]: With dead ends: 59 [2025-02-05 14:28:37,928 INFO L226 Difference]: Without dead ends: 54 [2025-02-05 14:28:37,928 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:37,929 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 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:37,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 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:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-05 14:28:37,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-05 14:28:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 14:28:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2025-02-05 14:28:37,937 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 27 [2025-02-05 14:28:37,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:37,937 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2025-02-05 14:28:37,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:37,937 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2025-02-05 14:28:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 14:28:37,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:37,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:37,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:28:37,939 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:37,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash 315800797, now seen corresponding path program 1 times [2025-02-05 14:28:37,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:37,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861039869] [2025-02-05 14:28:37,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:37,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:37,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 14:28:37,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 14:28:37,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:37,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:38,039 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:38,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:38,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861039869] [2025-02-05 14:28:38,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861039869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:38,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:38,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:28:38,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490959778] [2025-02-05 14:28:38,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:38,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:28:38,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:38,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:28:38,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:28:38,041 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:38,060 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2025-02-05 14:28:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:28:38,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 29 [2025-02-05 14:28:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:38,062 INFO L225 Difference]: With dead ends: 64 [2025-02-05 14:28:38,062 INFO L226 Difference]: Without dead ends: 58 [2025-02-05 14:28:38,062 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:38,063 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:38,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:38,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-05 14:28:38,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2025-02-05 14:28:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 14:28:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2025-02-05 14:28:38,073 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 29 [2025-02-05 14:28:38,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:38,073 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2025-02-05 14:28:38,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2025-02-05 14:28:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 14:28:38,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:38,075 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:38,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 14:28:38,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:38,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:38,076 INFO L85 PathProgramCache]: Analyzing trace with hash -968969130, now seen corresponding path program 1 times [2025-02-05 14:28:38,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:38,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721920826] [2025-02-05 14:28:38,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:38,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:38,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 14:28:38,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 14:28:38,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:38,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:28:38,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:38,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721920826] [2025-02-05 14:28:38,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721920826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:38,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:38,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:28:38,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503015474] [2025-02-05 14:28:38,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:38,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:28:38,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:38,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:28:38,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:38,182 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:38,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:38,215 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2025-02-05 14:28:38,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:28:38,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 31 [2025-02-05 14:28:38,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:38,216 INFO L225 Difference]: With dead ends: 70 [2025-02-05 14:28:38,216 INFO L226 Difference]: Without dead ends: 61 [2025-02-05 14:28:38,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:38,218 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 125 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.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:38,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 125 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:38,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-05 14:28:38,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2025-02-05 14:28:38,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 14:28:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2025-02-05 14:28:38,227 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 31 [2025-02-05 14:28:38,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:38,228 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2025-02-05 14:28:38,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:38,228 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2025-02-05 14:28:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 14:28:38,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:38,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:38,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 14:28:38,229 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:38,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:38,230 INFO L85 PathProgramCache]: Analyzing trace with hash 175602264, now seen corresponding path program 1 times [2025-02-05 14:28:38,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:38,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88400157] [2025-02-05 14:28:38,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:38,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:38,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 14:28:38,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 14:28:38,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:38,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:38,311 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:38,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:38,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88400157] [2025-02-05 14:28:38,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88400157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:38,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:38,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:28:38,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700193382] [2025-02-05 14:28:38,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:38,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:28:38,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:38,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:28:38,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:38,314 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:38,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:38,345 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2025-02-05 14:28:38,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:28:38,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 31 [2025-02-05 14:28:38,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:38,348 INFO L225 Difference]: With dead ends: 69 [2025-02-05 14:28:38,348 INFO L226 Difference]: Without dead ends: 56 [2025-02-05 14:28:38,348 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:38,349 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 186 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:38,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 186 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:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-05 14:28:38,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-05 14:28:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 14:28:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2025-02-05 14:28:38,357 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 31 [2025-02-05 14:28:38,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:38,357 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2025-02-05 14:28:38,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:38,358 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2025-02-05 14:28:38,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 14:28:38,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:38,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 14:28:38,359 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:38,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:38,359 INFO L85 PathProgramCache]: Analyzing trace with hash -578371137, now seen corresponding path program 1 times [2025-02-05 14:28:38,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:38,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885789367] [2025-02-05 14:28:38,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:38,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:38,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 14:28:38,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 14:28:38,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:38,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:38,435 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:38,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:38,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885789367] [2025-02-05 14:28:38,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885789367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:38,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:38,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:28:38,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623644911] [2025-02-05 14:28:38,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:38,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:28:38,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:38,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:28:38,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:38,438 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:38,464 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2025-02-05 14:28:38,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:28:38,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 37 [2025-02-05 14:28:38,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:38,466 INFO L225 Difference]: With dead ends: 77 [2025-02-05 14:28:38,467 INFO L226 Difference]: Without dead ends: 56 [2025-02-05 14:28:38,467 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:38,468 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 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:38,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 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:38,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-05 14:28:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-05 14:28:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 14:28:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2025-02-05 14:28:38,478 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 37 [2025-02-05 14:28:38,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:38,479 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2025-02-05 14:28:38,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2025-02-05 14:28:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 14:28:38,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:38,480 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:38,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 14:28:38,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:38,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:38,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1473654951, now seen corresponding path program 1 times [2025-02-05 14:28:38,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:38,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372175383] [2025-02-05 14:28:38,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:38,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:38,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 14:28:38,502 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,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:38,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:38,567 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:38,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:38,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372175383] [2025-02-05 14:28:38,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372175383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:38,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:38,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:28:38,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108206341] [2025-02-05 14:28:38,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:38,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:28:38,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:38,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:28:38,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:38,570 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:38,598 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2025-02-05 14:28:38,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:28:38,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 43 [2025-02-05 14:28:38,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:38,599 INFO L225 Difference]: With dead ends: 81 [2025-02-05 14:28:38,599 INFO L226 Difference]: Without dead ends: 56 [2025-02-05 14:28:38,600 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:38,602 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 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:38,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 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:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-05 14:28:38,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-05 14:28:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 14:28:38,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2025-02-05 14:28:38,610 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 43 [2025-02-05 14:28:38,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:38,610 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2025-02-05 14:28:38,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:38,613 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2025-02-05 14:28:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 14:28:38,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:38,613 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 14:28:38,613 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:38,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:38,614 INFO L85 PathProgramCache]: Analyzing trace with hash 784690448, now seen corresponding path program 1 times [2025-02-05 14:28:38,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:38,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846390896] [2025-02-05 14:28:38,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:38,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:38,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 14:28:38,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 14:28:38,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:38,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:38,686 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:38,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:38,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846390896] [2025-02-05 14:28:38,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846390896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:38,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:38,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:28:38,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752993800] [2025-02-05 14:28:38,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:38,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:28:38,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:38,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:28:38,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:38,687 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 14:28:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:38,706 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2025-02-05 14:28:38,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:28:38,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2025-02-05 14:28:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:38,707 INFO L225 Difference]: With dead ends: 85 [2025-02-05 14:28:38,707 INFO L226 Difference]: Without dead ends: 56 [2025-02-05 14:28:38,707 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:38,708 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 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:38,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 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:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-05 14:28:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-05 14:28:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 14:28:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-02-05 14:28:38,716 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 49 [2025-02-05 14:28:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:38,717 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-02-05 14:28:38,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 14:28:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2025-02-05 14:28:38,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 14:28:38,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:38,718 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:38,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 14:28:38,718 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:38,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:38,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1221228224, now seen corresponding path program 1 times [2025-02-05 14:28:38,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:38,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045429549] [2025-02-05 14:28:38,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:38,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:38,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 14:28:38,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 14:28:38,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:38,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 14:28:38,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:38,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045429549] [2025-02-05 14:28:38,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045429549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:38,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:38,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:28:38,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95993925] [2025-02-05 14:28:38,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:38,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:28:38,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:38,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:28:38,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:38,788 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 14:28:38,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:38,812 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2025-02-05 14:28:38,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:28:38,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-02-05 14:28:38,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:38,814 INFO L225 Difference]: With dead ends: 95 [2025-02-05 14:28:38,815 INFO L226 Difference]: Without dead ends: 56 [2025-02-05 14:28:38,815 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:38,815 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 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:38,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 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:38,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-05 14:28:38,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-05 14:28:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 14:28:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2025-02-05 14:28:38,826 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 55 [2025-02-05 14:28:38,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:38,826 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2025-02-05 14:28:38,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 14:28:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2025-02-05 14:28:38,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 14:28:38,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:38,827 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 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, 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,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 14:28:38,827 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:38,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash 913789611, now seen corresponding path program 1 times [2025-02-05 14:28:38,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:38,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704777548] [2025-02-05 14:28:38,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:38,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:38,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 14:28:38,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 14:28:38,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:38,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 14:28:38,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:38,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704777548] [2025-02-05 14:28:38,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704777548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:38,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:38,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:28:38,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834406505] [2025-02-05 14:28:38,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:38,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:28:38,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:38,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:28:38,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:38,905 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 14:28:38,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:38,927 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2025-02-05 14:28:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:28:38,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2025-02-05 14:28:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:38,928 INFO L225 Difference]: With dead ends: 99 [2025-02-05 14:28:38,928 INFO L226 Difference]: Without dead ends: 56 [2025-02-05 14:28:38,929 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:38,929 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 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:38,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 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:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-05 14:28:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-05 14:28:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 14:28:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2025-02-05 14:28:38,937 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 61 [2025-02-05 14:28:38,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:38,937 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2025-02-05 14:28:38,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 14:28:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2025-02-05 14:28:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 14:28:38,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:38,942 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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, 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,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 14:28:38,942 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:38,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:38,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1512430487, now seen corresponding path program 1 times [2025-02-05 14:28:38,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:38,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955600740] [2025-02-05 14:28:38,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:38,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:38,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 14:28:38,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 14:28:38,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:38,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 14:28:39,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:39,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955600740] [2025-02-05 14:28:39,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955600740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:39,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:39,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:28:39,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726880172] [2025-02-05 14:28:39,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:39,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:28:39,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:39,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:28:39,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:39,045 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 14:28:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:39,070 INFO L93 Difference]: Finished difference Result 103 states and 123 transitions. [2025-02-05 14:28:39,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:28:39,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-02-05 14:28:39,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:39,071 INFO L225 Difference]: With dead ends: 103 [2025-02-05 14:28:39,071 INFO L226 Difference]: Without dead ends: 56 [2025-02-05 14:28:39,072 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:39,072 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 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:39,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 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:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-05 14:28:39,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2025-02-05 14:28:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:28:39,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2025-02-05 14:28:39,077 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 67 [2025-02-05 14:28:39,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:39,077 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-02-05 14:28:39,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 14:28:39,077 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2025-02-05 14:28:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 14:28:39,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:39,077 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 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, 1, 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:39,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 14:28:39,078 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:39,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:39,078 INFO L85 PathProgramCache]: Analyzing trace with hash -428758270, now seen corresponding path program 1 times [2025-02-05 14:28:39,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:39,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506680104] [2025-02-05 14:28:39,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:39,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:39,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 14:28:39,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 14:28:39,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:39,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 14:28:39,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:39,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506680104] [2025-02-05 14:28:39,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506680104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:39,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:39,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:28:39,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754842161] [2025-02-05 14:28:39,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:39,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:28:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:39,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:28:39,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:39,197 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:28:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:39,215 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2025-02-05 14:28:39,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:28:39,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2025-02-05 14:28:39,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:39,216 INFO L225 Difference]: With dead ends: 58 [2025-02-05 14:28:39,216 INFO L226 Difference]: Without dead ends: 52 [2025-02-05 14:28:39,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:28:39,217 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:39,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:39,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-05 14:28:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-05 14:28:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:28:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-02-05 14:28:39,225 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 73 [2025-02-05 14:28:39,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:39,225 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-02-05 14:28:39,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:28:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-02-05 14:28:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 14:28:39,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:39,226 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 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, 1, 1, 1, 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:39,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 14:28:39,226 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:39,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:39,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1097621503, now seen corresponding path program 1 times [2025-02-05 14:28:39,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:39,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220126053] [2025-02-05 14:28:39,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:39,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:39,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 14:28:39,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 14:28:39,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:39,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-02-05 14:28:39,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:39,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220126053] [2025-02-05 14:28:39,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220126053] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:28:39,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237522831] [2025-02-05 14:28:39,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:39,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:28:39,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:28:39,319 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:39,320 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:39,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 14:28:39,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 14:28:39,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:39,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:39,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 14:28:39,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:28:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 14:28:39,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:28:39,608 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 14:28:39,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237522831] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:28:39,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:28:39,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-02-05 14:28:39,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513250741] [2025-02-05 14:28:39,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:28:39,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 14:28:39,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:39,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 14:28:39,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-05 14:28:39,611 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:28:39,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:39,763 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2025-02-05 14:28:39,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 14:28:39,764 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2025-02-05 14:28:39,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:39,765 INFO L225 Difference]: With dead ends: 84 [2025-02-05 14:28:39,765 INFO L226 Difference]: Without dead ends: 75 [2025-02-05 14:28:39,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2025-02-05 14:28:39,767 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 20 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:39,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 370 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:28:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-05 14:28:39,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2025-02-05 14:28:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 states have internal predecessors, (67), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:28:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2025-02-05 14:28:39,774 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 75 [2025-02-05 14:28:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:39,775 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2025-02-05 14:28:39,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:28:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2025-02-05 14:28:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 14:28:39,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:39,776 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 6, 6, 6, 3, 3, 2, 2, 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, 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:39,785 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:39,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 14:28:39,976 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:39,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:39,977 INFO L85 PathProgramCache]: Analyzing trace with hash 320854971, now seen corresponding path program 2 times [2025-02-05 14:28:39,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:39,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34287807] [2025-02-05 14:28:39,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:28:39,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:39,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-05 14:28:40,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 14:28:40,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:28:40,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 58 proven. 16 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-02-05 14:28:40,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:40,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34287807] [2025-02-05 14:28:40,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34287807] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:28:40,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216953208] [2025-02-05 14:28:40,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:28:40,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:28:40,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:28:40,182 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:40,188 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:40,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-05 14:28:40,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 14:28:40,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:28:40,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:40,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 14:28:40,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:28:40,441 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 58 proven. 16 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-02-05 14:28:40,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:28:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 58 proven. 16 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-02-05 14:28:40,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216953208] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:28:40,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:28:40,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-02-05 14:28:40,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703551015] [2025-02-05 14:28:40,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:28:40,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 14:28:40,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:40,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 14:28:40,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=167, Unknown=0, NotChecked=0, Total=272 [2025-02-05 14:28:40,587 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:28:40,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:40,731 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2025-02-05 14:28:40,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 14:28:40,731 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 95 [2025-02-05 14:28:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:40,732 INFO L225 Difference]: With dead ends: 104 [2025-02-05 14:28:40,732 INFO L226 Difference]: Without dead ends: 83 [2025-02-05 14:28:40,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 178 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=358, Unknown=0, NotChecked=0, Total=552 [2025-02-05 14:28:40,733 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 34 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:40,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 370 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:28:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-05 14:28:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-02-05 14:28:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 71 states have internal predecessors, (77), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:28:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2025-02-05 14:28:40,738 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 95 [2025-02-05 14:28:40,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:40,739 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2025-02-05 14:28:40,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:28:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2025-02-05 14:28:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 14:28:40,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:40,740 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 6, 6, 6, 3, 3, 2, 2, 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, 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:40,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 14:28:40,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 14:28:40,944 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:40,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:40,944 INFO L85 PathProgramCache]: Analyzing trace with hash -199112064, now seen corresponding path program 3 times [2025-02-05 14:28:40,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:40,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735390032] [2025-02-05 14:28:40,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:28:40,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:40,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 17 equivalence classes. [2025-02-05 14:28:40,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 85 of 105 statements. [2025-02-05 14:28:41,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-05 14:28:41,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-05 14:28:41,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:41,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735390032] [2025-02-05 14:28:41,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735390032] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:28:41,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214521521] [2025-02-05 14:28:41,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:28:41,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:28:41,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:28:41,089 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:28:41,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 14:28:41,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 17 equivalence classes. [2025-02-05 14:28:41,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 85 of 105 statements. [2025-02-05 14:28:41,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-05 14:28:41,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:41,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 14:28:41,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:28:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 70 proven. 3 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-05 14:28:41,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:28:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-05 14:28:41,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214521521] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 14:28:41,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:28:41,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 8 [2025-02-05 14:28:41,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332385757] [2025-02-05 14:28:41,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:41,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 14:28:41,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:41,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 14:28:41,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:28:41,404 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:28:41,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:41,450 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2025-02-05 14:28:41,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:28:41,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 105 [2025-02-05 14:28:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:41,451 INFO L225 Difference]: With dead ends: 92 [2025-02-05 14:28:41,451 INFO L226 Difference]: Without dead ends: 86 [2025-02-05 14:28:41,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 206 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 14:28:41,452 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 5 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:41,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 212 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:28:41,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-05 14:28:41,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-05 14:28:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 75 states have internal predecessors, (82), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:28:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2025-02-05 14:28:41,459 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 105 [2025-02-05 14:28:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:41,460 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2025-02-05 14:28:41,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:28:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2025-02-05 14:28:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 14:28:41,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:41,461 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 6, 6, 6, 4, 4, 2, 2, 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, 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:41,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 14:28:41,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:28:41,662 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:41,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:41,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1516008954, now seen corresponding path program 4 times [2025-02-05 14:28:41,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:41,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010403709] [2025-02-05 14:28:41,663 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 14:28:41,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:41,689 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 109 statements into 2 equivalence classes. [2025-02-05 14:28:41,711 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 97 of 109 statements. [2025-02-05 14:28:41,712 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 14:28:41,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 193 proven. 41 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 14:28:41,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:41,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010403709] [2025-02-05 14:28:41,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010403709] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:28:41,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808771143] [2025-02-05 14:28:41,916 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 14:28:41,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:28:41,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:28:41,918 INFO L229 MonitoredProcess]: Starting monitored process 5 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:41,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 14:28:42,062 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 109 statements into 2 equivalence classes. [2025-02-05 14:28:42,103 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 97 of 109 statements. [2025-02-05 14:28:42,104 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 14:28:42,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:42,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 14:28:42,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:28:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 149 proven. 121 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-02-05 14:28:42,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:28:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 162 proven. 108 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-02-05 14:28:42,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808771143] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:28:42,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:28:42,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 26 [2025-02-05 14:28:42,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013776993] [2025-02-05 14:28:42,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:28:42,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 14:28:42,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:42,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 14:28:42,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2025-02-05 14:28:42,609 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:28:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:43,100 INFO L93 Difference]: Finished difference Result 151 states and 184 transitions. [2025-02-05 14:28:43,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-05 14:28:43,101 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 109 [2025-02-05 14:28:43,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:43,102 INFO L225 Difference]: With dead ends: 151 [2025-02-05 14:28:43,102 INFO L226 Difference]: Without dead ends: 134 [2025-02-05 14:28:43,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=713, Invalid=2257, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 14:28:43,104 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 42 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:43,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 473 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:28:43,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-05 14:28:43,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 108. [2025-02-05 14:28:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 97 states have (on average 1.1030927835051547) internal successors, (107), 97 states have internal predecessors, (107), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:28:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2025-02-05 14:28:43,115 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 109 [2025-02-05 14:28:43,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:43,115 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2025-02-05 14:28:43,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:28:43,115 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2025-02-05 14:28:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 14:28:43,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:43,116 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 6, 6, 6, 5, 5, 2, 2, 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, 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:43,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 14:28:43,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 14:28:43,317 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:43,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:43,318 INFO L85 PathProgramCache]: Analyzing trace with hash -50840261, now seen corresponding path program 5 times [2025-02-05 14:28:43,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:43,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025406698] [2025-02-05 14:28:43,318 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 14:28:43,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:43,343 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 127 statements into 24 equivalence classes. [2025-02-05 14:28:43,377 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) and asserted 103 of 127 statements. [2025-02-05 14:28:43,378 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2025-02-05 14:28:43,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 308 proven. 247 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-02-05 14:28:43,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:28:43,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025406698] [2025-02-05 14:28:43,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025406698] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:28:43,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436080761] [2025-02-05 14:28:43,579 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 14:28:43,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:28:43,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:28:43,582 INFO L229 MonitoredProcess]: Starting monitored process 6 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:43,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 14:28:43,727 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 127 statements into 24 equivalence classes. [2025-02-05 14:28:43,789 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) and asserted 103 of 127 statements. [2025-02-05 14:28:43,789 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2025-02-05 14:28:43,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:43,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 14:28:43,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:28:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 299 proven. 254 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-02-05 14:28:43,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:28:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 317 proven. 236 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-02-05 14:28:44,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436080761] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:28:44,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:28:44,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2025-02-05 14:28:44,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320335302] [2025-02-05 14:28:44,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:28:44,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 14:28:44,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:28:44,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 14:28:44,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-02-05 14:28:44,100 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 21 states have internal predecessors, (86), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:28:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:44,524 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2025-02-05 14:28:44,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-05 14:28:44,525 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 21 states have internal predecessors, (86), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 127 [2025-02-05 14:28:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:44,526 INFO L225 Difference]: With dead ends: 171 [2025-02-05 14:28:44,527 INFO L226 Difference]: Without dead ends: 118 [2025-02-05 14:28:44,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 241 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=706, Invalid=1946, Unknown=0, NotChecked=0, Total=2652 [2025-02-05 14:28:44,529 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 19 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:28:44,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 578 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:28:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-05 14:28:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-05 14:28:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 107 states have (on average 1.0934579439252337) internal successors, (117), 107 states have internal predecessors, (117), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:28:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2025-02-05 14:28:44,540 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 127 [2025-02-05 14:28:44,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:44,541 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2025-02-05 14:28:44,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 21 states have internal predecessors, (86), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:28:44,541 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2025-02-05 14:28:44,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 14:28:44,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:44,542 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 7, 7, 6, 6, 6, 2, 2, 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, 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:44,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 14:28:44,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 14:28:44,747 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:44,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:44,747 INFO L85 PathProgramCache]: Analyzing trace with hash 241225522, now seen corresponding path program 6 times [2025-02-05 14:28:44,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:28:44,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880926870] [2025-02-05 14:28:44,748 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 14:28:44,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:28:44,772 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 141 statements into 29 equivalence classes. [2025-02-05 14:28:44,905 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 14:28:44,906 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2025-02-05 14:28:44,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 14:28:44,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 14:28:44,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 14:28:44,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 14:28:44,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:44,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 14:28:44,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 14:28:44,970 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 14:28:44,971 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 14:28:44,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 14:28:44,975 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:45,046 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 14:28:45,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 02:28:45 BoogieIcfgContainer [2025-02-05 14:28:45,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 14:28:45,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 14:28:45,049 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 14:28:45,049 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 14:28:45,050 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:37" (3/4) ... [2025-02-05 14:28:45,052 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 14:28:45,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 14:28:45,053 INFO L158 Benchmark]: Toolchain (without parser) took 8610.55ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 106.3MB in the beginning and 204.7MB in the end (delta: -98.4MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2025-02-05 14:28:45,053 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:28:45,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.98ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 94.4MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:28:45,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.53ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:28:45,054 INFO L158 Benchmark]: Boogie Preprocessor took 34.08ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:28:45,054 INFO L158 Benchmark]: IcfgBuilder took 383.65ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 72.4MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 14:28:45,054 INFO L158 Benchmark]: TraceAbstraction took 7963.66ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 71.8MB in the beginning and 204.8MB in the end (delta: -133.0MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2025-02-05 14:28:45,054 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 310.4MB. Free memory was 204.8MB in the beginning and 204.7MB in the end (delta: 63.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:28:45,056 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.98ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 94.4MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.53ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.08ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 383.65ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 72.4MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7963.66ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 71.8MB in the beginning and 204.8MB in the end (delta: -133.0MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 310.4MB. Free memory was 204.8MB in the beginning and 204.7MB in the end (delta: 63.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 32, overapproximation of someBinaryDOUBLEComparisonOperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 28. Possible FailurePath: [L58] double s, e, n, d, m, o, r, y; [L59] s = __VERIFIER_nondet_double() [L60] e = __VERIFIER_nondet_double() [L61] n = __VERIFIER_nondet_double() [L62] d = __VERIFIER_nondet_double() [L63] m = __VERIFIER_nondet_double() [L64] o = __VERIFIER_nondet_double() [L65] r = __VERIFIER_nondet_double() [L66] y = __VERIFIER_nondet_double() [L67] CALL, EXPR solve(s, e, n, d, m, o, r, y) [L46] CALL, EXPR check_domain_1(S) VAL [\old(x)=76] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=76, \result=1] [L46] RET, EXPR check_domain_1(S) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46] CALL, EXPR check_domain_0(E) VAL [\old(x)=74] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=74, \result=1] [L46] RET, EXPR check_domain_0(E) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46] CALL, EXPR check_domain_0(N) VAL [\old(x)=71] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=71, \result=1] [L46] RET, EXPR check_domain_0(N) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L47] CALL, EXPR check_domain_0(D) VAL [\old(x)=70] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=70, \result=1] [L47] RET, EXPR check_domain_0(D) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L47] CALL, EXPR check_domain_1(M) VAL [\old(x)=72] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=72, \result=1] [L47] RET, EXPR check_domain_1(M) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L47] CALL, EXPR check_domain_0(O) VAL [\old(x)=73] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=73, \result=1] [L47] RET, EXPR check_domain_0(O) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L48] CALL, EXPR check_domain_0(R) VAL [\old(x)=75] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=75, \result=1] [L48] RET, EXPR check_domain_0(R) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L48] CALL, EXPR check_domain_0(Y) VAL [\old(x)=77] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=77, \result=1] [L48] RET, EXPR check_domain_0(Y) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) VAL [D=70, E=74, M=72, N=71, O=73, R=75, S=76, Y=77] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L51] CALL, EXPR check_diff(S, E, N, D, M, O, R, Y) [L37] double d[8] = {S, E, N, D, M, O, R, Y}; [L37] double d[8] = {S, E, N, D, M, O, R, Y}; [L37] double d[8] = {S, E, N, D, M, O, R, Y}; [L37] double d[8] = {S, E, N, D, M, O, R, Y}; [L37] double d[8] = {S, E, N, D, M, O, R, Y}; [L37] double d[8] = {S, E, N, D, M, O, R, Y}; [L37] double d[8] = {S, E, N, D, M, O, R, Y}; [L37] double d[8] = {S, E, N, D, M, O, R, Y}; [L37] double d[8] = {S, E, N, D, M, O, R, Y}; [L38] int i = 0; VAL [d={4:0}, i=0] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={4:0}, i=0, j=1] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=0, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=0, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=0, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=0, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=0, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=0, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=0, j=8] [L39] COND FALSE !(j < 8) [L38] i++ VAL [d={4:0}, i=1] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={4:0}, i=1, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=1, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=1, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=1, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=1, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=1, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=1, j=8] [L39] COND FALSE !(j < 8) [L38] i++ VAL [d={4:0}, i=2] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={4:0}, i=2, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=2, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=2, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=2, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=2, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=2, j=8] [L39] COND FALSE !(j < 8) [L38] i++ VAL [d={4:0}, i=3] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={4:0}, i=3, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=3, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=3, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=3, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=3, j=8] [L39] COND FALSE !(j < 8) [L38] i++ VAL [d={4:0}, i=4] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={4:0}, i=4, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=4, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=4, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=4, j=8] [L39] COND FALSE !(j < 8) [L38] i++ VAL [d={4:0}, i=5] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={4:0}, i=5, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=5, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=5, j=8] [L39] COND FALSE !(j < 8) [L38] i++ VAL [d={4:0}, i=6] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={4:0}, i=6, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={4:0}, i=6, j=8] [L39] COND FALSE !(j < 8) [L38] i++ VAL [d={4:0}, i=7] [L38] COND FALSE !(i < 7) [L42] return 1; [L37] double d[8] = {S, E, N, D, M, O, R, Y}; [L42] return 1; VAL [\result=1] [L51] RET, EXPR check_diff(S, E, N, D, M, O, R, Y) [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L46-L51] COND TRUE check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L52] return 1; VAL [\result=1] [L67] RET, EXPR solve(s, e, n, d, m, o, r, y) [L67] CALL __VERIFIER_assert(!solve(s, e, n, d, m, o, r, y)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 19, TraceHistogramMax: 28, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 4256 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3145 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 570 IncrementalHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 1111 mSDtfsCounter, 570 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1185 GetRequests, 991 SyntacticMatches, 19 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=18, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 42 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1720 NumberOfCodeBlocks, 1608 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 2062 ConstructedInterpolants, 0 QuantifiedInterpolants, 2831 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1636 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 3890/4954 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:45,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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-sendmoremoney.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 3295093de4d211bffc15ed0a2994c81b442a590cdd92ae45e7cf4082ee88576f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:28:47,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:28:47,357 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:47,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:28:47,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:28:47,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:28:47,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:28:47,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:28:47,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:28:47,392 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:28:47,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:28:47,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:28:47,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:28:47,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:28:47,392 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:28:47,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:28:47,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:28:47,393 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:28:47,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:28:47,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:28:47,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:28:47,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:28:47,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:28:47,393 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 14:28:47,394 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 14:28:47,394 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 14:28:47,394 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:28:47,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:28:47,394 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:28:47,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:28:47,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:28:47,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:28:47,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:28:47,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:28:47,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:28:47,394 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:28:47,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:28:47,395 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:28:47,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:28:47,395 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 14:28:47,395 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 14:28:47,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:28:47,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:28:47,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:28:47,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:28:47,395 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 -> 3295093de4d211bffc15ed0a2994c81b442a590cdd92ae45e7cf4082ee88576f [2025-02-05 14:28:47,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:28:47,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:28:47,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:28:47,686 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:28:47,688 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:28:47,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c [2025-02-05 14:28:49,042 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c6db0423/4df612b6066f44eab5678a2ad8d2c4a0/FLAGcf450b1d0 [2025-02-05 14:28:49,272 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:28:49,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c [2025-02-05 14:28:49,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c6db0423/4df612b6066f44eab5678a2ad8d2c4a0/FLAGcf450b1d0 [2025-02-05 14:28:49,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c6db0423/4df612b6066f44eab5678a2ad8d2c4a0 [2025-02-05 14:28:49,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:28:49,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:28:49,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:28:49,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:28:49,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:28:49,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:28:49" (1/1) ... [2025-02-05 14:28:49,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142b5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:49, skipping insertion in model container [2025-02-05 14:28:49,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:28:49" (1/1) ... [2025-02-05 14:28:49,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:28:49,454 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-sendmoremoney.c[620,633] [2025-02-05 14:28:49,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:28:49,508 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:28:49,519 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-sendmoremoney.c[620,633] [2025-02-05 14:28:49,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:28:49,565 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:28:49,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:49 WrapperNode [2025-02-05 14:28:49,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:28:49,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:28:49,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:28:49,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:28:49,573 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:49" (1/1) ... [2025-02-05 14:28:49,583 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:49" (1/1) ... [2025-02-05 14:28:49,614 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2025-02-05 14:28:49,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:28:49,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:28:49,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:28:49,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:28:49,623 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:49" (1/1) ... [2025-02-05 14:28:49,624 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:49" (1/1) ... [2025-02-05 14:28:49,631 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:49" (1/1) ... [2025-02-05 14:28:49,656 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-05 14:28:49,656 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:49" (1/1) ... [2025-02-05 14:28:49,656 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:49" (1/1) ... [2025-02-05 14:28:49,668 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:49" (1/1) ... [2025-02-05 14:28:49,676 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:49" (1/1) ... [2025-02-05 14:28:49,677 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:49" (1/1) ... [2025-02-05 14:28:49,678 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:49" (1/1) ... [2025-02-05 14:28:49,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:28:49,686 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:28:49,689 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:28:49,689 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:28:49,691 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:49" (1/1) ... [2025-02-05 14:28:49,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:28:49,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:28:49,727 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:49,734 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:49,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:28:49,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-05 14:28:49,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-05 14:28:49,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 14:28:49,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-05 14:28:49,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 14:28:49,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-05 14:28:49,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-05 14:28:49,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:28:49,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:28:49,757 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_0 [2025-02-05 14:28:49,758 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_0 [2025-02-05 14:28:49,758 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_1 [2025-02-05 14:28:49,758 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_1 [2025-02-05 14:28:49,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:28:49,864 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:28:49,866 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:28:54,778 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: call ULTIMATE.dealloc(check_diff_~#d~0#1.base, check_diff_~#d~0#1.offset);havoc check_diff_~#d~0#1.base, check_diff_~#d~0#1.offset; [2025-02-05 14:28:54,929 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2025-02-05 14:28:54,929 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:28:54,938 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:28:54,938 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:28:54,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:28:54 BoogieIcfgContainer [2025-02-05 14:28:54,940 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:28:54,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:28:54,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:28:54,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:28:54,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:28:49" (1/3) ... [2025-02-05 14:28:54,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a63caed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:28:54, skipping insertion in model container [2025-02-05 14:28:54,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:28:49" (2/3) ... [2025-02-05 14:28:54,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a63caed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:28:54, skipping insertion in model container [2025-02-05 14:28:54,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:28:54" (3/3) ... [2025-02-05 14:28:54,950 INFO L128 eAbstractionObserver]: Analyzing ICFG color-sendmoremoney.c [2025-02-05 14:28:54,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:28:54,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG color-sendmoremoney.c that has 3 procedures, 54 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 14:28:55,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:28:55,029 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;@1827d02a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:28:55,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:28:55,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:28:55,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 14:28:55,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:55,039 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:55,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:55,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:55,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1033323295, now seen corresponding path program 1 times [2025-02-05 14:28:55,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:28:55,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048997578] [2025-02-05 14:28:55,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:55,054 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:55,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 14:28:55,057 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:55,060 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:55,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 14:28:56,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 14:28:56,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:56,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:56,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 14:28:56,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:28:56,694 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:56,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:28:56,695 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:28:56,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048997578] [2025-02-05 14:28:56,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048997578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:28:56,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:28:56,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:28:56,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179280655] [2025-02-05 14:28:56,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:28:56,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:28:56,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:28:56,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:28:56,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:28:56,717 INFO L87 Difference]: Start difference. First operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:28:57,131 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2025-02-05 14:28:57,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:28:57,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 27 [2025-02-05 14:28:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:28:57,138 INFO L225 Difference]: With dead ends: 105 [2025-02-05 14:28:57,138 INFO L226 Difference]: Without dead ends: 54 [2025-02-05 14:28:57,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:28:57,141 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 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:57,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 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:57,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-05 14:28:57,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-05 14:28:57,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 14:28:57,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2025-02-05 14:28:57,175 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 27 [2025-02-05 14:28:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:28:57,176 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2025-02-05 14:28:57,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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:57,176 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2025-02-05 14:28:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 14:28:57,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:28:57,178 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:28:57,247 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:57,378 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:57,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:28:57,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:28:57,380 INFO L85 PathProgramCache]: Analyzing trace with hash -772115039, now seen corresponding path program 1 times [2025-02-05 14:28:57,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:28:57,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048658625] [2025-02-05 14:28:57,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:28:57,380 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:57,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 14:28:57,384 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:57,385 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:57,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 14:28:58,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 14:28:58,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:28:58,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:28:58,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 14:28:58,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:00,723 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:29:00,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:29:00,723 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:29:00,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048658625] [2025-02-05 14:29:00,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048658625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:29:00,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:29:00,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 14:29:00,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932924386] [2025-02-05 14:29:00,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:29:00,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 14:29:00,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:29:00,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 14:29:00,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 14:29:00,729 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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:29:07,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 14:29:11,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 14:29:15,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 14:29:19,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 14:29:23,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 14:29:27,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 14:29:31,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 14:29:35,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 14:29:39,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 14:29:43,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 14:29:48,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 14:29:52,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 14:29:53,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:53,179 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2025-02-05 14:29:53,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 14:29:53,180 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 27 [2025-02-05 14:29:53,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:53,181 INFO L225 Difference]: With dead ends: 116 [2025-02-05 14:29:53,181 INFO L226 Difference]: Without dead ends: 69 [2025-02-05 14:29:53,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 14:29:53,182 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 15 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:53,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 576 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 213 Invalid, 12 Unknown, 0 Unchecked, 52.4s Time] [2025-02-05 14:29:53,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-05 14:29:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-05 14:29:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 57 states have internal predecessors, (70), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 14:29:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2025-02-05 14:29:53,196 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 27 [2025-02-05 14:29:53,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:53,197 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2025-02-05 14:29:53,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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:29:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2025-02-05 14:29:53,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 14:29:53,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:53,198 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:53,247 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:29:53,399 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:29:53,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:53,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash -772055457, now seen corresponding path program 1 times [2025-02-05 14:29:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:29:53,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35592622] [2025-02-05 14:29:53,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:53,400 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:29:53,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 14:29:53,403 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:29:53,404 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:29:53,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 14:29:54,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 14:29:54,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:54,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:54,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 14:29:54,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:54,874 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:29:54,875 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:29:54,875 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:29:54,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35592622] [2025-02-05 14:29:54,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35592622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:29:54,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:29:54,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:29:54,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921719337] [2025-02-05 14:29:54,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:29:54,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:29:54,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:29:54,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:29:54,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:29:54,876 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:29:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:54,983 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2025-02-05 14:29:54,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:29:54,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 27 [2025-02-05 14:29:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:54,984 INFO L225 Difference]: With dead ends: 73 [2025-02-05 14:29:54,984 INFO L226 Difference]: Without dead ends: 52 [2025-02-05 14:29:54,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:29:54,985 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:54,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:29:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-05 14:29:54,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-05 14:29:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-05 14:29:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2025-02-05 14:29:54,992 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 27 [2025-02-05 14:29:54,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:54,993 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-02-05 14:29:54,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:29:54,993 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2025-02-05 14:29:54,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 14:29:54,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:54,994 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 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, 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:29:55,043 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:29:55,195 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:29:55,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:55,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:55,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1240133625, now seen corresponding path program 1 times [2025-02-05 14:29:55,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:29:55,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641405416] [2025-02-05 14:29:55,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:55,196 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:29:55,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 14:29:55,198 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:29:55,200 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:29:55,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 14:29:56,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 14:29:56,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:56,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:56,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 14:29:56,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 14:29:56,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:29:56,687 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:29:56,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641405416] [2025-02-05 14:29:56,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641405416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:29:56,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:29:56,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:29:56,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791962645] [2025-02-05 14:29:56,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:29:56,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:29:56,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:29:56,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:29:56,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:29:56,689 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:29:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:56,855 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2025-02-05 14:29:56,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:29:56,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 71 [2025-02-05 14:29:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:56,858 INFO L225 Difference]: With dead ends: 62 [2025-02-05 14:29:56,858 INFO L226 Difference]: Without dead ends: 56 [2025-02-05 14:29:56,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:29:56,859 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:56,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 112 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:29:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-05 14:29:56,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2025-02-05 14:29:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-05 14:29:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-02-05 14:29:56,866 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 71 [2025-02-05 14:29:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:56,866 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-02-05 14:29:56,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:29:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-02-05 14:29:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 14:29:56,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:56,867 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 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, 1, 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:29:56,912 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:29:57,068 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:29:57,068 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:57,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:57,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1573329664, now seen corresponding path program 1 times [2025-02-05 14:29:57,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:29:57,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570506932] [2025-02-05 14:29:57,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:57,069 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:29:57,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 14:29:57,072 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:29:57,073 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:29:57,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 14:29:58,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 14:29:58,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:58,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:58,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 14:29:58,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 14:29:58,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:29:58,700 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:29:58,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [570506932] [2025-02-05 14:29:58,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [570506932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:29:58,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:29:58,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:29:58,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227486894] [2025-02-05 14:29:58,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:29:58,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:29:58,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:29:58,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:29:58,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:29:58,701 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:29:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:59,157 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2025-02-05 14:29:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:29:59,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2025-02-05 14:29:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:59,159 INFO L225 Difference]: With dead ends: 68 [2025-02-05 14:29:59,159 INFO L226 Difference]: Without dead ends: 59 [2025-02-05 14:29:59,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:29:59,160 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 9 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 164 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:59,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 164 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 14:29:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-05 14:29:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2025-02-05 14:29:59,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.119047619047619) internal successors, (47), 43 states have internal predecessors, (47), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-05 14:29:59,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-02-05 14:29:59,167 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 73 [2025-02-05 14:29:59,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:59,167 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-02-05 14:29:59,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:29:59,168 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-02-05 14:29:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 14:29:59,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:59,169 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 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, 1, 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:29:59,220 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:29:59,369 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:29:59,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:59,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:59,370 INFO L85 PathProgramCache]: Analyzing trace with hash -428758270, now seen corresponding path program 1 times [2025-02-05 14:29:59,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:29:59,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828321213] [2025-02-05 14:29:59,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:59,370 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:29:59,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 14:29:59,372 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:29:59,373 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:29:59,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 14:30:00,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 14:30:00,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:30:00,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:30:00,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 14:30:00,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:30:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 14:30:00,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:30:00,899 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:30:00,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828321213] [2025-02-05 14:30:00,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828321213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:30:00,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:30:00,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:30:00,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910408113] [2025-02-05 14:30:00,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:30:00,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:30:00,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:30:00,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:30:00,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:30:00,901 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:30:02,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 14:30:06,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 14:30:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:30:06,957 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2025-02-05 14:30:06,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:30:06,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2025-02-05 14:30:06,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:30:06,959 INFO L225 Difference]: With dead ends: 60 [2025-02-05 14:30:06,959 INFO L226 Difference]: Without dead ends: 54 [2025-02-05 14:30:06,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:30:06,960 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:30:06,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2025-02-05 14:30:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-05 14:30:06,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-05 14:30:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-05 14:30:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-02-05 14:30:06,969 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 73 [2025-02-05 14:30:06,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:30:06,970 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-02-05 14:30:06,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:30:06,970 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-02-05 14:30:06,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 14:30:06,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:30:06,973 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 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, 1, 1, 1, 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:30:07,023 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:30:07,173 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:30:07,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:30:07,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:30:07,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1097621503, now seen corresponding path program 1 times [2025-02-05 14:30:07,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:30:07,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099611648] [2025-02-05 14:30:07,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:30:07,175 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:30:07,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 14:30:07,177 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:30:07,180 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:30:07,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 14:30:08,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 14:30:08,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:30:08,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:30:08,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 14:30:08,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:30:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 14:30:09,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:30:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 14:30:10,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:30:10,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099611648] [2025-02-05 14:30:10,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099611648] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:30:10,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:30:10,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-02-05 14:30:10,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114262516] [2025-02-05 14:30:10,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:30:10,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 14:30:10,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:30:10,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 14:30:10,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:30:10,296 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:30:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:30:12,117 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2025-02-05 14:30:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 14:30:12,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2025-02-05 14:30:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:30:12,119 INFO L225 Difference]: With dead ends: 78 [2025-02-05 14:30:12,119 INFO L226 Difference]: Without dead ends: 69 [2025-02-05 14:30:12,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-02-05 14:30:12,120 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 14:30:12,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 314 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 14:30:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-05 14:30:12,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2025-02-05 14:30:12,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 55 states have internal predecessors, (60), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-05 14:30:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2025-02-05 14:30:12,130 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 75 [2025-02-05 14:30:12,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:30:12,130 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2025-02-05 14:30:12,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 14:30:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2025-02-05 14:30:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 14:30:12,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:30:12,134 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 2, 2, 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, 1, 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:30:12,186 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:30:12,334 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:30:12,335 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:30:12,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:30:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash 751282052, now seen corresponding path program 2 times [2025-02-05 14:30:12,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:30:12,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177666773] [2025-02-05 14:30:12,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:30:12,336 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:30:12,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 14:30:12,337 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:30:12,338 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:30:12,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes.