./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_ground-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_ground-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 751e67420c89b9d0e6d5639ea75482b8ab104ec2c6d8190aacf202ff4b3b3104 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 08:58:54,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 08:58:54,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 08:58:54,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 08:58:54,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 08:58:54,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 08:58:54,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 08:58:54,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 08:58:54,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 08:58:54,545 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 08:58:54,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 08:58:54,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 08:58:54,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 08:58:54,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 08:58:54,546 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 08:58:54,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 08:58:54,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 08:58:54,546 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 08:58:54,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 08:58:54,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 08:58:54,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 08:58:54,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 08:58:54,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 08:58:54,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 08:58:54,547 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 08:58:54,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 08:58:54,547 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 08:58:54,547 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 08:58:54,547 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 08:58:54,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 08:58:54,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 08:58:54,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 08:58:54,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 08:58:54,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 08:58:54,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 08:58:54,548 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 08:58:54,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 08:58:54,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 08:58:54,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 08:58:54,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 08:58:54,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 08:58:54,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 08:58:54,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 08:58:54,549 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 751e67420c89b9d0e6d5639ea75482b8ab104ec2c6d8190aacf202ff4b3b3104 [2025-03-03 08:58:54,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 08:58:54,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 08:58:54,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 08:58:54,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 08:58:54,780 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 08:58:54,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_ground-2.i [2025-03-03 08:58:55,890 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b267d668d/9a48ca47926348b28cd91e59b09026d3/FLAGfb37583e8 [2025-03-03 08:58:56,106 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 08:58:56,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_ground-2.i [2025-03-03 08:58:56,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b267d668d/9a48ca47926348b28cd91e59b09026d3/FLAGfb37583e8 [2025-03-03 08:58:56,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b267d668d/9a48ca47926348b28cd91e59b09026d3 [2025-03-03 08:58:56,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 08:58:56,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 08:58:56,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 08:58:56,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 08:58:56,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 08:58:56,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154be36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56, skipping insertion in model container [2025-03-03 08:58:56,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 08:58:56,585 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_ground-2.i[832,845] [2025-03-03 08:58:56,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 08:58:56,614 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 08:58:56,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_ground-2.i[832,845] [2025-03-03 08:58:56,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 08:58:56,644 INFO L204 MainTranslator]: Completed translation [2025-03-03 08:58:56,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56 WrapperNode [2025-03-03 08:58:56,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 08:58:56,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 08:58:56,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 08:58:56,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 08:58:56,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,671 INFO L138 Inliner]: procedures = 18, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2025-03-03 08:58:56,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 08:58:56,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 08:58:56,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 08:58:56,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 08:58:56,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,690 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 7, 3]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-03-03 08:58:56,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,695 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 08:58:56,698 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 08:58:56,698 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 08:58:56,698 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 08:58:56,699 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 08:58:56,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:56,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 08:58:56,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 08:58:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 08:58:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 08:58:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 08:58:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 08:58:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 08:58:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 08:58:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 08:58:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 08:58:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 08:58:56,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 08:58:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 08:58:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 08:58:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 08:58:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 08:58:56,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 08:58:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 08:58:56,795 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 08:58:56,797 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 08:58:56,939 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29: call ULTIMATE.dealloc(main_~#set~0#1.base, main_~#set~0#1.offset);havoc main_~#set~0#1.base, main_~#set~0#1.offset;call ULTIMATE.dealloc(main_~#values~0#1.base, main_~#values~0#1.offset);havoc main_~#values~0#1.base, main_~#values~0#1.offset; [2025-03-03 08:58:56,954 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-03 08:58:56,955 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 08:58:56,963 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 08:58:56,963 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 08:58:56,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:58:56 BoogieIcfgContainer [2025-03-03 08:58:56,964 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 08:58:56,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 08:58:56,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 08:58:56,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 08:58:56,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:58:56" (1/3) ... [2025-03-03 08:58:56,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1900e4c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:58:56, skipping insertion in model container [2025-03-03 08:58:56,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (2/3) ... [2025-03-03 08:58:56,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1900e4c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:58:56, skipping insertion in model container [2025-03-03 08:58:56,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:58:56" (3/3) ... [2025-03-03 08:58:56,970 INFO L128 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_ground-2.i [2025-03-03 08:58:56,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 08:58:56,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG data_structures_set_multi_proc_ground-2.i that has 2 procedures, 28 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2025-03-03 08:58:57,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 08:58:57,021 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;@369aa701, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 08:58:57,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 08:58:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 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-03-03 08:58:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 08:58:57,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:57,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:57,031 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:57,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:57,034 INFO L85 PathProgramCache]: Analyzing trace with hash 197479259, now seen corresponding path program 1 times [2025-03-03 08:58:57,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:57,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083380174] [2025-03-03 08:58:57,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:57,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:57,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 08:58:57,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 08:58:57,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:57,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 08:58:57,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:57,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083380174] [2025-03-03 08:58:57,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083380174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:58:57,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:58:57,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 08:58:57,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506619299] [2025-03-03 08:58:57,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:58:57,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 08:58:57,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:57,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 08:58:57,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 08:58:57,183 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 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) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:57,230 INFO L93 Difference]: Finished difference Result 62 states and 94 transitions. [2025-03-03 08:58:57,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 08:58:57,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-03 08:58:57,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:57,235 INFO L225 Difference]: With dead ends: 62 [2025-03-03 08:58:57,235 INFO L226 Difference]: Without dead ends: 34 [2025-03-03 08:58:57,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 08:58:57,241 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:57,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 54 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:58:57,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-03 08:58:57,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2025-03-03 08:58:57,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 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-03-03 08:58:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2025-03-03 08:58:57,266 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 9 [2025-03-03 08:58:57,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:57,266 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-03-03 08:58:57,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,267 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2025-03-03 08:58:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 08:58:57,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:57,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:57,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 08:58:57,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:57,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:57,268 INFO L85 PathProgramCache]: Analyzing trace with hash 177133945, now seen corresponding path program 1 times [2025-03-03 08:58:57,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:57,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121463183] [2025-03-03 08:58:57,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:57,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:57,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 08:58:57,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 08:58:57,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 08:58:57,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:57,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121463183] [2025-03-03 08:58:57,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121463183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:58:57,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538624236] [2025-03-03 08:58:57,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:57,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:57,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:57,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:58:57,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 08:58:57,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 08:58:57,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 08:58:57,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:57,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 08:58:57,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:58:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 08:58:57,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:58:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 08:58:57,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538624236] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:58:57,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:58:57,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 08:58:57,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793646219] [2025-03-03 08:58:57,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:58:57,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 08:58:57,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:57,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 08:58:57,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 08:58:57,433 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:57,521 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2025-03-03 08:58:57,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 08:58:57,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 08:58:57,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:57,523 INFO L225 Difference]: With dead ends: 83 [2025-03-03 08:58:57,523 INFO L226 Difference]: Without dead ends: 61 [2025-03-03 08:58:57,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 08:58:57,524 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 39 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:57,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 83 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:58:57,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-03 08:58:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 29. [2025-03-03 08:58:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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-03-03 08:58:57,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2025-03-03 08:58:57,529 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 10 [2025-03-03 08:58:57,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:57,529 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2025-03-03 08:58:57,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2025-03-03 08:58:57,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 08:58:57,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:57,530 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:57,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 08:58:57,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:57,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:57,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:57,735 INFO L85 PathProgramCache]: Analyzing trace with hash 952558299, now seen corresponding path program 2 times [2025-03-03 08:58:57,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:57,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392700144] [2025-03-03 08:58:57,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:58:57,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:57,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-03 08:58:57,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-03-03 08:58:57,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 08:58:57,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:57,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 08:58:57,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:57,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392700144] [2025-03-03 08:58:57,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392700144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:58:57,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:58:57,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 08:58:57,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134192951] [2025-03-03 08:58:57,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:58:57,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 08:58:57,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:57,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 08:58:57,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 08:58:57,804 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:57,829 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2025-03-03 08:58:57,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 08:58:57,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-03 08:58:57,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:57,831 INFO L225 Difference]: With dead ends: 55 [2025-03-03 08:58:57,831 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 08:58:57,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 08:58:57,832 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:57,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:58:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 08:58:57,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-03 08:58:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 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-03-03 08:58:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-03-03 08:58:57,836 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 13 [2025-03-03 08:58:57,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:57,836 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-03 08:58:57,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-03-03 08:58:57,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 08:58:57,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:57,837 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:57,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 08:58:57,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:57,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:57,838 INFO L85 PathProgramCache]: Analyzing trace with hash -927246672, now seen corresponding path program 1 times [2025-03-03 08:58:57,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:57,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412855371] [2025-03-03 08:58:57,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:57,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:57,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 08:58:57,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 08:58:57,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 08:58:57,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:57,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412855371] [2025-03-03 08:58:57,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412855371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:58:57,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:58:57,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 08:58:57,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193894811] [2025-03-03 08:58:57,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:58:57,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 08:58:57,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:57,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 08:58:57,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 08:58:57,915 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:57,937 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2025-03-03 08:58:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 08:58:57,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-03 08:58:57,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:57,938 INFO L225 Difference]: With dead ends: 64 [2025-03-03 08:58:57,938 INFO L226 Difference]: Without dead ends: 41 [2025-03-03 08:58:57,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 08:58:57,939 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:57,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 46 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:58:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-03 08:58:57,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2025-03-03 08:58:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 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-03-03 08:58:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2025-03-03 08:58:57,943 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 22 [2025-03-03 08:58:57,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:57,943 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-03 08:58:57,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2025-03-03 08:58:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 08:58:57,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:57,943 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:57,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 08:58:57,944 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:57,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1651879382, now seen corresponding path program 1 times [2025-03-03 08:58:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:57,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272765979] [2025-03-03 08:58:57,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:57,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:57,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 08:58:57,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 08:58:57,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 08:58:58,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:58,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272765979] [2025-03-03 08:58:58,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272765979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:58:58,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184186596] [2025-03-03 08:58:58,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:58,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:58,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:58,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:58:58,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 08:58:58,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 08:58:58,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 08:58:58,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:58,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:58,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 08:58:58,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:58:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 08:58:58,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:58:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 08:58:58,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184186596] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:58:58,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:58:58,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-03 08:58:58,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018637762] [2025-03-03 08:58:58,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:58:58,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 08:58:58,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:58,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 08:58:58,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 08:58:58,204 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:58,321 INFO L93 Difference]: Finished difference Result 127 states and 183 transitions. [2025-03-03 08:58:58,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 08:58:58,321 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-03 08:58:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:58,322 INFO L225 Difference]: With dead ends: 127 [2025-03-03 08:58:58,322 INFO L226 Difference]: Without dead ends: 101 [2025-03-03 08:58:58,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 08:58:58,323 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 74 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:58,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 121 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:58:58,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-03 08:58:58,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 48. [2025-03-03 08:58:58,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 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-03-03 08:58:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2025-03-03 08:58:58,335 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 23 [2025-03-03 08:58:58,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:58,335 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2025-03-03 08:58:58,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:58,335 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2025-03-03 08:58:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 08:58:58,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:58,338 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:58,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 08:58:58,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:58,539 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:58,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2031711864, now seen corresponding path program 1 times [2025-03-03 08:58:58,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:58,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926532653] [2025-03-03 08:58:58,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:58,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:58,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 08:58:58,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 08:58:58,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:58,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 08:58:58,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:58,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926532653] [2025-03-03 08:58:58,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926532653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:58:58,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:58:58,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 08:58:58,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044936715] [2025-03-03 08:58:58,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:58:58,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 08:58:58,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:58,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 08:58:58,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 08:58:58,665 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:58,675 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2025-03-03 08:58:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 08:58:58,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-03 08:58:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:58,676 INFO L225 Difference]: With dead ends: 77 [2025-03-03 08:58:58,676 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 08:58:58,676 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-03-03 08:58:58,677 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 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-03-03 08:58:58,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:58:58,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 08:58:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2025-03-03 08:58:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 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-03-03 08:58:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2025-03-03 08:58:58,681 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 35 [2025-03-03 08:58:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:58,682 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2025-03-03 08:58:58,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2025-03-03 08:58:58,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 08:58:58,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:58,682 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:58,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 08:58:58,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:58,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:58,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1839632134, now seen corresponding path program 2 times [2025-03-03 08:58:58,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:58,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823208937] [2025-03-03 08:58:58,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:58:58,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:58,696 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-03 08:58:58,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 08:58:58,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:58:58,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 08:58:58,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:58,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823208937] [2025-03-03 08:58:58,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823208937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:58:58,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98065416] [2025-03-03 08:58:58,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:58:58,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:58,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:58,929 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:58:58,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 08:58:58,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-03 08:58:59,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 08:58:59,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:58:59,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:59,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 08:58:59,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:58:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 08:58:59,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:58:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 08:58:59,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98065416] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:58:59,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:58:59,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-03 08:58:59,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119290943] [2025-03-03 08:58:59,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:58:59,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 08:58:59,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:59,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 08:58:59,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-03 08:58:59,272 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:59,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:59,425 INFO L93 Difference]: Finished difference Result 191 states and 272 transitions. [2025-03-03 08:58:59,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 08:58:59,425 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-03 08:58:59,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:59,426 INFO L225 Difference]: With dead ends: 191 [2025-03-03 08:58:59,426 INFO L226 Difference]: Without dead ends: 152 [2025-03-03 08:58:59,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-03 08:58:59,427 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 165 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:59,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 118 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:58:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-03 08:58:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 64. [2025-03-03 08:58:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 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-03-03 08:58:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2025-03-03 08:58:59,436 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 36 [2025-03-03 08:58:59,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:59,436 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2025-03-03 08:58:59,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:59,436 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2025-03-03 08:58:59,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 08:58:59,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:59,437 INFO L218 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:59,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 08:58:59,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:59,641 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:59,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:59,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1450957434, now seen corresponding path program 3 times [2025-03-03 08:58:59,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:59,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4485315] [2025-03-03 08:58:59,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 08:58:59,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:59,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 12 equivalence classes. [2025-03-03 08:58:59,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 48 statements. [2025-03-03 08:58:59,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 08:58:59,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-03 08:58:59,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:59,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4485315] [2025-03-03 08:58:59,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4485315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:58:59,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188849635] [2025-03-03 08:58:59,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 08:58:59,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:59,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:59,707 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:58:59,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 08:58:59,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 12 equivalence classes. [2025-03-03 08:58:59,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 48 statements. [2025-03-03 08:58:59,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 08:58:59,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:59,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 08:58:59,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:58:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-03 08:58:59,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:58:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-03 08:58:59,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188849635] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:58:59,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:58:59,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-03 08:58:59,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569761416] [2025-03-03 08:58:59,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:58:59,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 08:58:59,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:59,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 08:58:59,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-03 08:58:59,826 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:59,878 INFO L93 Difference]: Finished difference Result 165 states and 221 transitions. [2025-03-03 08:58:59,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 08:58:59,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 08:58:59,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:59,879 INFO L225 Difference]: With dead ends: 165 [2025-03-03 08:58:59,880 INFO L226 Difference]: Without dead ends: 130 [2025-03-03 08:58:59,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-03 08:58:59,880 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 99 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:59,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 88 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:58:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-03 08:58:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2025-03-03 08:58:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 125 states have (on average 1.304) internal successors, (163), 125 states have internal predecessors, (163), 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-03-03 08:58:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2025-03-03 08:58:59,888 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 48 [2025-03-03 08:58:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:59,888 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2025-03-03 08:58:59,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2025-03-03 08:58:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 08:58:59,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:59,889 INFO L218 NwaCegarLoop]: trace histogram [22, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:59,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:00,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:00,093 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:00,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:00,093 INFO L85 PathProgramCache]: Analyzing trace with hash 37092386, now seen corresponding path program 4 times [2025-03-03 08:59:00,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:00,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438143581] [2025-03-03 08:59:00,093 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 08:59:00,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:00,133 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-03-03 08:59:00,158 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 08:59:00,158 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 08:59:00,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-03 08:59:00,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:00,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438143581] [2025-03-03 08:59:00,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438143581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:00,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349874180] [2025-03-03 08:59:00,341 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 08:59:00,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:00,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:00,343 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:59:00,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 08:59:00,443 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-03-03 08:59:00,516 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 08:59:00,516 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 08:59:00,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:00,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 08:59:00,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-03 08:59:00,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-03 08:59:00,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349874180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:00,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:00,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-03 08:59:00,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908285582] [2025-03-03 08:59:00,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:00,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 08:59:00,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:00,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 08:59:00,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-03 08:59:00,689 INFO L87 Difference]: Start difference. First operand 128 states and 165 transitions. Second operand has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:00,783 INFO L93 Difference]: Finished difference Result 353 states and 489 transitions. [2025-03-03 08:59:00,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 08:59:00,783 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 08:59:00,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:00,785 INFO L225 Difference]: With dead ends: 353 [2025-03-03 08:59:00,785 INFO L226 Difference]: Without dead ends: 258 [2025-03-03 08:59:00,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-03 08:59:00,785 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 154 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:00,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 158 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:59:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-03 08:59:00,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2025-03-03 08:59:00,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 253 states have (on average 1.3399209486166008) internal successors, (339), 253 states have internal predecessors, (339), 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-03-03 08:59:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 341 transitions. [2025-03-03 08:59:00,804 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 341 transitions. Word has length 76 [2025-03-03 08:59:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:00,804 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 341 transitions. [2025-03-03 08:59:00,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 341 transitions. [2025-03-03 08:59:00,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 08:59:00,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:00,807 INFO L218 NwaCegarLoop]: trace histogram [22, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:00,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:01,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:01,008 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:01,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:01,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1888938126, now seen corresponding path program 5 times [2025-03-03 08:59:01,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:01,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586403705] [2025-03-03 08:59:01,009 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 08:59:01,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:01,052 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 132 statements into 15 equivalence classes. [2025-03-03 08:59:01,322 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 08:59:01,322 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-03 08:59:01,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 490 proven. 70 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2025-03-03 08:59:03,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:03,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586403705] [2025-03-03 08:59:03,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586403705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:03,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062088451] [2025-03-03 08:59:03,497 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 08:59:03,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:03,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:03,500 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:59:03,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 08:59:03,639 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 132 statements into 15 equivalence classes.