./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/array-examples/relax-2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/array-examples/relax-2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56e9aa9f750ced23bf75100b2ff89e86c96f8abe4883dfab569153879bc59aef --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:08:08,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:08:08,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-30 10:08:08,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:08:08,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:08:08,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:08:08,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:08:08,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:08:08,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:08:08,743 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:08:08,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:08:08,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:08:08,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:08:08,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:08:08,743 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:08:08,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:08:08,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:08:08,744 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:08:08,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:08:08,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:08:08,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:08:08,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:08:08,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:08:08,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:08:08,744 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:08:08,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:08:08,744 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:08:08,745 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:08:08,745 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:08:08,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:08:08,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:08:08,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:08:08,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:08:08,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:08:08,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:08:08,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:08:08,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:08:08,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:08:08,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:08:08,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:08:08,746 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:08:08,746 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:08:08,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:08:08,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:08:08,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:08:08,746 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:08:08,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:08:08,746 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 -> 56e9aa9f750ced23bf75100b2ff89e86c96f8abe4883dfab569153879bc59aef [2025-04-30 10:08:08,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:08:08,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:08:08,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:08:08,973 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:08:08,973 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:08:08,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/relax-2-2.i [2025-04-30 10:08:10,316 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e41241e8/21bbb55c15f54101a25c15224442a5e8/FLAG694e15e7c [2025-04-30 10:08:10,562 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:08:10,564 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/relax-2-2.i [2025-04-30 10:08:10,575 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e41241e8/21bbb55c15f54101a25c15224442a5e8/FLAG694e15e7c [2025-04-30 10:08:11,315 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e41241e8/21bbb55c15f54101a25c15224442a5e8 [2025-04-30 10:08:11,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:08:11,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:08:11,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:08:11,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:08:11,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:08:11,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e02898e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11, skipping insertion in model container [2025-04-30 10:08:11,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:08:11,504 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-examples/relax-2-2.i[982,995] [2025-04-30 10:08:11,632 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:08:11,643 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:08:11,661 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-examples/relax-2-2.i[982,995] [2025-04-30 10:08:11,698 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:08:11,714 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:08:11,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11 WrapperNode [2025-04-30 10:08:11,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:08:11,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:08:11,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:08:11,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:08:11,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,760 INFO L138 Inliner]: procedures = 120, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 125 [2025-04-30 10:08:11,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:08:11,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:08:11,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:08:11,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:08:11,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,793 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-04-30 10:08:11,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:08:11,820 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:08:11,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:08:11,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:08:11,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:08:11,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:11,849 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-04-30 10:08:11,851 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-04-30 10:08:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:08:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:08:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:08:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-04-30 10:08:11,869 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-04-30 10:08:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:08:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:08:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:08:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-04-30 10:08:11,870 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-04-30 10:08:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:08:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:08:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:08:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:08:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:08:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:08:11,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:08:11,953 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:08:11,954 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:08:12,143 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-04-30 10:08:12,144 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:08:12,150 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:08:12,150 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:08:12,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:08:12 BoogieIcfgContainer [2025-04-30 10:08:12,151 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:08:12,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:08:12,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:08:12,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:08:12,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:08:11" (1/3) ... [2025-04-30 10:08:12,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcc00fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:08:12, skipping insertion in model container [2025-04-30 10:08:12,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (2/3) ... [2025-04-30 10:08:12,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcc00fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:08:12, skipping insertion in model container [2025-04-30 10:08:12,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:08:12" (3/3) ... [2025-04-30 10:08:12,159 INFO L128 eAbstractionObserver]: Analyzing ICFG relax-2-2.i [2025-04-30 10:08:12,168 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:08:12,169 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG relax-2-2.i that has 3 procedures, 48 locations, 78 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-30 10:08:12,210 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:08:12,219 INFO L340 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;@5e210e70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:08:12,220 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-30 10:08:12,223 INFO L278 IsEmpty]: Start isEmpty. Operand has 48 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 41 states have internal predecessors, (57), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-30 10:08:12,228 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-30 10:08:12,229 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:12,229 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:12,230 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:12,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:12,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1870550822, now seen corresponding path program 1 times [2025-04-30 10:08:12,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:12,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682166686] [2025-04-30 10:08:12,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:12,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:12,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:08:12,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:08:12,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:12,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:08:12,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:12,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682166686] [2025-04-30 10:08:12,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682166686] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:12,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996146417] [2025-04-30 10:08:12,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:12,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:12,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:12,358 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-04-30 10:08:12,359 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-04-30 10:08:12,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:08:12,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:08:12,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:12,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:12,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-04-30 10:08:12,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:08:12,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:08:12,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996146417] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:12,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:08:12,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-04-30 10:08:12,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791923629] [2025-04-30 10:08:12,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:12,449 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:08:12,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:12,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:08:12,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:08:12,467 INFO L87 Difference]: Start difference. First operand has 48 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 41 states have internal predecessors, (57), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:08:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:12,489 INFO L93 Difference]: Finished difference Result 93 states and 145 transitions. [2025-04-30 10:08:12,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:08:12,490 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-04-30 10:08:12,490 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:12,495 INFO L225 Difference]: With dead ends: 93 [2025-04-30 10:08:12,495 INFO L226 Difference]: Without dead ends: 43 [2025-04-30 10:08:12,497 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:08:12,499 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:12,500 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:12,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-30 10:08:12,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-04-30 10:08:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 37 states have internal predecessors, (49), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:08:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2025-04-30 10:08:12,523 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 62 transitions. Word has length 22 [2025-04-30 10:08:12,524 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:12,524 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 62 transitions. [2025-04-30 10:08:12,524 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:08:12,524 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 62 transitions. [2025-04-30 10:08:12,525 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-30 10:08:12,525 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:12,525 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:12,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:08:12,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-04-30 10:08:12,729 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:12,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:12,730 INFO L85 PathProgramCache]: Analyzing trace with hash -710399898, now seen corresponding path program 1 times [2025-04-30 10:08:12,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:12,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785763672] [2025-04-30 10:08:12,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:12,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:12,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:08:12,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:08:12,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:12,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:08:12,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:12,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785763672] [2025-04-30 10:08:12,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785763672] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:12,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:12,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:08:12,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164860904] [2025-04-30 10:08:12,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:12,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:08:12,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:12,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:08:12,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:12,939 INFO L87 Difference]: Start difference. First operand 43 states and 62 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:12,963 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2025-04-30 10:08:12,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:08:12,965 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-04-30 10:08:12,965 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:12,967 INFO L225 Difference]: With dead ends: 67 [2025-04-30 10:08:12,967 INFO L226 Difference]: Without dead ends: 45 [2025-04-30 10:08:12,967 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:12,968 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:12,968 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-30 10:08:12,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-04-30 10:08:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.457142857142857) internal successors, (51), 39 states have internal predecessors, (51), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:08:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2025-04-30 10:08:12,975 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 22 [2025-04-30 10:08:12,976 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:12,976 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2025-04-30 10:08:12,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:12,977 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2025-04-30 10:08:12,978 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:08:12,978 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:12,979 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:12,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:08:12,979 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:12,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:12,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1125867315, now seen corresponding path program 1 times [2025-04-30 10:08:12,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:12,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692465977] [2025-04-30 10:08:12,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:12,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:12,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:08:13,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:08:13,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:13,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:08:13,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:13,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692465977] [2025-04-30 10:08:13,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692465977] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:13,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:13,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:08:13,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635141155] [2025-04-30 10:08:13,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:13,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:08:13,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:13,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:08:13,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:08:13,187 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:13,276 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2025-04-30 10:08:13,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:08:13,277 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-04-30 10:08:13,278 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:13,278 INFO L225 Difference]: With dead ends: 93 [2025-04-30 10:08:13,279 INFO L226 Difference]: Without dead ends: 60 [2025-04-30 10:08:13,279 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:08:13,280 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:13,281 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 250 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:13,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-30 10:08:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-04-30 10:08:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 52 states have internal predecessors, (71), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:08:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2025-04-30 10:08:13,286 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 24 [2025-04-30 10:08:13,287 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:13,287 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2025-04-30 10:08:13,287 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:13,287 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2025-04-30 10:08:13,287 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:08:13,287 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:13,287 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:13,288 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:08:13,288 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:13,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash 293780072, now seen corresponding path program 1 times [2025-04-30 10:08:13,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:13,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696699007] [2025-04-30 10:08:13,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:13,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:13,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:08:13,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:08:13,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:13,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:08:13,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:13,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696699007] [2025-04-30 10:08:13,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696699007] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:13,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821983653] [2025-04-30 10:08:13,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:13,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:13,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:13,587 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-04-30 10:08:13,588 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-04-30 10:08:13,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:08:13,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:08:13,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:13,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:13,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:08:13,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:08:13,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:08:14,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821983653] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:14,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:14,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-04-30 10:08:14,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153317303] [2025-04-30 10:08:14,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:14,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:08:14,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:14,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:08:14,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:08:14,054 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:14,719 INFO L93 Difference]: Finished difference Result 159 states and 238 transitions. [2025-04-30 10:08:14,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:08:14,719 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-04-30 10:08:14,720 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:14,721 INFO L225 Difference]: With dead ends: 159 [2025-04-30 10:08:14,721 INFO L226 Difference]: Without dead ends: 130 [2025-04-30 10:08:14,721 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:08:14,721 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 118 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:14,722 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 710 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:08:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-04-30 10:08:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 85. [2025-04-30 10:08:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.5068493150684932) internal successors, (110), 78 states have internal predecessors, (110), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-30 10:08:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2025-04-30 10:08:14,733 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 25 [2025-04-30 10:08:14,733 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:14,733 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2025-04-30 10:08:14,733 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:14,733 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2025-04-30 10:08:14,734 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:08:14,734 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:14,734 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:14,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:08:14,934 WARN L466 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-04-30 10:08:14,935 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:14,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:14,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1269157755, now seen corresponding path program 1 times [2025-04-30 10:08:14,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:14,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864490726] [2025-04-30 10:08:14,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:14,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:14,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:08:14,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:08:14,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:14,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:08:15,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:15,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864490726] [2025-04-30 10:08:15,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864490726] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:15,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:15,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:08:15,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584712691] [2025-04-30 10:08:15,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:15,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:15,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:15,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:15,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:08:15,047 INFO L87 Difference]: Start difference. First operand 85 states and 125 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:15,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:15,113 INFO L93 Difference]: Finished difference Result 99 states and 140 transitions. [2025-04-30 10:08:15,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:08:15,113 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-04-30 10:08:15,113 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:15,114 INFO L225 Difference]: With dead ends: 99 [2025-04-30 10:08:15,114 INFO L226 Difference]: Without dead ends: 82 [2025-04-30 10:08:15,114 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:08:15,114 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 11 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:15,115 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 206 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:15,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-30 10:08:15,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-04-30 10:08:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.457142857142857) internal successors, (102), 75 states have internal predecessors, (102), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-30 10:08:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2025-04-30 10:08:15,130 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 25 [2025-04-30 10:08:15,130 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:15,130 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2025-04-30 10:08:15,130 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:15,130 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2025-04-30 10:08:15,131 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:08:15,131 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:15,131 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:15,131 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:08:15,131 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:15,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:15,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1353176109, now seen corresponding path program 2 times [2025-04-30 10:08:15,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:15,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499193690] [2025-04-30 10:08:15,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:15,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:15,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-30 10:08:15,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 26 statements. [2025-04-30 10:08:15,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:08:15,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:08:15,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:15,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499193690] [2025-04-30 10:08:15,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499193690] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:15,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:15,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:08:15,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765194074] [2025-04-30 10:08:15,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:15,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:08:15,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:15,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:08:15,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:08:15,467 INFO L87 Difference]: Start difference. First operand 82 states and 117 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:15,628 INFO L93 Difference]: Finished difference Result 112 states and 157 transitions. [2025-04-30 10:08:15,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:08:15,628 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-04-30 10:08:15,628 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:15,629 INFO L225 Difference]: With dead ends: 112 [2025-04-30 10:08:15,629 INFO L226 Difference]: Without dead ends: 110 [2025-04-30 10:08:15,629 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:08:15,630 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 50 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:15,630 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 294 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:15,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-04-30 10:08:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 72. [2025-04-30 10:08:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 65 states have internal predecessors, (86), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:08:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2025-04-30 10:08:15,640 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 99 transitions. Word has length 26 [2025-04-30 10:08:15,640 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:15,640 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 99 transitions. [2025-04-30 10:08:15,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:15,641 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2025-04-30 10:08:15,641 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:08:15,641 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:15,641 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:15,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:08:15,642 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:15,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:15,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1968260546, now seen corresponding path program 1 times [2025-04-30 10:08:15,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:15,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554879955] [2025-04-30 10:08:15,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:15,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:15,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:08:15,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:08:15,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:15,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:08:15,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:15,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554879955] [2025-04-30 10:08:15,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554879955] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:15,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265493155] [2025-04-30 10:08:15,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:15,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:15,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:15,837 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-04-30 10:08:15,838 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-04-30 10:08:15,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:08:15,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:08:15,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:15,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:15,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-30 10:08:15,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:08:15,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:16,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:08:16,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265493155] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:16,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:16,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 10] total 17 [2025-04-30 10:08:16,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319926301] [2025-04-30 10:08:16,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:16,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:08:16,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:16,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:08:16,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:08:16,178 INFO L87 Difference]: Start difference. First operand 72 states and 99 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:16,539 INFO L93 Difference]: Finished difference Result 135 states and 191 transitions. [2025-04-30 10:08:16,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:08:16,540 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-04-30 10:08:16,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:16,541 INFO L225 Difference]: With dead ends: 135 [2025-04-30 10:08:16,541 INFO L226 Difference]: Without dead ends: 111 [2025-04-30 10:08:16,542 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:08:16,542 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 65 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:16,542 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 738 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:08:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-04-30 10:08:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 71. [2025-04-30 10:08:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 64 states have internal predecessors, (82), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:08:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2025-04-30 10:08:16,559 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 26 [2025-04-30 10:08:16,559 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:16,559 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2025-04-30 10:08:16,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:16,560 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2025-04-30 10:08:16,560 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:08:16,562 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:16,562 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:16,568 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-04-30 10:08:16,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:16,762 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:16,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:16,763 INFO L85 PathProgramCache]: Analyzing trace with hash 808245529, now seen corresponding path program 2 times [2025-04-30 10:08:16,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:16,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121091251] [2025-04-30 10:08:16,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:16,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:16,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-30 10:08:16,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 27 statements. [2025-04-30 10:08:16,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:08:16,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:08:17,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:17,020 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121091251] [2025-04-30 10:08:17,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121091251] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:17,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:17,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:08:17,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652404103] [2025-04-30 10:08:17,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:17,021 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:08:17,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:17,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:08:17,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:08:17,022 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:17,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:17,147 INFO L93 Difference]: Finished difference Result 99 states and 134 transitions. [2025-04-30 10:08:17,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:08:17,147 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-04-30 10:08:17,147 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:17,148 INFO L225 Difference]: With dead ends: 99 [2025-04-30 10:08:17,148 INFO L226 Difference]: Without dead ends: 91 [2025-04-30 10:08:17,148 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:08:17,149 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 30 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:17,149 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 262 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:17,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-30 10:08:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2025-04-30 10:08:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.34375) internal successors, (86), 68 states have internal predecessors, (86), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:08:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2025-04-30 10:08:17,163 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 27 [2025-04-30 10:08:17,163 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:17,163 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2025-04-30 10:08:17,163 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:17,163 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2025-04-30 10:08:17,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:08:17,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:17,164 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:17,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:08:17,164 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:17,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:17,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2119882316, now seen corresponding path program 1 times [2025-04-30 10:08:17,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:17,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380241205] [2025-04-30 10:08:17,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:17,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:17,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:08:17,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:08:17,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:17,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:08:17,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:17,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380241205] [2025-04-30 10:08:17,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380241205] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:17,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:17,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:08:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618850512] [2025-04-30 10:08:17,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:17,220 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:08:17,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:17,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:08:17,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:17,221 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:17,242 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2025-04-30 10:08:17,242 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:08:17,243 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-04-30 10:08:17,243 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:17,243 INFO L225 Difference]: With dead ends: 92 [2025-04-30 10:08:17,243 INFO L226 Difference]: Without dead ends: 66 [2025-04-30 10:08:17,244 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:17,244 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:17,245 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-30 10:08:17,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-04-30 10:08:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 59 states have internal predecessors, (73), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:08:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2025-04-30 10:08:17,252 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 27 [2025-04-30 10:08:17,252 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:17,252 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2025-04-30 10:08:17,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:17,252 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2025-04-30 10:08:17,252 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:08:17,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:17,252 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:17,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:08:17,253 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:17,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:17,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1556359943, now seen corresponding path program 1 times [2025-04-30 10:08:17,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:17,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052528581] [2025-04-30 10:08:17,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:17,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:17,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:08:17,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:08:17,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:17,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:08:17,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:17,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052528581] [2025-04-30 10:08:17,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052528581] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:17,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:17,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:08:17,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055637456] [2025-04-30 10:08:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:17,299 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:08:17,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:17,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:08:17,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:08:17,301 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:17,325 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2025-04-30 10:08:17,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:08:17,326 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-04-30 10:08:17,326 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:17,327 INFO L225 Difference]: With dead ends: 85 [2025-04-30 10:08:17,328 INFO L226 Difference]: Without dead ends: 63 [2025-04-30 10:08:17,329 INFO L436 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-04-30 10:08:17,329 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:17,329 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-30 10:08:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-04-30 10:08:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 56 states have internal predecessors, (71), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:08:17,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2025-04-30 10:08:17,343 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 28 [2025-04-30 10:08:17,343 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:17,343 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2025-04-30 10:08:17,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:17,344 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2025-04-30 10:08:17,344 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-30 10:08:17,344 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:17,344 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:17,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:08:17,344 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:17,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:17,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1062401650, now seen corresponding path program 1 times [2025-04-30 10:08:17,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:17,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704058466] [2025-04-30 10:08:17,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:17,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:17,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:08:17,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:08:17,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:17,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:08:17,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:17,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704058466] [2025-04-30 10:08:17,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704058466] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:17,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815443845] [2025-04-30 10:08:17,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:17,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:17,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:17,448 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-04-30 10:08:17,450 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-04-30 10:08:17,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:08:17,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:08:17,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:17,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:17,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:08:17,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:08:17,539 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:08:17,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815443845] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:17,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:08:17,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-04-30 10:08:17,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157614765] [2025-04-30 10:08:17,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:17,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:17,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:17,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:17,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:08:17,541 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:17,577 INFO L93 Difference]: Finished difference Result 114 states and 154 transitions. [2025-04-30 10:08:17,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:08:17,577 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-04-30 10:08:17,578 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:17,578 INFO L225 Difference]: With dead ends: 114 [2025-04-30 10:08:17,578 INFO L226 Difference]: Without dead ends: 79 [2025-04-30 10:08:17,578 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:08:17,579 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 16 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:17,579 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 210 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-30 10:08:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-04-30 10:08:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 71 states have internal predecessors, (91), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:08:17,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2025-04-30 10:08:17,586 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 30 [2025-04-30 10:08:17,586 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:17,586 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 104 transitions. [2025-04-30 10:08:17,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:17,586 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2025-04-30 10:08:17,586 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-30 10:08:17,586 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:17,587 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:17,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:17,787 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:17,787 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:17,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:17,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1418438571, now seen corresponding path program 1 times [2025-04-30 10:08:17,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:17,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842318500] [2025-04-30 10:08:17,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:17,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:17,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:08:17,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:08:17,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:17,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:08:17,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:17,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842318500] [2025-04-30 10:08:17,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842318500] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:17,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832354912] [2025-04-30 10:08:17,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:17,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:17,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:17,894 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-04-30 10:08:17,896 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-04-30 10:08:17,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:08:17,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:08:17,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:17,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:17,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-30 10:08:17,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:08:18,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:08:18,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832354912] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:18,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:18,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 7] total 20 [2025-04-30 10:08:18,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626334453] [2025-04-30 10:08:18,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:18,217 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:08:18,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:18,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:08:18,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:08:18,218 INFO L87 Difference]: Start difference. First operand 78 states and 104 transitions. Second operand has 20 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:18,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:18,643 INFO L93 Difference]: Finished difference Result 203 states and 296 transitions. [2025-04-30 10:08:18,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-30 10:08:18,643 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-04-30 10:08:18,643 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:18,644 INFO L225 Difference]: With dead ends: 203 [2025-04-30 10:08:18,644 INFO L226 Difference]: Without dead ends: 188 [2025-04-30 10:08:18,645 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2025-04-30 10:08:18,645 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 196 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:18,645 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1031 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:08:18,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-04-30 10:08:18,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 94. [2025-04-30 10:08:18,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 87 states have internal predecessors, (115), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:08:18,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 128 transitions. [2025-04-30 10:08:18,659 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 128 transitions. Word has length 31 [2025-04-30 10:08:18,659 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:18,659 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 128 transitions. [2025-04-30 10:08:18,659 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:18,659 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 128 transitions. [2025-04-30 10:08:18,659 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-30 10:08:18,660 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:18,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:18,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:08:18,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-30 10:08:18,864 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:18,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:18,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1420285613, now seen corresponding path program 1 times [2025-04-30 10:08:18,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:18,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819282630] [2025-04-30 10:08:18,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:18,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:18,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:08:18,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:08:18,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:18,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:08:18,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:18,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819282630] [2025-04-30 10:08:18,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819282630] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:18,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413197523] [2025-04-30 10:08:18,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:18,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:18,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:18,991 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-04-30 10:08:18,993 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-04-30 10:08:19,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:08:19,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:08:19,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:19,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:19,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:08:19,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:08:19,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:19,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:08:19,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413197523] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:19,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:19,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-04-30 10:08:19,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886173990] [2025-04-30 10:08:19,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:19,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:08:19,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:19,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:08:19,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:08:19,231 INFO L87 Difference]: Start difference. First operand 94 states and 128 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:19,416 INFO L93 Difference]: Finished difference Result 232 states and 331 transitions. [2025-04-30 10:08:19,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:08:19,416 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-04-30 10:08:19,417 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:19,418 INFO L225 Difference]: With dead ends: 232 [2025-04-30 10:08:19,418 INFO L226 Difference]: Without dead ends: 211 [2025-04-30 10:08:19,418 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:08:19,418 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 99 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:19,419 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 528 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:19,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-04-30 10:08:19,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 137. [2025-04-30 10:08:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 125 states have (on average 1.384) internal successors, (173), 129 states have internal predecessors, (173), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-30 10:08:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 188 transitions. [2025-04-30 10:08:19,436 INFO L79 Accepts]: Start accepts. Automaton has 137 states and 188 transitions. Word has length 31 [2025-04-30 10:08:19,436 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:19,436 INFO L485 AbstractCegarLoop]: Abstraction has 137 states and 188 transitions. [2025-04-30 10:08:19,437 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:19,437 INFO L278 IsEmpty]: Start isEmpty. Operand 137 states and 188 transitions. [2025-04-30 10:08:19,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-30 10:08:19,437 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:19,437 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:19,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:19,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:19,641 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:19,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:19,641 INFO L85 PathProgramCache]: Analyzing trace with hash 609091945, now seen corresponding path program 1 times [2025-04-30 10:08:19,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:19,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581682047] [2025-04-30 10:08:19,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:19,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:19,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:08:19,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:08:19,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:19,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:08:19,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:19,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581682047] [2025-04-30 10:08:19,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581682047] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:19,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040581548] [2025-04-30 10:08:19,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:19,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:19,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:19,910 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:19,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:08:19,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:08:20,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:08:20,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:20,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:20,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:08:20,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:20,090 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:08:20,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:08:20,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040581548] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:20,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:20,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2025-04-30 10:08:20,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410124285] [2025-04-30 10:08:20,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:20,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:08:20,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:20,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:08:20,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:08:20,258 INFO L87 Difference]: Start difference. First operand 137 states and 188 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:27,693 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-30 10:08:34,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:34,015 INFO L93 Difference]: Finished difference Result 424 states and 605 transitions. [2025-04-30 10:08:34,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-30 10:08:34,016 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-04-30 10:08:34,016 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:34,018 INFO L225 Difference]: With dead ends: 424 [2025-04-30 10:08:34,018 INFO L226 Difference]: Without dead ends: 370 [2025-04-30 10:08:34,018 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=165, Invalid=955, Unknown=2, NotChecked=0, Total=1122 [2025-04-30 10:08:34,019 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 187 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:34,019 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1243 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-04-30 10:08:34,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-04-30 10:08:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 163. [2025-04-30 10:08:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 151 states have (on average 1.4105960264900663) internal successors, (213), 155 states have internal predecessors, (213), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-30 10:08:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 228 transitions. [2025-04-30 10:08:34,041 INFO L79 Accepts]: Start accepts. Automaton has 163 states and 228 transitions. Word has length 31 [2025-04-30 10:08:34,041 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:34,041 INFO L485 AbstractCegarLoop]: Abstraction has 163 states and 228 transitions. [2025-04-30 10:08:34,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:34,041 INFO L278 IsEmpty]: Start isEmpty. Operand 163 states and 228 transitions. [2025-04-30 10:08:34,042 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-30 10:08:34,042 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:34,042 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:34,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:34,242 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:34,243 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:34,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:34,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2084768299, now seen corresponding path program 2 times [2025-04-30 10:08:34,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:34,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612639779] [2025-04-30 10:08:34,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:34,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:34,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-30 10:08:34,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 31 statements. [2025-04-30 10:08:34,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:08:34,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:08:34,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:34,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612639779] [2025-04-30 10:08:34,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612639779] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:34,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:34,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:08:34,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227670036] [2025-04-30 10:08:34,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:34,359 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:34,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:34,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:34,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:08:34,359 INFO L87 Difference]: Start difference. First operand 163 states and 228 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:34,410 INFO L93 Difference]: Finished difference Result 222 states and 306 transitions. [2025-04-30 10:08:34,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:08:34,411 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-04-30 10:08:34,411 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:34,412 INFO L225 Difference]: With dead ends: 222 [2025-04-30 10:08:34,412 INFO L226 Difference]: Without dead ends: 160 [2025-04-30 10:08:34,413 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:08:34,414 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 8 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:34,414 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 138 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-04-30 10:08:34,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 150. [2025-04-30 10:08:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 138 states have (on average 1.4057971014492754) internal successors, (194), 142 states have internal predecessors, (194), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-30 10:08:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 209 transitions. [2025-04-30 10:08:34,429 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 209 transitions. Word has length 31 [2025-04-30 10:08:34,429 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:34,429 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 209 transitions. [2025-04-30 10:08:34,429 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:34,429 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 209 transitions. [2025-04-30 10:08:34,429 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:08:34,429 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:34,429 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:34,429 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:08:34,429 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:34,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:34,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1098882230, now seen corresponding path program 1 times [2025-04-30 10:08:34,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:34,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365644376] [2025-04-30 10:08:34,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:34,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:34,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:08:34,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:08:34,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:34,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:08:34,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:34,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365644376] [2025-04-30 10:08:34,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365644376] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:34,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314591791] [2025-04-30 10:08:34,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:34,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:34,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:34,588 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:34,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:08:34,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:08:34,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:08:34,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:34,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:34,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:08:34,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:34,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:08:34,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:08:34,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314591791] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:34,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:08:34,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-04-30 10:08:34,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559808162] [2025-04-30 10:08:34,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:34,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:34,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:34,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:34,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:08:34,696 INFO L87 Difference]: Start difference. First operand 150 states and 209 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:34,719 INFO L93 Difference]: Finished difference Result 159 states and 217 transitions. [2025-04-30 10:08:34,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:08:34,719 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-04-30 10:08:34,719 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:34,720 INFO L225 Difference]: With dead ends: 159 [2025-04-30 10:08:34,720 INFO L226 Difference]: Without dead ends: 136 [2025-04-30 10:08:34,721 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:08:34,721 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:34,722 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:34,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-04-30 10:08:34,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-04-30 10:08:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 124 states have (on average 1.403225806451613) internal successors, (174), 128 states have internal predecessors, (174), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-30 10:08:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2025-04-30 10:08:34,736 INFO L79 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 33 [2025-04-30 10:08:34,736 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:34,736 INFO L485 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2025-04-30 10:08:34,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:34,736 INFO L278 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2025-04-30 10:08:34,736 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:08:34,737 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:34,737 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:34,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:34,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-30 10:08:34,937 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:34,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:34,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1813819208, now seen corresponding path program 1 times [2025-04-30 10:08:34,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:34,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773128970] [2025-04-30 10:08:34,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:34,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:34,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:08:34,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:08:34,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:34,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:08:34,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:34,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773128970] [2025-04-30 10:08:34,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773128970] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:34,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216051841] [2025-04-30 10:08:34,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:34,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:34,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:35,001 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:35,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:08:35,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:08:35,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:08:35,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:35,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:35,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:08:35,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:08:35,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:08:35,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216051841] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:35,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:35,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 10] total 15 [2025-04-30 10:08:35,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382999296] [2025-04-30 10:08:35,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:35,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:08:35,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:35,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:08:35,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:08:35,279 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:35,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:35,412 INFO L93 Difference]: Finished difference Result 215 states and 305 transitions. [2025-04-30 10:08:35,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:08:35,413 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-04-30 10:08:35,413 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:35,414 INFO L225 Difference]: With dead ends: 215 [2025-04-30 10:08:35,414 INFO L226 Difference]: Without dead ends: 195 [2025-04-30 10:08:35,415 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:08:35,415 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 57 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:35,415 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 537 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-04-30 10:08:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 171. [2025-04-30 10:08:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 158 states have (on average 1.4113924050632911) internal successors, (223), 162 states have internal predecessors, (223), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:08:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 240 transitions. [2025-04-30 10:08:35,442 INFO L79 Accepts]: Start accepts. Automaton has 171 states and 240 transitions. Word has length 33 [2025-04-30 10:08:35,442 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:35,442 INFO L485 AbstractCegarLoop]: Abstraction has 171 states and 240 transitions. [2025-04-30 10:08:35,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:35,443 INFO L278 IsEmpty]: Start isEmpty. Operand 171 states and 240 transitions. [2025-04-30 10:08:35,443 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:08:35,443 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:35,443 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:35,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:35,644 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-30 10:08:35,644 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:35,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:35,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1815666250, now seen corresponding path program 1 times [2025-04-30 10:08:35,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:35,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918617147] [2025-04-30 10:08:35,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:35,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:35,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:08:35,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:08:35,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:35,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:08:35,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:35,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918617147] [2025-04-30 10:08:35,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918617147] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:35,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209793776] [2025-04-30 10:08:35,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:35,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:35,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:35,763 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:35,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:08:35,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:08:35,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:08:35,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:35,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:35,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:08:35,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:08:35,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:08:35,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209793776] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:35,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:08:35,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 11 [2025-04-30 10:08:35,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689925712] [2025-04-30 10:08:35,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:35,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:35,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:35,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:35,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:08:35,935 INFO L87 Difference]: Start difference. First operand 171 states and 240 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:35,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:35,996 INFO L93 Difference]: Finished difference Result 193 states and 271 transitions. [2025-04-30 10:08:35,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:08:35,997 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-04-30 10:08:35,997 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:35,998 INFO L225 Difference]: With dead ends: 193 [2025-04-30 10:08:35,998 INFO L226 Difference]: Without dead ends: 185 [2025-04-30 10:08:35,998 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:08:35,998 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 43 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:35,998 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 117 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:35,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-04-30 10:08:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 173. [2025-04-30 10:08:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 160 states have (on average 1.4125) internal successors, (226), 164 states have internal predecessors, (226), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:08:36,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 243 transitions. [2025-04-30 10:08:36,018 INFO L79 Accepts]: Start accepts. Automaton has 173 states and 243 transitions. Word has length 33 [2025-04-30 10:08:36,018 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:36,018 INFO L485 AbstractCegarLoop]: Abstraction has 173 states and 243 transitions. [2025-04-30 10:08:36,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:36,018 INFO L278 IsEmpty]: Start isEmpty. Operand 173 states and 243 transitions. [2025-04-30 10:08:36,019 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-30 10:08:36,019 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:36,019 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:36,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:36,223 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-30 10:08:36,223 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:36,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:36,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2109879309, now seen corresponding path program 2 times [2025-04-30 10:08:36,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:36,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022516209] [2025-04-30 10:08:36,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:36,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:36,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-30 10:08:36,236 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:08:36,236 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:08:36,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:08:36,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:36,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022516209] [2025-04-30 10:08:36,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022516209] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:36,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:36,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:08:36,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801780731] [2025-04-30 10:08:36,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:36,307 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:36,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:36,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:36,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:08:36,307 INFO L87 Difference]: Start difference. First operand 173 states and 243 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:36,392 INFO L93 Difference]: Finished difference Result 200 states and 279 transitions. [2025-04-30 10:08:36,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:08:36,392 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-04-30 10:08:36,392 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:36,393 INFO L225 Difference]: With dead ends: 200 [2025-04-30 10:08:36,393 INFO L226 Difference]: Without dead ends: 192 [2025-04-30 10:08:36,393 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:08:36,394 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 35 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:36,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 187 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:36,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-04-30 10:08:36,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 173. [2025-04-30 10:08:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 160 states have (on average 1.40625) internal successors, (225), 164 states have internal predecessors, (225), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:08:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 242 transitions. [2025-04-30 10:08:36,414 INFO L79 Accepts]: Start accepts. Automaton has 173 states and 242 transitions. Word has length 34 [2025-04-30 10:08:36,414 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:36,414 INFO L485 AbstractCegarLoop]: Abstraction has 173 states and 242 transitions. [2025-04-30 10:08:36,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:36,414 INFO L278 IsEmpty]: Start isEmpty. Operand 173 states and 242 transitions. [2025-04-30 10:08:36,415 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:08:36,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:36,415 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:36,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:08:36,415 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:36,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:36,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1411973119, now seen corresponding path program 1 times [2025-04-30 10:08:36,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:36,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199957238] [2025-04-30 10:08:36,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:36,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:36,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:08:36,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:08:36,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:36,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:36,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:08:36,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:36,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199957238] [2025-04-30 10:08:36,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199957238] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:36,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837202438] [2025-04-30 10:08:36,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:36,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:36,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:36,583 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:36,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:08:36,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:08:36,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:08:36,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:36,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:36,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-30 10:08:36,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:08:36,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:08:37,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837202438] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:37,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:37,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 12] total 21 [2025-04-30 10:08:37,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799786589] [2025-04-30 10:08:37,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:37,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-30 10:08:37,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:37,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-30 10:08:37,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:08:37,012 INFO L87 Difference]: Start difference. First operand 173 states and 242 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:37,339 INFO L93 Difference]: Finished difference Result 242 states and 333 transitions. [2025-04-30 10:08:37,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:08:37,340 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-04-30 10:08:37,340 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:37,341 INFO L225 Difference]: With dead ends: 242 [2025-04-30 10:08:37,341 INFO L226 Difference]: Without dead ends: 192 [2025-04-30 10:08:37,341 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:08:37,343 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 51 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:37,343 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 945 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:08:37,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-04-30 10:08:37,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 175. [2025-04-30 10:08:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 162 states have (on average 1.4012345679012346) internal successors, (227), 166 states have internal predecessors, (227), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:08:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 244 transitions. [2025-04-30 10:08:37,364 INFO L79 Accepts]: Start accepts. Automaton has 175 states and 244 transitions. Word has length 36 [2025-04-30 10:08:37,364 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:37,364 INFO L485 AbstractCegarLoop]: Abstraction has 175 states and 244 transitions. [2025-04-30 10:08:37,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:37,364 INFO L278 IsEmpty]: Start isEmpty. Operand 175 states and 244 transitions. [2025-04-30 10:08:37,364 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:08:37,364 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:37,364 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:37,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:37,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:37,568 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:37,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:37,568 INFO L85 PathProgramCache]: Analyzing trace with hash 135443416, now seen corresponding path program 1 times [2025-04-30 10:08:37,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:37,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592418428] [2025-04-30 10:08:37,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:37,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:37,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:08:37,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:08:37,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:37,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:08:37,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:37,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592418428] [2025-04-30 10:08:37,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592418428] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:37,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49948295] [2025-04-30 10:08:37,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:37,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:37,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:37,956 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:37,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-30 10:08:38,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:08:38,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:08:38,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:38,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:38,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-30 10:08:38,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:38,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:08:38,196 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-04-30 10:08:38,199 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-30 10:08:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:08:38,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:38,375 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:08:38,375 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2025-04-30 10:08:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:08:38,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49948295] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:38,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:38,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2025-04-30 10:08:38,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860773345] [2025-04-30 10:08:38,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:38,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-30 10:08:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:38,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-30 10:08:38,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2025-04-30 10:08:38,434 INFO L87 Difference]: Start difference. First operand 175 states and 244 transitions. Second operand has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:39,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:39,056 INFO L93 Difference]: Finished difference Result 372 states and 525 transitions. [2025-04-30 10:08:39,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:08:39,057 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-04-30 10:08:39,057 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:39,058 INFO L225 Difference]: With dead ends: 372 [2025-04-30 10:08:39,058 INFO L226 Difference]: Without dead ends: 309 [2025-04-30 10:08:39,058 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=1410, Unknown=0, NotChecked=0, Total=1640 [2025-04-30 10:08:39,059 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 145 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:39,059 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1056 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:08:39,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-04-30 10:08:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 226. [2025-04-30 10:08:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 213 states have (on average 1.4131455399061033) internal successors, (301), 217 states have internal predecessors, (301), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:08:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 318 transitions. [2025-04-30 10:08:39,091 INFO L79 Accepts]: Start accepts. Automaton has 226 states and 318 transitions. Word has length 37 [2025-04-30 10:08:39,092 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:39,092 INFO L485 AbstractCegarLoop]: Abstraction has 226 states and 318 transitions. [2025-04-30 10:08:39,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:39,092 INFO L278 IsEmpty]: Start isEmpty. Operand 226 states and 318 transitions. [2025-04-30 10:08:39,094 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:08:39,094 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:39,094 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:39,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:39,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-30 10:08:39,298 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:39,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:39,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1342996567, now seen corresponding path program 1 times [2025-04-30 10:08:39,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:39,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815493757] [2025-04-30 10:08:39,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:39,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:39,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:08:39,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:08:39,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:39,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:39,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:08:39,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:39,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815493757] [2025-04-30 10:08:39,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815493757] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:39,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95238446] [2025-04-30 10:08:39,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:39,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:39,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:39,495 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:39,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-30 10:08:39,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:08:39,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:08:39,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:39,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:39,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-30 10:08:39,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:08:39,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:08:39,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95238446] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:39,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:39,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 26 [2025-04-30 10:08:39,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728408605] [2025-04-30 10:08:39,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:39,869 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-30 10:08:39,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:39,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-30 10:08:39,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:08:39,870 INFO L87 Difference]: Start difference. First operand 226 states and 318 transitions. Second operand has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 25 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:40,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:40,332 INFO L93 Difference]: Finished difference Result 364 states and 508 transitions. [2025-04-30 10:08:40,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:08:40,335 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 25 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-04-30 10:08:40,335 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:40,336 INFO L225 Difference]: With dead ends: 364 [2025-04-30 10:08:40,336 INFO L226 Difference]: Without dead ends: 249 [2025-04-30 10:08:40,336 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:08:40,337 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 113 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:40,337 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1098 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:08:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-04-30 10:08:40,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2025-04-30 10:08:40,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 201 states have (on average 1.3880597014925373) internal successors, (279), 205 states have internal predecessors, (279), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:08:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 296 transitions. [2025-04-30 10:08:40,365 INFO L79 Accepts]: Start accepts. Automaton has 214 states and 296 transitions. Word has length 37 [2025-04-30 10:08:40,365 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:40,365 INFO L485 AbstractCegarLoop]: Abstraction has 214 states and 296 transitions. [2025-04-30 10:08:40,366 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 25 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:40,366 INFO L278 IsEmpty]: Start isEmpty. Operand 214 states and 296 transitions. [2025-04-30 10:08:40,367 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-30 10:08:40,367 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:40,367 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:40,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-30 10:08:40,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-30 10:08:40,568 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:40,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash 426640785, now seen corresponding path program 1 times [2025-04-30 10:08:40,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:40,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794671172] [2025-04-30 10:08:40,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:40,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:40,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:08:40,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:08:40,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:40,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:08:40,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:40,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794671172] [2025-04-30 10:08:40,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794671172] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:40,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487592597] [2025-04-30 10:08:40,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:40,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:40,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:40,681 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:40,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-30 10:08:40,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:08:40,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:08:40,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:40,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:40,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:08:40,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:08:40,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:08:40,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487592597] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:40,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:08:40,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2025-04-30 10:08:40,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742687199] [2025-04-30 10:08:40,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:40,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:08:40,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:40,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:08:40,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:08:40,763 INFO L87 Difference]: Start difference. First operand 214 states and 296 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:08:40,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:40,802 INFO L93 Difference]: Finished difference Result 239 states and 330 transitions. [2025-04-30 10:08:40,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:08:40,803 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-04-30 10:08:40,803 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:40,804 INFO L225 Difference]: With dead ends: 239 [2025-04-30 10:08:40,804 INFO L226 Difference]: Without dead ends: 221 [2025-04-30 10:08:40,804 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:08:40,804 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:40,805 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 106 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:40,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-04-30 10:08:40,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2025-04-30 10:08:40,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 205 states have (on average 1.3902439024390243) internal successors, (285), 209 states have internal predecessors, (285), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:08:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 302 transitions. [2025-04-30 10:08:40,831 INFO L79 Accepts]: Start accepts. Automaton has 218 states and 302 transitions. Word has length 39 [2025-04-30 10:08:40,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:40,831 INFO L485 AbstractCegarLoop]: Abstraction has 218 states and 302 transitions. [2025-04-30 10:08:40,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:08:40,831 INFO L278 IsEmpty]: Start isEmpty. Operand 218 states and 302 transitions. [2025-04-30 10:08:40,832 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-30 10:08:40,832 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:40,832 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:40,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:41,032 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:41,033 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:41,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:41,033 INFO L85 PathProgramCache]: Analyzing trace with hash -690447184, now seen corresponding path program 2 times [2025-04-30 10:08:41,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:41,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945792031] [2025-04-30 10:08:41,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:41,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:41,038 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-30 10:08:41,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:08:41,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:08:41,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:41,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:08:41,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:41,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945792031] [2025-04-30 10:08:41,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945792031] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:41,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666415050] [2025-04-30 10:08:41,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:41,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:41,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:41,291 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:41,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-30 10:08:41,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-30 10:08:41,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:08:41,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:08:41,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:41,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-30 10:08:41,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:08:41,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:08:41,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666415050] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:41,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:41,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 14] total 26 [2025-04-30 10:08:41,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205412047] [2025-04-30 10:08:41,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:41,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-30 10:08:41,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:41,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-30 10:08:41,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:08:41,724 INFO L87 Difference]: Start difference. First operand 218 states and 302 transitions. Second operand has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:42,202 INFO L93 Difference]: Finished difference Result 273 states and 373 transitions. [2025-04-30 10:08:42,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:08:42,202 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-04-30 10:08:42,203 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:42,204 INFO L225 Difference]: With dead ends: 273 [2025-04-30 10:08:42,204 INFO L226 Difference]: Without dead ends: 202 [2025-04-30 10:08:42,204 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=838, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:08:42,204 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 111 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:42,205 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1159 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:08:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-04-30 10:08:42,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 180. [2025-04-30 10:08:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 167 states have (on average 1.377245508982036) internal successors, (230), 171 states have internal predecessors, (230), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:08:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 247 transitions. [2025-04-30 10:08:42,232 INFO L79 Accepts]: Start accepts. Automaton has 180 states and 247 transitions. Word has length 38 [2025-04-30 10:08:42,232 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:42,232 INFO L485 AbstractCegarLoop]: Abstraction has 180 states and 247 transitions. [2025-04-30 10:08:42,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:42,232 INFO L278 IsEmpty]: Start isEmpty. Operand 180 states and 247 transitions. [2025-04-30 10:08:42,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-30 10:08:42,233 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:42,233 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:42,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:42,433 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:42,433 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:42,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:42,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1436946758, now seen corresponding path program 2 times [2025-04-30 10:08:42,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:42,434 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920567790] [2025-04-30 10:08:42,434 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:42,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:42,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-30 10:08:42,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 39 statements. [2025-04-30 10:08:42,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:08:42,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:08:42,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:42,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920567790] [2025-04-30 10:08:42,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920567790] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:42,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:42,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:08:42,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806166821] [2025-04-30 10:08:42,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:42,580 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:42,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:42,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:42,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:08:42,580 INFO L87 Difference]: Start difference. First operand 180 states and 247 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:42,709 INFO L93 Difference]: Finished difference Result 242 states and 328 transitions. [2025-04-30 10:08:42,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:08:42,709 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2025-04-30 10:08:42,709 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:42,710 INFO L225 Difference]: With dead ends: 242 [2025-04-30 10:08:42,710 INFO L226 Difference]: Without dead ends: 234 [2025-04-30 10:08:42,710 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:08:42,712 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:42,712 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 171 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:42,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-04-30 10:08:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 192. [2025-04-30 10:08:42,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 179 states have (on average 1.3631284916201116) internal successors, (244), 183 states have internal predecessors, (244), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:08:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 261 transitions. [2025-04-30 10:08:42,752 INFO L79 Accepts]: Start accepts. Automaton has 192 states and 261 transitions. Word has length 39 [2025-04-30 10:08:42,752 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:42,752 INFO L485 AbstractCegarLoop]: Abstraction has 192 states and 261 transitions. [2025-04-30 10:08:42,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:42,752 INFO L278 IsEmpty]: Start isEmpty. Operand 192 states and 261 transitions. [2025-04-30 10:08:42,753 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-30 10:08:42,753 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:42,754 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:42,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:08:42,754 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:42,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:42,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2117179376, now seen corresponding path program 3 times [2025-04-30 10:08:42,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:42,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176414992] [2025-04-30 10:08:42,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:08:42,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:42,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-30 10:08:42,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 40 statements. [2025-04-30 10:08:42,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-30 10:08:42,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:43,131 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:08:43,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:43,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176414992] [2025-04-30 10:08:43,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176414992] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:43,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547205547] [2025-04-30 10:08:43,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:08:43,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:43,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:43,133 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:43,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-30 10:08:43,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-30 10:08:43,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 40 statements. [2025-04-30 10:08:43,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-30 10:08:43,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:43,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-30 10:08:43,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:08:43,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:08:43,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547205547] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:43,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:43,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 26 [2025-04-30 10:08:43,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042477414] [2025-04-30 10:08:43,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:43,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-30 10:08:43,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:43,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-30 10:08:43,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:08:43,546 INFO L87 Difference]: Start difference. First operand 192 states and 261 transitions. Second operand has 26 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:44,368 INFO L93 Difference]: Finished difference Result 399 states and 555 transitions. [2025-04-30 10:08:44,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-30 10:08:44,369 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-04-30 10:08:44,369 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:44,370 INFO L225 Difference]: With dead ends: 399 [2025-04-30 10:08:44,370 INFO L226 Difference]: Without dead ends: 356 [2025-04-30 10:08:44,371 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=329, Invalid=1477, Unknown=0, NotChecked=0, Total=1806 [2025-04-30 10:08:44,371 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 357 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:44,371 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 943 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:08:44,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-04-30 10:08:44,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 157. [2025-04-30 10:08:44,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 144 states have (on average 1.3333333333333333) internal successors, (192), 148 states have internal predecessors, (192), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:08:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 209 transitions. [2025-04-30 10:08:44,397 INFO L79 Accepts]: Start accepts. Automaton has 157 states and 209 transitions. Word has length 40 [2025-04-30 10:08:44,397 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:44,397 INFO L485 AbstractCegarLoop]: Abstraction has 157 states and 209 transitions. [2025-04-30 10:08:44,397 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:44,397 INFO L278 IsEmpty]: Start isEmpty. Operand 157 states and 209 transitions. [2025-04-30 10:08:44,397 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-30 10:08:44,397 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:44,397 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:44,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:44,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-30 10:08:44,598 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:44,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:44,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1840392542, now seen corresponding path program 1 times [2025-04-30 10:08:44,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:44,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929332412] [2025-04-30 10:08:44,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:44,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:44,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:08:44,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:08:44,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:44,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:08:45,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:45,221 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929332412] [2025-04-30 10:08:45,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929332412] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:45,221 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712177285] [2025-04-30 10:08:45,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:45,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:45,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:45,223 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:45,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-30 10:08:45,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:08:45,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:08:45,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:45,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:45,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-30 10:08:45,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:45,405 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:08:45,877 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-04-30 10:08:45,880 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-30 10:08:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:08:45,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:46,199 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:08:46,199 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2025-04-30 10:08:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:08:46,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712177285] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:46,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:46,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 13] total 43 [2025-04-30 10:08:46,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082819761] [2025-04-30 10:08:46,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:46,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-30 10:08:46,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:46,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-30 10:08:46,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1621, Unknown=0, NotChecked=0, Total=1806 [2025-04-30 10:08:46,383 INFO L87 Difference]: Start difference. First operand 157 states and 209 transitions. Second operand has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 42 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:08:47,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:47,390 INFO L93 Difference]: Finished difference Result 284 states and 381 transitions. [2025-04-30 10:08:47,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:08:47,391 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 42 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-04-30 10:08:47,391 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:47,391 INFO L225 Difference]: With dead ends: 284 [2025-04-30 10:08:47,392 INFO L226 Difference]: Without dead ends: 201 [2025-04-30 10:08:47,392 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=396, Invalid=3026, Unknown=0, NotChecked=0, Total=3422 [2025-04-30 10:08:47,393 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 273 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:47,393 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 808 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:08:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-04-30 10:08:47,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 169. [2025-04-30 10:08:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 156 states have (on average 1.3205128205128205) internal successors, (206), 160 states have internal predecessors, (206), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:08:47,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 223 transitions. [2025-04-30 10:08:47,422 INFO L79 Accepts]: Start accepts. Automaton has 169 states and 223 transitions. Word has length 42 [2025-04-30 10:08:47,423 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:47,423 INFO L485 AbstractCegarLoop]: Abstraction has 169 states and 223 transitions. [2025-04-30 10:08:47,423 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 42 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:08:47,423 INFO L278 IsEmpty]: Start isEmpty. Operand 169 states and 223 transitions. [2025-04-30 10:08:47,423 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-30 10:08:47,423 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:47,424 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:47,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:47,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-30 10:08:47,624 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:47,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:47,625 INFO L85 PathProgramCache]: Analyzing trace with hash -115243381, now seen corresponding path program 1 times [2025-04-30 10:08:47,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:47,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025781815] [2025-04-30 10:08:47,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:47,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:47,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:08:47,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:08:47,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:47,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:08:47,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:47,670 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025781815] [2025-04-30 10:08:47,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025781815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:47,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:47,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:08:47,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925936853] [2025-04-30 10:08:47,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:47,671 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:08:47,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:47,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:08:47,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:47,672 INFO L87 Difference]: Start difference. First operand 169 states and 223 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:08:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:47,714 INFO L93 Difference]: Finished difference Result 189 states and 247 transitions. [2025-04-30 10:08:47,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:08:47,715 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-04-30 10:08:47,715 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:47,716 INFO L225 Difference]: With dead ends: 189 [2025-04-30 10:08:47,716 INFO L226 Difference]: Without dead ends: 170 [2025-04-30 10:08:47,716 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:47,716 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:47,716 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 150 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:47,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-04-30 10:08:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2025-04-30 10:08:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 155 states have (on average 1.3096774193548386) internal successors, (203), 158 states have internal predecessors, (203), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:08:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 220 transitions. [2025-04-30 10:08:47,745 INFO L79 Accepts]: Start accepts. Automaton has 168 states and 220 transitions. Word has length 44 [2025-04-30 10:08:47,745 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:47,745 INFO L485 AbstractCegarLoop]: Abstraction has 168 states and 220 transitions. [2025-04-30 10:08:47,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:08:47,745 INFO L278 IsEmpty]: Start isEmpty. Operand 168 states and 220 transitions. [2025-04-30 10:08:47,745 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-30 10:08:47,746 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:47,746 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:47,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-30 10:08:47,746 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:47,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:47,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1878495766, now seen corresponding path program 1 times [2025-04-30 10:08:47,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:47,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714386901] [2025-04-30 10:08:47,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:47,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:47,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:08:47,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:08:47,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:47,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:47,868 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-30 10:08:47,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:47,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714386901] [2025-04-30 10:08:47,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714386901] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:47,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409608023] [2025-04-30 10:08:47,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:47,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:47,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:47,871 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:47,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-30 10:08:47,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:08:47,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:08:47,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:47,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:47,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-30 10:08:47,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:47,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:08:48,014 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:08:48,212 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-04-30 10:08:48,213 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-30 10:08:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:08:48,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:08:48,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409608023] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:48,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:48,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 14] total 33 [2025-04-30 10:08:48,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750099230] [2025-04-30 10:08:48,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:48,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-30 10:08:48,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:48,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-30 10:08:48,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:08:48,555 INFO L87 Difference]: Start difference. First operand 168 states and 220 transitions. Second operand has 33 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:50,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:50,010 INFO L93 Difference]: Finished difference Result 608 states and 831 transitions. [2025-04-30 10:08:50,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-30 10:08:50,010 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-04-30 10:08:50,010 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:50,012 INFO L225 Difference]: With dead ends: 608 [2025-04-30 10:08:50,012 INFO L226 Difference]: Without dead ends: 491 [2025-04-30 10:08:50,013 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=552, Invalid=3870, Unknown=0, NotChecked=0, Total=4422 [2025-04-30 10:08:50,013 INFO L437 NwaCegarLoop]: 123 mSDtfsCounter, 419 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:50,014 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1689 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-30 10:08:50,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-04-30 10:08:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 268. [2025-04-30 10:08:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 255 states have (on average 1.3333333333333333) internal successors, (340), 258 states have internal predecessors, (340), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:08:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 357 transitions. [2025-04-30 10:08:50,065 INFO L79 Accepts]: Start accepts. Automaton has 268 states and 357 transitions. Word has length 44 [2025-04-30 10:08:50,065 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:50,065 INFO L485 AbstractCegarLoop]: Abstraction has 268 states and 357 transitions. [2025-04-30 10:08:50,065 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:50,065 INFO L278 IsEmpty]: Start isEmpty. Operand 268 states and 357 transitions. [2025-04-30 10:08:50,066 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:08:50,066 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:50,066 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:50,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:50,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-30 10:08:50,267 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:50,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:50,267 INFO L85 PathProgramCache]: Analyzing trace with hash -830680278, now seen corresponding path program 1 times [2025-04-30 10:08:50,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:50,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896154314] [2025-04-30 10:08:50,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:50,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:50,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:08:50,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:08:50,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:50,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:08:50,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:50,423 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896154314] [2025-04-30 10:08:50,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896154314] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:50,423 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692833806] [2025-04-30 10:08:50,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:50,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:50,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:50,425 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:50,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-30 10:08:50,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:08:50,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:08:50,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:50,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:50,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-30 10:08:50,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:08:50,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:08:50,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692833806] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:50,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:50,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-04-30 10:08:50,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974650765] [2025-04-30 10:08:50,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:50,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:08:50,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:50,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:08:50,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:08:50,817 INFO L87 Difference]: Start difference. First operand 268 states and 357 transitions. Second operand has 24 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:51,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:51,326 INFO L93 Difference]: Finished difference Result 521 states and 699 transitions. [2025-04-30 10:08:51,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-30 10:08:51,327 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-04-30 10:08:51,327 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:51,328 INFO L225 Difference]: With dead ends: 521 [2025-04-30 10:08:51,328 INFO L226 Difference]: Without dead ends: 331 [2025-04-30 10:08:51,329 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2025-04-30 10:08:51,329 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 102 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:51,329 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1242 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:08:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-04-30 10:08:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 240. [2025-04-30 10:08:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 227 states have (on average 1.3215859030837005) internal successors, (300), 230 states have internal predecessors, (300), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:08:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2025-04-30 10:08:51,374 INFO L79 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 45 [2025-04-30 10:08:51,374 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:51,374 INFO L485 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2025-04-30 10:08:51,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:51,375 INFO L278 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2025-04-30 10:08:51,375 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-30 10:08:51,375 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:51,375 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:51,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-30 10:08:51,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:51,576 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:51,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:51,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1722860657, now seen corresponding path program 1 times [2025-04-30 10:08:51,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:51,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49524882] [2025-04-30 10:08:51,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:51,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-30 10:08:51,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:08:51,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:51,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:08:51,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:51,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49524882] [2025-04-30 10:08:51,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49524882] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:51,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521747110] [2025-04-30 10:08:51,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:51,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:51,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:51,669 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:51,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-30 10:08:51,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-30 10:08:51,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:08:51,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:51,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:51,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:08:51,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:08:51,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:08:51,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521747110] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:51,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:51,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2025-04-30 10:08:51,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756346566] [2025-04-30 10:08:51,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:51,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:08:51,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:51,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:08:51,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:08:51,873 INFO L87 Difference]: Start difference. First operand 240 states and 317 transitions. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-30 10:08:52,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:52,041 INFO L93 Difference]: Finished difference Result 314 states and 410 transitions. [2025-04-30 10:08:52,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:08:52,042 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2025-04-30 10:08:52,042 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:52,043 INFO L225 Difference]: With dead ends: 314 [2025-04-30 10:08:52,043 INFO L226 Difference]: Without dead ends: 255 [2025-04-30 10:08:52,043 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:08:52,043 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 39 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:52,044 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 350 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:52,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-04-30 10:08:52,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 225. [2025-04-30 10:08:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 214 states have (on average 1.3224299065420562) internal successors, (283), 217 states have internal predecessors, (283), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:08:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 296 transitions. [2025-04-30 10:08:52,088 INFO L79 Accepts]: Start accepts. Automaton has 225 states and 296 transitions. Word has length 47 [2025-04-30 10:08:52,088 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:52,088 INFO L485 AbstractCegarLoop]: Abstraction has 225 states and 296 transitions. [2025-04-30 10:08:52,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-30 10:08:52,088 INFO L278 IsEmpty]: Start isEmpty. Operand 225 states and 296 transitions. [2025-04-30 10:08:52,088 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-30 10:08:52,088 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:52,088 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:52,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:52,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-04-30 10:08:52,289 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:52,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:52,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2056144184, now seen corresponding path program 2 times [2025-04-30 10:08:52,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:52,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820209748] [2025-04-30 10:08:52,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:52,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:52,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-30 10:08:52,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:08:52,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:08:52,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:08:52,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:52,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820209748] [2025-04-30 10:08:52,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820209748] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:52,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218215136] [2025-04-30 10:08:52,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:52,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:52,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:52,596 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:52,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-30 10:08:52,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-30 10:08:52,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:08:52,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:08:52,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:52,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-30 10:08:52,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:08:52,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:08:53,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218215136] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:53,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:53,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 31 [2025-04-30 10:08:53,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523343565] [2025-04-30 10:08:53,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:53,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-30 10:08:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:53,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-30 10:08:53,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2025-04-30 10:08:53,046 INFO L87 Difference]: Start difference. First operand 225 states and 296 transitions. Second operand has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:08:57,378 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-30 10:09:01,381 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-30 10:09:05,385 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-30 10:09:09,391 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-30 10:09:13,398 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-30 10:09:17,404 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15