./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_ground-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-1.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 4c9c46abbea18888bba6501dfe6c704a11e8fe399c985999e1e07c66bb12b728 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:08:23,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:08:23,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:08:23,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:08:23,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:08:23,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:08:23,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:08:23,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:08:23,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:08:23,086 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:08:23,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:08:23,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:08:23,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:08:23,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:08:23,087 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:08:23,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:08:23,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:08:23,087 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:08:23,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:08:23,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:08:23,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:08:23,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:08:23,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:08:23,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:08:23,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:08:23,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:08:23,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:08:23,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:08:23,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:08:23,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:08:23,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:08:23,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:08:23,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:08:23,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:08:23,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:08:23,089 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:08:23,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:08:23,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:08:23,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:08:23,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:08:23,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:08:23,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:08:23,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:08:23,089 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 -> 4c9c46abbea18888bba6501dfe6c704a11e8fe399c985999e1e07c66bb12b728 [2025-03-08 00:08:23,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:08:23,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:08:23,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:08:23,356 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:08:23,356 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:08:23,358 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-1.i [2025-03-08 00:08:24,591 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d122cc7/c4897511409f4c449d4df336b72e3020/FLAG952fa2772 [2025-03-08 00:08:24,816 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:08:24,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_ground-1.i [2025-03-08 00:08:24,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d122cc7/c4897511409f4c449d4df336b72e3020/FLAG952fa2772 [2025-03-08 00:08:24,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d122cc7/c4897511409f4c449d4df336b72e3020 [2025-03-08 00:08:24,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:08:24,863 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:08:24,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:08:24,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:08:24,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:08:24,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:08:24" (1/1) ... [2025-03-08 00:08:24,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f4d50a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:24, skipping insertion in model container [2025-03-08 00:08:24,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:08:24" (1/1) ... [2025-03-08 00:08:24,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:08:25,035 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-1.i[832,845] [2025-03-08 00:08:25,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:08:25,070 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:08:25,077 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-1.i[832,845] [2025-03-08 00:08:25,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:08:25,107 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:08:25,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:25 WrapperNode [2025-03-08 00:08:25,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:08:25,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:08:25,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:08:25,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:08:25,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:25" (1/1) ... [2025-03-08 00:08:25,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:25" (1/1) ... [2025-03-08 00:08:25,141 INFO L138 Inliner]: procedures = 18, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2025-03-08 00:08:25,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:08:25,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:08:25,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:08:25,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:08:25,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:25" (1/1) ... [2025-03-08 00:08:25,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:25" (1/1) ... [2025-03-08 00:08:25,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:25" (1/1) ... [2025-03-08 00:08:25,175 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 3, 7]. 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, 1, 2]. [2025-03-08 00:08:25,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:25" (1/1) ... [2025-03-08 00:08:25,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:25" (1/1) ... [2025-03-08 00:08:25,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:25" (1/1) ... [2025-03-08 00:08:25,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:25" (1/1) ... [2025-03-08 00:08:25,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:25" (1/1) ... [2025-03-08 00:08:25,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:25" (1/1) ... [2025-03-08 00:08:25,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:08:25,186 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:08:25,186 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:08:25,186 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:08:25,187 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:25" (1/1) ... [2025-03-08 00:08:25,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:08:25,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:08:25,220 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-08 00:08:25,223 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-08 00:08:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:08:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:08:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:08:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:08:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:08:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:08:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:08:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:08:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:08:25,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:08:25,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:08:25,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:08:25,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:08:25,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 00:08:25,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 00:08:25,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:08:25,312 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:08:25,314 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:08:25,500 INFO L1307 $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-08 00:08:25,528 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-08 00:08:25,528 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:08:25,541 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:08:25,542 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:08:25,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:08:25 BoogieIcfgContainer [2025-03-08 00:08:25,542 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:08:25,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:08:25,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:08:25,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:08:25,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:08:24" (1/3) ... [2025-03-08 00:08:25,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38729e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:08:25, skipping insertion in model container [2025-03-08 00:08:25,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:08:25" (2/3) ... [2025-03-08 00:08:25,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38729e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:08:25, skipping insertion in model container [2025-03-08 00:08:25,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:08:25" (3/3) ... [2025-03-08 00:08:25,551 INFO L128 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_ground-1.i [2025-03-08 00:08:25,563 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:08:25,565 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG data_structures_set_multi_proc_ground-1.i that has 2 procedures, 28 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2025-03-08 00:08:25,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:08:25,622 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;@4d8073b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:08:25,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:08:25,627 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-08 00:08:25,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 00:08:25,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:25,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:08:25,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:25,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:25,637 INFO L85 PathProgramCache]: Analyzing trace with hash 197479259, now seen corresponding path program 1 times [2025-03-08 00:08:25,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:25,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874842958] [2025-03-08 00:08:25,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:08:25,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:25,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:08:25,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:08:25,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:08:25,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:25,790 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-08 00:08:25,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:25,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874842958] [2025-03-08 00:08:25,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874842958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:08:25,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:08:25,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:08:25,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051847486] [2025-03-08 00:08:25,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:08:25,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:08:25,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:25,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:08:25,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:08:25,817 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-08 00:08:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:25,874 INFO L93 Difference]: Finished difference Result 62 states and 94 transitions. [2025-03-08 00:08:25,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:08:25,876 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-08 00:08:25,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:25,880 INFO L225 Difference]: With dead ends: 62 [2025-03-08 00:08:25,880 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 00:08:25,882 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-08 00:08:25,884 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-08 00:08:25,888 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-08 00:08:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 00:08:25,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2025-03-08 00:08:25,919 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-08 00:08:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2025-03-08 00:08:25,923 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 9 [2025-03-08 00:08:25,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:25,924 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-03-08 00:08:25,924 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-08 00:08:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2025-03-08 00:08:25,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 00:08:25,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:25,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:08:25,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:08:25,925 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:25,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:25,926 INFO L85 PathProgramCache]: Analyzing trace with hash 177133945, now seen corresponding path program 1 times [2025-03-08 00:08:25,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:25,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455686320] [2025-03-08 00:08:25,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:08:25,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:25,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:08:25,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:08:25,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:08:25,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:26,016 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-08 00:08:26,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:26,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455686320] [2025-03-08 00:08:26,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455686320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:08:26,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815330508] [2025-03-08 00:08:26,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:08:26,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:08:26,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:08:26,019 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-08 00:08:26,019 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-08 00:08:26,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:08:26,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:08:26,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:08:26,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:26,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:08:26,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:08:26,104 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-08 00:08:26,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:08:26,140 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-08 00:08:26,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815330508] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:08:26,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:08:26,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:08:26,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328846263] [2025-03-08 00:08:26,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:08:26,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:08:26,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:26,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:08:26,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:08:26,142 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-08 00:08:26,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:26,251 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2025-03-08 00:08:26,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:08:26,252 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-08 00:08:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:26,253 INFO L225 Difference]: With dead ends: 83 [2025-03-08 00:08:26,254 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 00:08:26,254 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-08 00:08:26,255 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-08 00:08:26,256 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-08 00:08:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 00:08:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 29. [2025-03-08 00:08:26,264 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-08 00:08:26,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2025-03-08 00:08:26,265 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 10 [2025-03-08 00:08:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:26,265 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2025-03-08 00:08:26,266 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-08 00:08:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2025-03-08 00:08:26,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:08:26,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:26,267 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:08:26,275 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-08 00:08:26,472 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-08 00:08:26,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:26,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:26,473 INFO L85 PathProgramCache]: Analyzing trace with hash 952558299, now seen corresponding path program 2 times [2025-03-08 00:08:26,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:26,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798034065] [2025-03-08 00:08:26,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:08:26,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:26,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-08 00:08:26,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-03-08 00:08:26,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 00:08:26,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:26,587 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-08 00:08:26,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:26,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798034065] [2025-03-08 00:08:26,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798034065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:08:26,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:08:26,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:08:26,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051572332] [2025-03-08 00:08:26,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:08:26,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:08:26,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:26,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:08:26,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:08:26,589 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-08 00:08:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:26,618 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2025-03-08 00:08:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:08:26,618 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-08 00:08:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:26,619 INFO L225 Difference]: With dead ends: 55 [2025-03-08 00:08:26,619 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 00:08:26,620 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-08 00:08:26,620 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-08 00:08:26,621 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-08 00:08:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 00:08:26,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 00:08:26,624 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-08 00:08:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-03-08 00:08:26,625 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 13 [2025-03-08 00:08:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:26,625 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-08 00:08:26,625 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-08 00:08:26,626 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-03-08 00:08:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 00:08:26,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:26,626 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-08 00:08:26,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:08:26,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:26,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:26,627 INFO L85 PathProgramCache]: Analyzing trace with hash -927246672, now seen corresponding path program 1 times [2025-03-08 00:08:26,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:26,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854464684] [2025-03-08 00:08:26,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:08:26,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:26,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 00:08:26,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:08:26,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:08:26,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:26,751 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-08 00:08:26,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:26,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854464684] [2025-03-08 00:08:26,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854464684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:08:26,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:08:26,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:08:26,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386514839] [2025-03-08 00:08:26,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:08:26,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:08:26,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:26,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:08:26,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:08:26,752 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-08 00:08:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:26,767 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2025-03-08 00:08:26,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:08:26,768 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-08 00:08:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:26,768 INFO L225 Difference]: With dead ends: 64 [2025-03-08 00:08:26,769 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 00:08:26,769 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-08 00:08:26,769 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-08 00:08:26,770 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-08 00:08:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 00:08:26,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2025-03-08 00:08:26,775 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-08 00:08:26,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2025-03-08 00:08:26,777 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 22 [2025-03-08 00:08:26,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:26,778 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-08 00:08:26,778 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-08 00:08:26,778 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2025-03-08 00:08:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 00:08:26,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:26,778 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-08 00:08:26,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:08:26,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:26,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:26,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1651879382, now seen corresponding path program 1 times [2025-03-08 00:08:26,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:26,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372527890] [2025-03-08 00:08:26,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:08:26,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:26,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 00:08:26,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:08:26,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:08:26,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:26,896 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-08 00:08:26,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:26,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372527890] [2025-03-08 00:08:26,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372527890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:08:26,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383407350] [2025-03-08 00:08:26,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:08:26,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:08:26,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:08:26,899 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-08 00:08:26,901 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-08 00:08:26,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 00:08:26,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:08:26,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:08:26,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:26,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:08:26,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:08:27,036 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-08 00:08:27,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:08:27,108 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-08 00:08:27,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383407350] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:08:27,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:08:27,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-08 00:08:27,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880879017] [2025-03-08 00:08:27,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:08:27,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:08:27,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:27,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:08:27,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:08:27,112 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-08 00:08:27,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:27,245 INFO L93 Difference]: Finished difference Result 127 states and 183 transitions. [2025-03-08 00:08:27,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:08:27,246 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-08 00:08:27,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:27,247 INFO L225 Difference]: With dead ends: 127 [2025-03-08 00:08:27,247 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 00:08:27,247 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-08 00:08:27,248 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-08 00:08:27,248 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-08 00:08:27,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 00:08:27,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 48. [2025-03-08 00:08:27,253 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-08 00:08:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2025-03-08 00:08:27,254 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 23 [2025-03-08 00:08:27,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:27,254 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2025-03-08 00:08:27,254 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-08 00:08:27,254 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2025-03-08 00:08:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:08:27,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:27,255 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-08 00:08:27,261 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-08 00:08:27,456 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-08 00:08:27,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:27,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:27,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2031711864, now seen corresponding path program 1 times [2025-03-08 00:08:27,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:27,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254976877] [2025-03-08 00:08:27,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:08:27,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:27,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 00:08:27,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:08:27,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:08:27,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:27,628 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-08 00:08:27,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:27,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254976877] [2025-03-08 00:08:27,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254976877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:08:27,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:08:27,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:08:27,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992766246] [2025-03-08 00:08:27,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:08:27,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:08:27,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:27,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:08:27,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:08:27,630 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-08 00:08:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:27,646 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2025-03-08 00:08:27,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:08:27,646 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-08 00:08:27,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:27,647 INFO L225 Difference]: With dead ends: 65 [2025-03-08 00:08:27,647 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 00:08:27,647 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-08 00:08:27,648 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:08:27,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:08:27,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 00:08:27,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 00:08:27,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 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-08 00:08:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-03-08 00:08:27,656 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 35 [2025-03-08 00:08:27,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:27,657 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-03-08 00:08:27,657 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-08 00:08:27,657 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-03-08 00:08:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 00:08:27,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:27,658 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-08 00:08:27,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 00:08:27,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:27,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:27,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1839632134, now seen corresponding path program 2 times [2025-03-08 00:08:27,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:27,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860942593] [2025-03-08 00:08:27,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:08:27,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:27,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-08 00:08:27,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 00:08:27,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:08:27,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:27,936 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-08 00:08:27,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:27,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860942593] [2025-03-08 00:08:27,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860942593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:08:27,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578987032] [2025-03-08 00:08:27,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:08:27,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:08:27,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:08:27,939 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-08 00:08:27,941 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-08 00:08:27,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-08 00:08:28,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 00:08:28,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:08:28,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:28,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:08:28,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:08:28,076 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-08 00:08:28,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:08:28,312 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-08 00:08:28,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578987032] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:08:28,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:08:28,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-08 00:08:28,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495703902] [2025-03-08 00:08:28,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:08:28,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:08:28,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:28,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:08:28,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:08:28,314 INFO L87 Difference]: Start difference. First operand 42 states and 50 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-08 00:08:28,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:28,506 INFO L93 Difference]: Finished difference Result 171 states and 242 transitions. [2025-03-08 00:08:28,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:08:28,508 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-08 00:08:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:28,512 INFO L225 Difference]: With dead ends: 171 [2025-03-08 00:08:28,512 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 00:08:28,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:08:28,513 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:08:28,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 156 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:08:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 00:08:28,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 54. [2025-03-08 00:08:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 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-08 00:08:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2025-03-08 00:08:28,528 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 36 [2025-03-08 00:08:28,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:28,532 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2025-03-08 00:08:28,532 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-08 00:08:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2025-03-08 00:08:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:08:28,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:28,533 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-08 00:08:28,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 00:08:28,733 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-08 00:08:28,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:28,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:28,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1450957434, now seen corresponding path program 3 times [2025-03-08 00:08:28,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:28,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001386983] [2025-03-08 00:08:28,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:08:28,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:28,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 12 equivalence classes. [2025-03-08 00:08:28,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 48 statements. [2025-03-08 00:08:28,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:08:28,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:28,819 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-08 00:08:28,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:28,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001386983] [2025-03-08 00:08:28,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001386983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:08:28,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082261247] [2025-03-08 00:08:28,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:08:28,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:08:28,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:08:28,822 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-08 00:08:28,826 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-08 00:08:28,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 12 equivalence classes. [2025-03-08 00:08:28,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 48 statements. [2025-03-08 00:08:28,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:08:28,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:28,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:08:28,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:08:28,931 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-08 00:08:28,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:08:28,956 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-08 00:08:28,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082261247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:08:28,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:08:28,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-08 00:08:28,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693003004] [2025-03-08 00:08:28,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:08:28,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:08:28,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:28,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:08:28,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:08:28,957 INFO L87 Difference]: Start difference. First operand 54 states and 62 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-08 00:08:29,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:29,016 INFO L93 Difference]: Finished difference Result 111 states and 141 transitions. [2025-03-08 00:08:29,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:08:29,017 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-08 00:08:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:29,017 INFO L225 Difference]: With dead ends: 111 [2025-03-08 00:08:29,017 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 00:08:29,017 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-08 00:08:29,018 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 80 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:08:29,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 96 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:08:29,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 00:08:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-08 00:08:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 83 states have internal predecessors, (100), 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-08 00:08:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2025-03-08 00:08:29,024 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 48 [2025-03-08 00:08:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:29,025 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2025-03-08 00:08:29,025 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-08 00:08:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2025-03-08 00:08:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 00:08:29,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:29,026 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-08 00:08:29,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 00:08:29,230 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-08 00:08:29,230 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:29,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:29,231 INFO L85 PathProgramCache]: Analyzing trace with hash 37092386, now seen corresponding path program 4 times [2025-03-08 00:08:29,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:29,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292777595] [2025-03-08 00:08:29,231 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:08:29,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:29,261 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-03-08 00:08:29,281 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 00:08:29,281 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:08:29,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:29,456 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-08 00:08:29,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:29,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292777595] [2025-03-08 00:08:29,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292777595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:08:29,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856801716] [2025-03-08 00:08:29,457 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:08:29,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:08:29,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:08:29,459 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-08 00:08:29,461 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-08 00:08:29,586 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-03-08 00:08:29,673 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 00:08:29,674 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:08:29,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:29,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:08:29,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:08:29,733 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-08 00:08:29,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:08:29,850 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-08 00:08:29,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856801716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:08:29,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:08:29,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-08 00:08:29,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999329263] [2025-03-08 00:08:29,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:08:29,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:08:29,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:08:29,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:08:29,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:08:29,852 INFO L87 Difference]: Start difference. First operand 86 states and 102 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-08 00:08:29,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:08:29,963 INFO L93 Difference]: Finished difference Result 203 states and 265 transitions. [2025-03-08 00:08:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:08:29,963 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-08 00:08:29,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:08:29,964 INFO L225 Difference]: With dead ends: 203 [2025-03-08 00:08:29,964 INFO L226 Difference]: Without dead ends: 150 [2025-03-08 00:08:29,965 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-08 00:08:29,965 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 115 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:08:29,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 144 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:08:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-08 00:08:29,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-03-08 00:08:29,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 147 states have (on average 1.2244897959183674) internal successors, (180), 147 states have internal predecessors, (180), 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-08 00:08:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 182 transitions. [2025-03-08 00:08:29,977 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 182 transitions. Word has length 76 [2025-03-08 00:08:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:08:29,977 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 182 transitions. [2025-03-08 00:08:29,977 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-08 00:08:29,977 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 182 transitions. [2025-03-08 00:08:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 00:08:29,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:08:29,979 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-08 00:08:29,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 00:08:30,179 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-08 00:08:30,180 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:08:30,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:08:30,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1888938126, now seen corresponding path program 5 times [2025-03-08 00:08:30,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:08:30,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490082581] [2025-03-08 00:08:30,181 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:08:30,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:08:30,235 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 132 statements into 15 equivalence classes. [2025-03-08 00:08:30,573 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 00:08:30,573 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-08 00:08:30,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:08:33,441 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-08 00:08:33,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:08:33,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490082581] [2025-03-08 00:08:33,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490082581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:08:33,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681952057] [2025-03-08 00:08:33,441 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:08:33,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:08:33,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:08:33,444 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-08 00:08:33,446 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-08 00:08:33,626 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 132 statements into 15 equivalence classes.