./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-industry-pattern/array_single_elem_init.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-industry-pattern/array_single_elem_init.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 783ac259376d0d4b331b84c9ee3bd0ed2042af56d21e98db70a8bebb07aee3c2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:20:32,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:20:32,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:20:32,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:20:32,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:20:32,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:20:32,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:20:32,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:20:32,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:20:32,470 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:20:32,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:20:32,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:20:32,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:20:32,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:20:32,471 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:20:32,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:20:32,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:20:32,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:20:32,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:20:32,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:20:32,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:20:32,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:20:32,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:20:32,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:20:32,472 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:20:32,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:20:32,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:20:32,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:20:32,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:20:32,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:20:32,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:20:32,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:20:32,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:20:32,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:20:32,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:20:32,473 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:20:32,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:20:32,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:20:32,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:20:32,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:20:32,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:20:32,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:20:32,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:20:32,473 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 -> 783ac259376d0d4b331b84c9ee3bd0ed2042af56d21e98db70a8bebb07aee3c2 [2025-03-08 00:20:32,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:20:32,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:20:32,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:20:32,702 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:20:32,702 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:20:32,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_single_elem_init.i [2025-03-08 00:20:33,811 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0697fda/ca77d33087f24dc2a0736b1acdc340ed/FLAG07c319343 [2025-03-08 00:20:34,025 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:20:34,026 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_single_elem_init.i [2025-03-08 00:20:34,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0697fda/ca77d33087f24dc2a0736b1acdc340ed/FLAG07c319343 [2025-03-08 00:20:34,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0697fda/ca77d33087f24dc2a0736b1acdc340ed [2025-03-08 00:20:34,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:20:34,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:20:34,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:20:34,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:20:34,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:20:34,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:20:34" (1/1) ... [2025-03-08 00:20:34,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcac6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:20:34, skipping insertion in model container [2025-03-08 00:20:34,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:20:34" (1/1) ... [2025-03-08 00:20:34,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:20:34,495 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-industry-pattern/array_single_elem_init.i[815,828] [2025-03-08 00:20:34,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:20:34,516 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:20:34,525 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-industry-pattern/array_single_elem_init.i[815,828] [2025-03-08 00:20:34,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:20:34,543 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:20:34,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:20:34 WrapperNode [2025-03-08 00:20:34,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:20:34,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:20:34,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:20:34,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:20:34,550 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:20:34" (1/1) ... [2025-03-08 00:20:34,554 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:20:34" (1/1) ... [2025-03-08 00:20:34,567 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2025-03-08 00:20:34,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:20:34,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:20:34,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:20:34,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:20:34,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:20:34" (1/1) ... [2025-03-08 00:20:34,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:20:34" (1/1) ... [2025-03-08 00:20:34,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:20:34" (1/1) ... [2025-03-08 00:20:34,588 INFO L175 MemorySlicer]: Split 11 memory accesses to 4 slices as follows [2, 4, 2, 3]. 36 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 6 writes are split as follows [0, 3, 1, 2]. [2025-03-08 00:20:34,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:20:34" (1/1) ... [2025-03-08 00:20:34,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:20:34" (1/1) ... [2025-03-08 00:20:34,596 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:20:34" (1/1) ... [2025-03-08 00:20:34,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:20:34" (1/1) ... [2025-03-08 00:20:34,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:20:34" (1/1) ... [2025-03-08 00:20:34,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:20:34" (1/1) ... [2025-03-08 00:20:34,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:20:34,605 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:20:34,605 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:20:34,606 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:20:34,606 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:20:34" (1/1) ... [2025-03-08 00:20:34,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:20:34,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:20:34,629 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:20:34,631 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:20:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:20:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:20:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:20:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:20:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 00:20:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:20:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:20:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:20:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:20:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 00:20:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:20:34,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:20:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:20:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:20:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:20:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 00:20:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:20:34,705 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:20:34,706 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:20:34,818 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2025-03-08 00:20:34,822 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 00:20:34,822 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:20:34,829 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:20:34,830 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:20:34,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:20:34 BoogieIcfgContainer [2025-03-08 00:20:34,830 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:20:34,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:20:34,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:20:34,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:20:34,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:20:34" (1/3) ... [2025-03-08 00:20:34,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456d107f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:20:34, skipping insertion in model container [2025-03-08 00:20:34,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:20:34" (2/3) ... [2025-03-08 00:20:34,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456d107f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:20:34, skipping insertion in model container [2025-03-08 00:20:34,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:20:34" (3/3) ... [2025-03-08 00:20:34,839 INFO L128 eAbstractionObserver]: Analyzing ICFG array_single_elem_init.i [2025-03-08 00:20:34,850 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:20:34,851 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array_single_elem_init.i that has 1 procedures, 18 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 00:20:34,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:20:34,899 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;@c325ac0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:20:34,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:20:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:34,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 00:20:34,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:20:34,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:20:34,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:20:34,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:20:34,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2056061494, now seen corresponding path program 1 times [2025-03-08 00:20:34,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:20:34,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270190903] [2025-03-08 00:20:34,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:20:34,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:20:34,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 00:20:34,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 00:20:34,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:20:34,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:20:35,092 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:20:35,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:20:35,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270190903] [2025-03-08 00:20:35,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270190903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:20:35,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:20:35,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:20:35,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369215162] [2025-03-08 00:20:35,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:20:35,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:20:35,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:20:35,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:20:35,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:20:35,113 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:35,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:20:35,172 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2025-03-08 00:20:35,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:20:35,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 00:20:35,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:20:35,178 INFO L225 Difference]: With dead ends: 37 [2025-03-08 00:20:35,178 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 00:20:35,182 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:20:35,184 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:20:35,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 21 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:20:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 00:20:35,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2025-03-08 00:20:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2025-03-08 00:20:35,211 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 7 [2025-03-08 00:20:35,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:20:35,211 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-03-08 00:20:35,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:35,212 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2025-03-08 00:20:35,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 00:20:35,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:20:35,212 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:20:35,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:20:35,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:20:35,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:20:35,214 INFO L85 PathProgramCache]: Analyzing trace with hash -598537082, now seen corresponding path program 1 times [2025-03-08 00:20:35,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:20:35,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748895817] [2025-03-08 00:20:35,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:20:35,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:20:35,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 00:20:35,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:20:35,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:20:35,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:20:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:20:35,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:20:35,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748895817] [2025-03-08 00:20:35,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748895817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:20:35,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:20:35,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:20:35,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30126151] [2025-03-08 00:20:35,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:20:35,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:20:35,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:20:35,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:20:35,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:20:35,396 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:20:35,439 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2025-03-08 00:20:35,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:20:35,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 00:20:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:20:35,440 INFO L225 Difference]: With dead ends: 37 [2025-03-08 00:20:35,440 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 00:20:35,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:20:35,441 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:20:35,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 37 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:20:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 00:20:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-03-08 00:20:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-08 00:20:35,443 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2025-03-08 00:20:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:20:35,444 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-08 00:20:35,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:35,444 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-03-08 00:20:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 00:20:35,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:20:35,444 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:20:35,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:20:35,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:20:35,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:20:35,445 INFO L85 PathProgramCache]: Analyzing trace with hash -469454363, now seen corresponding path program 1 times [2025-03-08 00:20:35,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:20:35,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330575607] [2025-03-08 00:20:35,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:20:35,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:20:35,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 00:20:35,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:20:35,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:20:35,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:20:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:20:35,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:20:35,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330575607] [2025-03-08 00:20:35,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330575607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:20:35,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663743613] [2025-03-08 00:20:35,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:20:35,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:20:35,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:20:35,515 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:20:35,517 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:20:35,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 00:20:35,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:20:35,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:20:35,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:20:35,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:20:35,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:20:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:20:35,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:20:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:20:35,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663743613] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:20:35,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:20:35,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:20:35,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836222075] [2025-03-08 00:20:35,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:20:35,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:20:35,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:20:35,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:20:35,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:20:35,642 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:35,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:20:35,726 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2025-03-08 00:20:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:20:35,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 00:20:35,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:20:35,726 INFO L225 Difference]: With dead ends: 61 [2025-03-08 00:20:35,726 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 00:20:35,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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:20:35,727 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 67 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:20:35,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 30 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:20:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 00:20:35,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2025-03-08 00:20:35,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2025-03-08 00:20:35,731 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 15 [2025-03-08 00:20:35,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:20:35,731 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2025-03-08 00:20:35,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2025-03-08 00:20:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 00:20:35,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:20:35,732 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-08 00:20:35,738 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:20:35,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:20:35,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:20:35,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:20:35,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1666383338, now seen corresponding path program 2 times [2025-03-08 00:20:35,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:20:35,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39136863] [2025-03-08 00:20:35,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:20:35,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:20:35,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-08 00:20:35,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:20:35,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:20:35,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:20:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:20:36,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:20:36,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39136863] [2025-03-08 00:20:36,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39136863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:20:36,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42633875] [2025-03-08 00:20:36,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:20:36,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:20:36,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:20:36,055 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:20:36,057 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:20:36,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-08 00:20:36,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:20:36,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:20:36,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:20:36,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:20:36,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:20:36,163 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:20:36,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:20:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:20:36,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42633875] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:20:36,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:20:36,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-08 00:20:36,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830705286] [2025-03-08 00:20:36,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:20:36,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:20:36,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:20:36,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:20:36,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:20:36,231 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:20:36,369 INFO L93 Difference]: Finished difference Result 130 states and 176 transitions. [2025-03-08 00:20:36,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:20:36,370 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-08 00:20:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:20:36,373 INFO L225 Difference]: With dead ends: 130 [2025-03-08 00:20:36,374 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 00:20:36,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:20:36,374 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 133 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:20:36,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 40 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:20:36,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 00:20:36,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 104. [2025-03-08 00:20:36,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:36,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2025-03-08 00:20:36,383 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 33 [2025-03-08 00:20:36,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:20:36,383 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2025-03-08 00:20:36,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2025-03-08 00:20:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 00:20:36,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:20:36,384 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2025-03-08 00:20:36,391 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:20:36,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 00:20:36,589 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:20:36,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:20:36,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1415519563, now seen corresponding path program 3 times [2025-03-08 00:20:36,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:20:36,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186157658] [2025-03-08 00:20:36,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:20:36,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:20:36,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 11 equivalence classes. [2025-03-08 00:20:36,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 47 of 72 statements. [2025-03-08 00:20:36,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:20:36,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:20:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 00:20:36,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:20:36,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186157658] [2025-03-08 00:20:36,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186157658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:20:36,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945293168] [2025-03-08 00:20:36,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:20:36,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:20:36,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:20:36,752 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:20:36,754 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:20:36,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 11 equivalence classes. [2025-03-08 00:20:36,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 47 of 72 statements. [2025-03-08 00:20:36,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:20:36,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:20:36,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:20:36,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:20:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 00:20:36,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:20:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 00:20:36,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945293168] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:20:36,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:20:36,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-08 00:20:36,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017950547] [2025-03-08 00:20:36,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:20:36,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:20:36,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:20:36,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:20:36,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:20:36,962 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:20:37,137 INFO L93 Difference]: Finished difference Result 170 states and 221 transitions. [2025-03-08 00:20:37,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:20:37,138 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-08 00:20:37,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:20:37,139 INFO L225 Difference]: With dead ends: 170 [2025-03-08 00:20:37,141 INFO L226 Difference]: Without dead ends: 149 [2025-03-08 00:20:37,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:20:37,142 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 242 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:20:37,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 49 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:20:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-08 00:20:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 141. [2025-03-08 00:20:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 179 transitions. [2025-03-08 00:20:37,156 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 179 transitions. Word has length 72 [2025-03-08 00:20:37,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:20:37,158 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 179 transitions. [2025-03-08 00:20:37,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 179 transitions. [2025-03-08 00:20:37,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 00:20:37,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:20:37,159 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2025-03-08 00:20:37,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:20:37,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:20:37,360 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:20:37,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:20:37,360 INFO L85 PathProgramCache]: Analyzing trace with hash -880436598, now seen corresponding path program 4 times [2025-03-08 00:20:37,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:20:37,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716529317] [2025-03-08 00:20:37,360 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:20:37,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:20:37,373 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 103 statements into 2 equivalence classes. [2025-03-08 00:20:37,387 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 00:20:37,387 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:20:37,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:20:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-08 00:20:37,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:20:37,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716529317] [2025-03-08 00:20:37,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716529317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:20:37,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007141662] [2025-03-08 00:20:37,659 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:20:37,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:20:37,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:20:37,661 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:20:37,662 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:20:37,703 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 103 statements into 2 equivalence classes. [2025-03-08 00:20:37,730 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 00:20:37,730 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:20:37,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:20:37,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 00:20:37,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:20:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-08 00:20:37,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:20:38,102 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-08 00:20:38,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007141662] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:20:38,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:20:38,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2025-03-08 00:20:38,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556598432] [2025-03-08 00:20:38,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:20:38,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 00:20:38,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:20:38,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 00:20:38,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2025-03-08 00:20:38,106 INFO L87 Difference]: Start difference. First operand 141 states and 179 transitions. Second operand has 28 states, 28 states have (on average 4.678571428571429) internal successors, (131), 28 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:38,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:20:38,432 INFO L93 Difference]: Finished difference Result 336 states and 444 transitions. [2025-03-08 00:20:38,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 00:20:38,433 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.678571428571429) internal successors, (131), 28 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-08 00:20:38,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:20:38,436 INFO L225 Difference]: With dead ends: 336 [2025-03-08 00:20:38,438 INFO L226 Difference]: Without dead ends: 294 [2025-03-08 00:20:38,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2025-03-08 00:20:38,439 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 615 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:20:38,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 75 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:20:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-08 00:20:38,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 256. [2025-03-08 00:20:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.3176470588235294) internal successors, (336), 255 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:38,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 336 transitions. [2025-03-08 00:20:38,449 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 336 transitions. Word has length 103 [2025-03-08 00:20:38,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:20:38,450 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 336 transitions. [2025-03-08 00:20:38,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.678571428571429) internal successors, (131), 28 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:38,450 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 336 transitions. [2025-03-08 00:20:38,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 00:20:38,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:20:38,452 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 26, 26, 14, 13, 13, 1, 1, 1, 1, 1, 1] [2025-03-08 00:20:38,457 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:20:38,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:20:38,652 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:20:38,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:20:38,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2101174837, now seen corresponding path program 5 times [2025-03-08 00:20:38,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:20:38,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345059000] [2025-03-08 00:20:38,653 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:20:38,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:20:38,671 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 176 statements into 27 equivalence classes. [2025-03-08 00:20:38,726 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 00:20:38,726 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2025-03-08 00:20:38,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:20:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-08 00:20:39,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:20:39,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345059000] [2025-03-08 00:20:39,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345059000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:20:39,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568553680] [2025-03-08 00:20:39,442 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:20:39,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:20:39,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:20:39,446 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:20:39,448 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:20:39,508 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 176 statements into 27 equivalence classes. [2025-03-08 00:20:40,096 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 00:20:40,096 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2025-03-08 00:20:40,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:20:40,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 00:20:40,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:20:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-08 00:20:40,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:20:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-08 00:20:41,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568553680] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:20:41,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:20:41,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 56 [2025-03-08 00:20:41,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298741416] [2025-03-08 00:20:41,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:20:41,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-08 00:20:41,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:20:41,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-08 00:20:41,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2025-03-08 00:20:41,130 INFO L87 Difference]: Start difference. First operand 256 states and 336 transitions. Second operand has 56 states, 56 states have (on average 4.839285714285714) internal successors, (271), 56 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:20:41,966 INFO L93 Difference]: Finished difference Result 647 states and 880 transitions. [2025-03-08 00:20:41,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-08 00:20:41,966 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 4.839285714285714) internal successors, (271), 56 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2025-03-08 00:20:41,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:20:41,968 INFO L225 Difference]: With dead ends: 647 [2025-03-08 00:20:41,968 INFO L226 Difference]: Without dead ends: 602 [2025-03-08 00:20:41,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2025-03-08 00:20:41,969 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 1122 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:20:41,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 148 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:20:41,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-08 00:20:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 522. [2025-03-08 00:20:41,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.3166986564299423) internal successors, (686), 521 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 686 transitions. [2025-03-08 00:20:41,986 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 686 transitions. Word has length 176 [2025-03-08 00:20:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:20:41,986 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 686 transitions. [2025-03-08 00:20:41,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 4.839285714285714) internal successors, (271), 56 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:20:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 686 transitions. [2025-03-08 00:20:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-08 00:20:41,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:20:41,993 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 54, 54, 28, 27, 27, 1, 1, 1, 1, 1, 1] [2025-03-08 00:20:42,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:20:42,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:20:42,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:20:42,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:20:42,199 INFO L85 PathProgramCache]: Analyzing trace with hash -14148267, now seen corresponding path program 6 times [2025-03-08 00:20:42,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:20:42,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024411789] [2025-03-08 00:20:42,199 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:20:42,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:20:42,225 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 358 statements into 55 equivalence classes. [2025-03-08 00:20:42,402 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) and asserted 358 of 358 statements. [2025-03-08 00:20:42,402 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2025-03-08 00:20:42,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:20:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8316 backedges. 0 proven. 7209 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2025-03-08 00:20:44,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:20:44,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024411789] [2025-03-08 00:20:44,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024411789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:20:44,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821490028] [2025-03-08 00:20:44,489 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:20:44,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:20:44,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:20:44,491 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:20:44,493 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:20:44,576 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 358 statements into 55 equivalence classes.