./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 1d054f79132e175b09d8c50472a4c24ca52f401c76e1d0704dd5609a369827e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:30:45,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:30:45,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 16:30:45,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:30:45,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:30:45,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:30:45,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:30:45,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:30:45,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:30:45,479 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:30:45,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:30:45,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:30:45,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:30:45,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:30:45,479 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:30:45,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:30:45,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:30:45,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:30:45,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:30:45,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:30:45,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:30:45,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:30:45,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:30:45,480 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:30:45,480 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:30:45,480 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:30:45,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:30:45,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:30:45,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:30:45,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:30:45,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:30:45,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:30:45,481 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:30:45,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:30:45,481 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:30:45,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:30:45,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:30:45,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:30:45,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:30:45,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:30:45,482 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1d054f79132e175b09d8c50472a4c24ca52f401c76e1d0704dd5609a369827e2 [2025-03-03 16:30:45,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:30:45,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:30:45,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:30:45,703 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:30:45,703 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:30:45,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c [2025-03-03 16:30:46,805 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3b5da709/68dfb921620c4845af7750f1b8fcb582/FLAG89494fbca [2025-03-03 16:30:47,096 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:30:47,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c [2025-03-03 16:30:47,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3b5da709/68dfb921620c4845af7750f1b8fcb582/FLAG89494fbca [2025-03-03 16:30:47,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3b5da709/68dfb921620c4845af7750f1b8fcb582 [2025-03-03 16:30:47,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:30:47,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:30:47,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:30:47,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:30:47,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:30:47,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:30:47" (1/1) ... [2025-03-03 16:30:47,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640f5031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:47, skipping insertion in model container [2025-03-03 16:30:47,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:30:47" (1/1) ... [2025-03-03 16:30:47,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:30:47,508 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c[1268,1281] [2025-03-03 16:30:47,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:30:47,683 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:30:47,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c[1268,1281] [2025-03-03 16:30:47,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:30:47,779 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:30:47,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:47 WrapperNode [2025-03-03 16:30:47,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:30:47,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:30:47,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:30:47,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:30:47,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:47" (1/1) ... [2025-03-03 16:30:47,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:47" (1/1) ... [2025-03-03 16:30:48,055 INFO L138 Inliner]: procedures = 18, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2358 [2025-03-03 16:30:48,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:30:48,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:30:48,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:30:48,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:30:48,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:47" (1/1) ... [2025-03-03 16:30:48,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:47" (1/1) ... [2025-03-03 16:30:48,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:47" (1/1) ... [2025-03-03 16:30:48,162 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 4, 4]. [2025-03-03 16:30:48,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:47" (1/1) ... [2025-03-03 16:30:48,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:47" (1/1) ... [2025-03-03 16:30:48,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:47" (1/1) ... [2025-03-03 16:30:48,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:47" (1/1) ... [2025-03-03 16:30:48,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:47" (1/1) ... [2025-03-03 16:30:48,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:47" (1/1) ... [2025-03-03 16:30:48,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:30:48,329 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:30:48,329 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:30:48,329 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:30:48,330 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:47" (1/1) ... [2025-03-03 16:30:48,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:30:48,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:30:48,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:30:48,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:30:48,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:30:48,373 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 16:30:48,373 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 16:30:48,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:30:48,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 16:30:48,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 16:30:48,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 16:30:48,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 16:30:48,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 16:30:48,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 16:30:48,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:30:48,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:30:48,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 16:30:48,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 16:30:48,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 16:30:48,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 16:30:48,567 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:30:48,568 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:30:50,208 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: call ULTIMATE.dealloc(main_~#state_14~0#1.base, main_~#state_14~0#1.offset);havoc main_~#state_14~0#1.base, main_~#state_14~0#1.offset;call ULTIMATE.dealloc(main_~#state_44~0#1.base, main_~#state_44~0#1.offset);havoc main_~#state_44~0#1.base, main_~#state_44~0#1.offset; [2025-03-03 16:30:50,509 INFO L? ?]: Removed 1277 outVars from TransFormulas that were not future-live. [2025-03-03 16:30:50,509 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:30:50,600 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:30:50,600 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:30:50,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:30:50 BoogieIcfgContainer [2025-03-03 16:30:50,601 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:30:50,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:30:50,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:30:50,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:30:50,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:30:47" (1/3) ... [2025-03-03 16:30:50,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a3f046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:30:50, skipping insertion in model container [2025-03-03 16:30:50,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:30:47" (2/3) ... [2025-03-03 16:30:50,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a3f046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:30:50, skipping insertion in model container [2025-03-03 16:30:50,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:30:50" (3/3) ... [2025-03-03 16:30:50,609 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c [2025-03-03 16:30:50,624 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:30:50,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c that has 2 procedures, 740 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-03 16:30:50,678 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:30:50,685 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@fc1e1f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:30:50,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 16:30:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 740 states, 732 states have (on average 1.4972677595628416) internal successors, (1096), 733 states have internal predecessors, (1096), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:30:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-03 16:30:50,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:30:50,702 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:30:50,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:30:50,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:30:50,707 INFO L85 PathProgramCache]: Analyzing trace with hash -542862209, now seen corresponding path program 1 times [2025-03-03 16:30:50,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:30:50,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317791130] [2025-03-03 16:30:50,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:50,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:30:50,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-03 16:30:50,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-03 16:30:50,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:50,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 16:30:51,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:30:51,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317791130] [2025-03-03 16:30:51,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317791130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:30:51,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985177300] [2025-03-03 16:30:51,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:51,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:30:51,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:30:51,146 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:30:51,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:30:51,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-03 16:30:51,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-03 16:30:51,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:51,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:51,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 16:30:51,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:30:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 16:30:51,541 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:30:51,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985177300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:30:51,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:30:51,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 16:30:51,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047947942] [2025-03-03 16:30:51,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:30:51,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:30:51,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:30:51,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:30:51,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:30:51,563 INFO L87 Difference]: Start difference. First operand has 740 states, 732 states have (on average 1.4972677595628416) internal successors, (1096), 733 states have internal predecessors, (1096), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:30:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:30:51,812 INFO L93 Difference]: Finished difference Result 1385 states and 2077 transitions. [2025-03-03 16:30:51,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:30:51,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 239 [2025-03-03 16:30:51,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:30:51,827 INFO L225 Difference]: With dead ends: 1385 [2025-03-03 16:30:51,828 INFO L226 Difference]: Without dead ends: 737 [2025-03-03 16:30:51,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 240 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-03-03 16:30:51,836 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:30:51,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 923 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:30:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-03-03 16:30:51,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2025-03-03 16:30:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 730 states have (on average 1.4945205479452055) internal successors, (1091), 730 states have internal predecessors, (1091), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:30:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1101 transitions. [2025-03-03 16:30:51,904 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1101 transitions. Word has length 239 [2025-03-03 16:30:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:30:51,905 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1101 transitions. [2025-03-03 16:30:51,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:30:51,905 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1101 transitions. [2025-03-03 16:30:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-03 16:30:51,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:30:51,909 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:30:51,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:30:52,114 WARN L453 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-03-03 16:30:52,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:30:52,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:30:52,115 INFO L85 PathProgramCache]: Analyzing trace with hash 231156698, now seen corresponding path program 1 times [2025-03-03 16:30:52,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:30:52,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121302634] [2025-03-03 16:30:52,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:52,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:30:52,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-03 16:30:52,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-03 16:30:52,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:52,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:52,674 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:30:52,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:30:52,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121302634] [2025-03-03 16:30:52,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121302634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:30:52,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:30:52,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:30:52,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988118363] [2025-03-03 16:30:52,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:30:52,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:30:52,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:30:52,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:30:52,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:30:52,681 INFO L87 Difference]: Start difference. First operand 737 states and 1101 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:30:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:30:52,944 INFO L93 Difference]: Finished difference Result 1472 states and 2200 transitions. [2025-03-03 16:30:52,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:30:52,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 239 [2025-03-03 16:30:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:30:52,947 INFO L225 Difference]: With dead ends: 1472 [2025-03-03 16:30:52,947 INFO L226 Difference]: Without dead ends: 742 [2025-03-03 16:30:52,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:30:52,949 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 6 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:30:52,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1840 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:30:52,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-03 16:30:52,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 738. [2025-03-03 16:30:52,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 731 states have (on average 1.493844049247606) internal successors, (1092), 731 states have internal predecessors, (1092), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:30:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1102 transitions. [2025-03-03 16:30:52,973 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1102 transitions. Word has length 239 [2025-03-03 16:30:52,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:30:52,973 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1102 transitions. [2025-03-03 16:30:52,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:30:52,974 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1102 transitions. [2025-03-03 16:30:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-03 16:30:52,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:30:52,978 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:30:52,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:30:52,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:30:52,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:30:52,979 INFO L85 PathProgramCache]: Analyzing trace with hash 416146430, now seen corresponding path program 1 times [2025-03-03 16:30:52,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:30:52,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758493039] [2025-03-03 16:30:52,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:52,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:30:53,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-03 16:30:53,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-03 16:30:53,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:53,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:30:53,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:30:53,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758493039] [2025-03-03 16:30:53,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758493039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:30:53,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629884158] [2025-03-03 16:30:53,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:53,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:30:53,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:30:53,425 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:30:53,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:30:53,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-03 16:30:53,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-03 16:30:53,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:53,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:53,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 16:30:53,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:30:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:30:53,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:30:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:30:53,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629884158] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:30:53,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:30:53,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2025-03-03 16:30:53,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379370991] [2025-03-03 16:30:53,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:30:53,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:30:53,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:30:53,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:30:53,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:30:53,838 INFO L87 Difference]: Start difference. First operand 738 states and 1102 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:30:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:30:54,070 INFO L93 Difference]: Finished difference Result 1448 states and 2163 transitions. [2025-03-03 16:30:54,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:30:54,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 242 [2025-03-03 16:30:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:30:54,072 INFO L225 Difference]: With dead ends: 1448 [2025-03-03 16:30:54,072 INFO L226 Difference]: Without dead ends: 739 [2025-03-03 16:30:54,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:30:54,075 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 6 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:30:54,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1835 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:30:54,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-03-03 16:30:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2025-03-03 16:30:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 732 states have (on average 1.4931693989071038) internal successors, (1093), 732 states have internal predecessors, (1093), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 16:30:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1103 transitions. [2025-03-03 16:30:54,091 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1103 transitions. Word has length 242 [2025-03-03 16:30:54,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:30:54,091 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1103 transitions. [2025-03-03 16:30:54,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:30:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1103 transitions. [2025-03-03 16:30:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-03 16:30:54,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:30:54,093 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:30:54,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 16:30:54,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 16:30:54,297 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:30:54,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:30:54,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1890147851, now seen corresponding path program 1 times [2025-03-03 16:30:54,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:30:54,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990148788] [2025-03-03 16:30:54,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:54,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:30:54,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-03 16:30:54,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-03 16:30:54,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:54,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:30:54,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:30:54,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990148788] [2025-03-03 16:30:54,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990148788] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:30:54,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112454046] [2025-03-03 16:30:54,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:54,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:30:54,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:30:54,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:30:54,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:30:54,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-03 16:30:54,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-03 16:30:54,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:54,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:54,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 16:30:55,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:30:55,040 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:30:55,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:30:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:30:55,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112454046] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:30:55,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:30:55,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 8] total 12 [2025-03-03 16:30:55,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964133385] [2025-03-03 16:30:55,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:30:55,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 16:30:55,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:30:55,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 16:30:55,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:30:55,687 INFO L87 Difference]: Start difference. First operand 739 states and 1103 transitions. Second operand has 12 states, 12 states have (on average 29.916666666666668) internal successors, (359), 12 states have internal predecessors, (359), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 16:30:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:30:57,336 INFO L93 Difference]: Finished difference Result 2088 states and 3119 transitions. [2025-03-03 16:30:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:30:57,337 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 29.916666666666668) internal successors, (359), 12 states have internal predecessors, (359), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 245 [2025-03-03 16:30:57,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:30:57,341 INFO L225 Difference]: With dead ends: 2088 [2025-03-03 16:30:57,341 INFO L226 Difference]: Without dead ends: 1357 [2025-03-03 16:30:57,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:30:57,342 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 4035 mSDsluCounter, 4042 mSDsCounter, 0 mSdLazyCounter, 2997 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4040 SdHoareTripleChecker+Valid, 4725 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:30:57,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4040 Valid, 4725 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2997 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 16:30:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-03-03 16:30:57,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 971. [2025-03-03 16:30:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 959 states have (on average 1.4900938477580814) internal successors, (1429), 959 states have internal predecessors, (1429), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 16:30:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1449 transitions. [2025-03-03 16:30:57,374 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1449 transitions. Word has length 245 [2025-03-03 16:30:57,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:30:57,375 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1449 transitions. [2025-03-03 16:30:57,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 29.916666666666668) internal successors, (359), 12 states have internal predecessors, (359), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 16:30:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1449 transitions. [2025-03-03 16:30:57,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-03 16:30:57,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:30:57,380 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:30:57,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 16:30:57,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:30:57,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:30:57,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:30:57,582 INFO L85 PathProgramCache]: Analyzing trace with hash 95094924, now seen corresponding path program 1 times [2025-03-03 16:30:57,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:30:57,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332597868] [2025-03-03 16:30:57,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:57,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:30:57,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-03 16:30:57,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-03 16:30:57,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:57,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:57,882 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:30:57,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:30:57,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332597868] [2025-03-03 16:30:57,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332597868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:30:57,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655204861] [2025-03-03 16:30:57,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:57,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:30:57,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:30:57,885 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:30:57,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:30:58,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-03 16:30:58,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-03 16:30:58,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:58,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:58,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 16:30:58,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:30:58,259 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:30:58,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:30:58,303 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 16:30:58,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655204861] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:30:58,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:30:58,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 4] total 9 [2025-03-03 16:30:58,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397562400] [2025-03-03 16:30:58,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:30:58,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:30:58,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:30:58,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:30:58,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:30:58,305 INFO L87 Difference]: Start difference. First operand 971 states and 1449 transitions. Second operand has 9 states, 9 states have (on average 28.11111111111111) internal successors, (253), 9 states have internal predecessors, (253), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 16:30:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:30:58,732 INFO L93 Difference]: Finished difference Result 1968 states and 2942 transitions. [2025-03-03 16:30:58,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:30:58,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.11111111111111) internal successors, (253), 9 states have internal predecessors, (253), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 249 [2025-03-03 16:30:58,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:30:58,736 INFO L225 Difference]: With dead ends: 1968 [2025-03-03 16:30:58,736 INFO L226 Difference]: Without dead ends: 1010 [2025-03-03 16:30:58,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:30:58,738 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 52 mSDsluCounter, 3689 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 4616 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:30:58,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 4616 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:30:58,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-03-03 16:30:58,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1006. [2025-03-03 16:30:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 994 states have (on average 1.4869215291750504) internal successors, (1478), 994 states have internal predecessors, (1478), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 16:30:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1498 transitions. [2025-03-03 16:30:58,761 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1498 transitions. Word has length 249 [2025-03-03 16:30:58,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:30:58,761 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1498 transitions. [2025-03-03 16:30:58,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.11111111111111) internal successors, (253), 9 states have internal predecessors, (253), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 16:30:58,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1498 transitions. [2025-03-03 16:30:58,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-03 16:30:58,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:30:58,764 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:30:58,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 16:30:58,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:30:58,968 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:30:58,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:30:58,968 INFO L85 PathProgramCache]: Analyzing trace with hash 416617821, now seen corresponding path program 2 times [2025-03-03 16:30:58,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:30:58,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375037940] [2025-03-03 16:30:58,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:30:58,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:30:59,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 261 statements into 2 equivalence classes. [2025-03-03 16:30:59,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 168 of 261 statements. [2025-03-03 16:30:59,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 16:30:59,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 16:30:59,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:30:59,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375037940] [2025-03-03 16:30:59,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375037940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:30:59,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:30:59,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:30:59,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824571461] [2025-03-03 16:30:59,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:30:59,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:30:59,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:30:59,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:30:59,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:30:59,308 INFO L87 Difference]: Start difference. First operand 1006 states and 1498 transitions. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:30:59,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:30:59,560 INFO L93 Difference]: Finished difference Result 1010 states and 1502 transitions. [2025-03-03 16:30:59,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:30:59,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 261 [2025-03-03 16:30:59,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:30:59,564 INFO L225 Difference]: With dead ends: 1010 [2025-03-03 16:30:59,564 INFO L226 Difference]: Without dead ends: 1008 [2025-03-03 16:30:59,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:30:59,565 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 0 mSDsluCounter, 1837 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2758 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:30:59,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2758 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:30:59,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2025-03-03 16:30:59,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2025-03-03 16:30:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 996 states have (on average 1.4859437751004017) internal successors, (1480), 996 states have internal predecessors, (1480), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 16:30:59,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1500 transitions. [2025-03-03 16:30:59,587 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1500 transitions. Word has length 261 [2025-03-03 16:30:59,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:30:59,588 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1500 transitions. [2025-03-03 16:30:59,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:30:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1500 transitions. [2025-03-03 16:30:59,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-03 16:30:59,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:30:59,591 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:30:59,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:30:59,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:30:59,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:30:59,592 INFO L85 PathProgramCache]: Analyzing trace with hash 34930242, now seen corresponding path program 1 times [2025-03-03 16:30:59,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:30:59,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469373932] [2025-03-03 16:30:59,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:59,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:30:59,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-03 16:30:59,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-03 16:30:59,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:30:59,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:30:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 16:30:59,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:30:59,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469373932] [2025-03-03 16:30:59,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469373932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:30:59,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450934050] [2025-03-03 16:30:59,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:30:59,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:30:59,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:30:59,936 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:30:59,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 16:31:00,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-03 16:31:00,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-03 16:31:00,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:00,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:00,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 16:31:00,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 16:31:00,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:31:00,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450934050] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:31:00,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:31:00,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 10] total 15 [2025-03-03 16:31:00,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651322528] [2025-03-03 16:31:00,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:31:00,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 16:31:00,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:00,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 16:31:00,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:31:00,425 INFO L87 Difference]: Start difference. First operand 1008 states and 1500 transitions. Second operand has 15 states, 15 states have (on average 17.2) internal successors, (258), 15 states have internal predecessors, (258), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 16:31:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:01,092 INFO L93 Difference]: Finished difference Result 2023 states and 3015 transitions. [2025-03-03 16:31:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:31:01,092 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 17.2) internal successors, (258), 15 states have internal predecessors, (258), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 262 [2025-03-03 16:31:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:01,096 INFO L225 Difference]: With dead ends: 2023 [2025-03-03 16:31:01,096 INFO L226 Difference]: Without dead ends: 1033 [2025-03-03 16:31:01,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-03 16:31:01,098 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 96 mSDsluCounter, 7436 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 8369 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:01,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 8369 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:31:01,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2025-03-03 16:31:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2025-03-03 16:31:01,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1021 states have (on average 1.483839373163565) internal successors, (1515), 1021 states have internal predecessors, (1515), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 16:31:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1535 transitions. [2025-03-03 16:31:01,116 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1535 transitions. Word has length 262 [2025-03-03 16:31:01,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:01,116 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1535 transitions. [2025-03-03 16:31:01,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 17.2) internal successors, (258), 15 states have internal predecessors, (258), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 16:31:01,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1535 transitions. [2025-03-03 16:31:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-03 16:31:01,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:01,118 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:01,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:01,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:01,324 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:01,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:01,325 INFO L85 PathProgramCache]: Analyzing trace with hash -173393762, now seen corresponding path program 2 times [2025-03-03 16:31:01,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:01,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283185475] [2025-03-03 16:31:01,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:31:01,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:01,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 277 statements into 2 equivalence classes. [2025-03-03 16:31:01,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 169 of 277 statements. [2025-03-03 16:31:01,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 16:31:01,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-03 16:31:01,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:01,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283185475] [2025-03-03 16:31:01,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283185475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:01,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:31:01,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:31:01,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302805454] [2025-03-03 16:31:01,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:01,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:31:01,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:01,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:31:01,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:31:01,544 INFO L87 Difference]: Start difference. First operand 1033 states and 1535 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:01,793 INFO L93 Difference]: Finished difference Result 1682 states and 2503 transitions. [2025-03-03 16:31:01,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:31:01,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 277 [2025-03-03 16:31:01,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:01,797 INFO L225 Difference]: With dead ends: 1682 [2025-03-03 16:31:01,797 INFO L226 Difference]: Without dead ends: 1035 [2025-03-03 16:31:01,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:31:01,798 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 0 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2755 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:01,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2755 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:31:01,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2025-03-03 16:31:01,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1035. [2025-03-03 16:31:01,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 1023 states have (on average 1.4828934506353861) internal successors, (1517), 1023 states have internal predecessors, (1517), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 16:31:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1537 transitions. [2025-03-03 16:31:01,813 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1537 transitions. Word has length 277 [2025-03-03 16:31:01,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:01,813 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1537 transitions. [2025-03-03 16:31:01,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:01,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1537 transitions. [2025-03-03 16:31:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-03 16:31:01,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:01,816 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:01,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:31:01,816 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:01,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:01,817 INFO L85 PathProgramCache]: Analyzing trace with hash 851270428, now seen corresponding path program 1 times [2025-03-03 16:31:01,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:01,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420698672] [2025-03-03 16:31:01,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:01,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:01,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-03 16:31:01,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-03 16:31:01,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:01,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-03 16:31:02,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:02,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420698672] [2025-03-03 16:31:02,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420698672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:02,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016374184] [2025-03-03 16:31:02,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:02,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:02,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:02,212 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:02,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 16:31:02,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-03 16:31:02,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-03 16:31:02,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:02,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:02,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 16:31:02,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:02,651 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 16:31:02,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-03 16:31:02,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016374184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:31:02,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:31:02,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 7] total 18 [2025-03-03 16:31:02,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023117425] [2025-03-03 16:31:02,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:31:02,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 16:31:02,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:02,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 16:31:02,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-03 16:31:02,751 INFO L87 Difference]: Start difference. First operand 1035 states and 1537 transitions. Second operand has 18 states, 18 states have (on average 14.88888888888889) internal successors, (268), 18 states have internal predecessors, (268), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 16:31:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:03,580 INFO L93 Difference]: Finished difference Result 2008 states and 2993 transitions. [2025-03-03 16:31:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 16:31:03,581 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 14.88888888888889) internal successors, (268), 18 states have internal predecessors, (268), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 278 [2025-03-03 16:31:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:03,584 INFO L225 Difference]: With dead ends: 2008 [2025-03-03 16:31:03,584 INFO L226 Difference]: Without dead ends: 1075 [2025-03-03 16:31:03,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:31:03,585 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 130 mSDsluCounter, 9465 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 10416 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:03,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 10416 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 16:31:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2025-03-03 16:31:03,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1075. [2025-03-03 16:31:03,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1063 states have (on average 1.4797742238946379) internal successors, (1573), 1063 states have internal predecessors, (1573), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 16:31:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1593 transitions. [2025-03-03 16:31:03,604 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1593 transitions. Word has length 278 [2025-03-03 16:31:03,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:03,604 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1593 transitions. [2025-03-03 16:31:03,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.88888888888889) internal successors, (268), 18 states have internal predecessors, (268), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 16:31:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1593 transitions. [2025-03-03 16:31:03,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-03 16:31:03,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:03,607 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:03,615 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-03-03 16:31:03,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:03,811 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:03,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:03,811 INFO L85 PathProgramCache]: Analyzing trace with hash -477453476, now seen corresponding path program 2 times [2025-03-03 16:31:03,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:03,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134318820] [2025-03-03 16:31:03,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:31:03,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:03,844 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 290 statements into 2 equivalence classes. [2025-03-03 16:31:03,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 170 of 290 statements. [2025-03-03 16:31:03,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 16:31:03,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-03 16:31:04,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:04,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134318820] [2025-03-03 16:31:04,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134318820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:04,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:31:04,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:31:04,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825233663] [2025-03-03 16:31:04,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:04,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:31:04,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:04,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:31:04,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:31:04,086 INFO L87 Difference]: Start difference. First operand 1075 states and 1593 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:04,390 INFO L93 Difference]: Finished difference Result 1730 states and 2568 transitions. [2025-03-03 16:31:04,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:31:04,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 290 [2025-03-03 16:31:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:04,393 INFO L225 Difference]: With dead ends: 1730 [2025-03-03 16:31:04,393 INFO L226 Difference]: Without dead ends: 1075 [2025-03-03 16:31:04,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:31:04,394 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 966 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:04,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 1684 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:31:04,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2025-03-03 16:31:04,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1075. [2025-03-03 16:31:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1063 states have (on average 1.4778927563499529) internal successors, (1571), 1063 states have internal predecessors, (1571), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 16:31:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1591 transitions. [2025-03-03 16:31:04,410 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1591 transitions. Word has length 290 [2025-03-03 16:31:04,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:04,410 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1591 transitions. [2025-03-03 16:31:04,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:04,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1591 transitions. [2025-03-03 16:31:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-03 16:31:04,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:04,412 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:04,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:31:04,413 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:04,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:04,413 INFO L85 PathProgramCache]: Analyzing trace with hash 302888267, now seen corresponding path program 1 times [2025-03-03 16:31:04,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:04,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522516177] [2025-03-03 16:31:04,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:04,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:04,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-03 16:31:04,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-03 16:31:04,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:04,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:04,684 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-03 16:31:04,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:04,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522516177] [2025-03-03 16:31:04,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522516177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:04,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:31:04,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:31:04,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287306967] [2025-03-03 16:31:04,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:04,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:31:04,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:04,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:31:04,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:31:04,686 INFO L87 Difference]: Start difference. First operand 1075 states and 1591 transitions. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:05,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:05,001 INFO L93 Difference]: Finished difference Result 1724 states and 2557 transitions. [2025-03-03 16:31:05,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:31:05,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 291 [2025-03-03 16:31:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:05,004 INFO L225 Difference]: With dead ends: 1724 [2025-03-03 16:31:05,004 INFO L226 Difference]: Without dead ends: 1075 [2025-03-03 16:31:05,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:31:05,005 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 1067 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:05,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 1693 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:31:05,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2025-03-03 16:31:05,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1075. [2025-03-03 16:31:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1063 states have (on average 1.4769520225776105) internal successors, (1570), 1063 states have internal predecessors, (1570), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 16:31:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1590 transitions. [2025-03-03 16:31:05,021 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1590 transitions. Word has length 291 [2025-03-03 16:31:05,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:05,022 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1590 transitions. [2025-03-03 16:31:05,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:05,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1590 transitions. [2025-03-03 16:31:05,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-03 16:31:05,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:05,024 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:05,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:31:05,024 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:05,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:05,024 INFO L85 PathProgramCache]: Analyzing trace with hash 917632451, now seen corresponding path program 1 times [2025-03-03 16:31:05,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:05,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345165031] [2025-03-03 16:31:05,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:05,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:05,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-03 16:31:05,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-03 16:31:05,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:05,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:05,480 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-03 16:31:05,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:05,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345165031] [2025-03-03 16:31:05,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345165031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:05,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:31:05,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:31:05,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185302237] [2025-03-03 16:31:05,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:05,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:31:05,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:05,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:31:05,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:31:05,482 INFO L87 Difference]: Start difference. First operand 1075 states and 1590 transitions. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:05,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:05,839 INFO L93 Difference]: Finished difference Result 1730 states and 2563 transitions. [2025-03-03 16:31:05,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:31:05,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 292 [2025-03-03 16:31:05,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:05,842 INFO L225 Difference]: With dead ends: 1730 [2025-03-03 16:31:05,842 INFO L226 Difference]: Without dead ends: 1075 [2025-03-03 16:31:05,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:31:05,843 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 1080 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:05,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1693 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:31:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2025-03-03 16:31:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1075. [2025-03-03 16:31:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1063 states have (on average 1.4750705550329257) internal successors, (1568), 1063 states have internal predecessors, (1568), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 16:31:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1588 transitions. [2025-03-03 16:31:05,864 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1588 transitions. Word has length 292 [2025-03-03 16:31:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:05,864 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1588 transitions. [2025-03-03 16:31:05,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1588 transitions. [2025-03-03 16:31:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-03 16:31:05,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:05,867 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:05,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:31:05,867 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:05,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:05,868 INFO L85 PathProgramCache]: Analyzing trace with hash -756928309, now seen corresponding path program 1 times [2025-03-03 16:31:05,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:05,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362415512] [2025-03-03 16:31:05,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:05,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:05,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-03 16:31:06,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-03 16:31:06,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:06,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-03 16:31:06,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:06,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362415512] [2025-03-03 16:31:06,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362415512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:06,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:31:06,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:31:06,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663426919] [2025-03-03 16:31:06,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:06,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:31:06,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:06,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:31:06,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:31:06,404 INFO L87 Difference]: Start difference. First operand 1075 states and 1588 transitions. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:06,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:06,756 INFO L93 Difference]: Finished difference Result 1724 states and 2552 transitions. [2025-03-03 16:31:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:31:06,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 293 [2025-03-03 16:31:06,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:06,761 INFO L225 Difference]: With dead ends: 1724 [2025-03-03 16:31:06,761 INFO L226 Difference]: Without dead ends: 1075 [2025-03-03 16:31:06,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:31:06,762 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 941 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:06,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 1684 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:31:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2025-03-03 16:31:06,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1075. [2025-03-03 16:31:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1063 states have (on average 1.4741298212605833) internal successors, (1567), 1063 states have internal predecessors, (1567), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 16:31:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1587 transitions. [2025-03-03 16:31:06,781 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1587 transitions. Word has length 293 [2025-03-03 16:31:06,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:06,781 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1587 transitions. [2025-03-03 16:31:06,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1587 transitions. [2025-03-03 16:31:06,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-03 16:31:06,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:06,783 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:06,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:31:06,784 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:06,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:06,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1787012559, now seen corresponding path program 1 times [2025-03-03 16:31:06,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:06,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902226683] [2025-03-03 16:31:06,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:06,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:06,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-03 16:31:07,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-03 16:31:07,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:07,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-03 16:31:07,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:07,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902226683] [2025-03-03 16:31:07,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902226683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:07,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:31:07,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:31:07,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425157308] [2025-03-03 16:31:07,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:07,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:31:07,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:07,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:31:07,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:31:07,818 INFO L87 Difference]: Start difference. First operand 1075 states and 1587 transitions. Second operand has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 7 states have internal predecessors, (230), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:08,385 INFO L93 Difference]: Finished difference Result 2052 states and 3038 transitions. [2025-03-03 16:31:08,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:31:08,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 7 states have internal predecessors, (230), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 294 [2025-03-03 16:31:08,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:08,389 INFO L225 Difference]: With dead ends: 2052 [2025-03-03 16:31:08,389 INFO L226 Difference]: Without dead ends: 1403 [2025-03-03 16:31:08,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:31:08,390 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 1819 mSDsluCounter, 3598 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1824 SdHoareTripleChecker+Valid, 4500 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:08,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1824 Valid, 4500 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:31:08,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-03-03 16:31:08,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1403. [2025-03-03 16:31:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 1386 states have (on average 1.4747474747474747) internal successors, (2044), 1386 states have internal predecessors, (2044), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 2074 transitions. [2025-03-03 16:31:08,410 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 2074 transitions. Word has length 294 [2025-03-03 16:31:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:08,411 INFO L471 AbstractCegarLoop]: Abstraction has 1403 states and 2074 transitions. [2025-03-03 16:31:08,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 7 states have internal predecessors, (230), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 2074 transitions. [2025-03-03 16:31:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2025-03-03 16:31:08,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:08,415 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:08,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:31:08,415 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:08,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash -553379518, now seen corresponding path program 1 times [2025-03-03 16:31:08,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:08,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717012415] [2025-03-03 16:31:08,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:08,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:08,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-03-03 16:31:08,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-03-03 16:31:08,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:08,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 16:31:09,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:09,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717012415] [2025-03-03 16:31:09,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717012415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:09,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:31:09,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:31:09,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544144598] [2025-03-03 16:31:09,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:09,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:31:09,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:09,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:31:09,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:31:09,007 INFO L87 Difference]: Start difference. First operand 1403 states and 2074 transitions. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:09,212 INFO L93 Difference]: Finished difference Result 2053 states and 3039 transitions. [2025-03-03 16:31:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:31:09,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 647 [2025-03-03 16:31:09,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:09,217 INFO L225 Difference]: With dead ends: 2053 [2025-03-03 16:31:09,217 INFO L226 Difference]: Without dead ends: 1404 [2025-03-03 16:31:09,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:31:09,219 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 0 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:09,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1833 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:31:09,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2025-03-03 16:31:09,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1404. [2025-03-03 16:31:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1387 states have (on average 1.4744051910598415) internal successors, (2045), 1387 states have internal predecessors, (2045), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2075 transitions. [2025-03-03 16:31:09,243 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2075 transitions. Word has length 647 [2025-03-03 16:31:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:09,244 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 2075 transitions. [2025-03-03 16:31:09,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:09,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2075 transitions. [2025-03-03 16:31:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2025-03-03 16:31:09,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:09,249 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:09,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:31:09,249 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:09,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:09,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2041877918, now seen corresponding path program 1 times [2025-03-03 16:31:09,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:09,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594099837] [2025-03-03 16:31:09,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:09,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:09,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-03-03 16:31:09,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-03-03 16:31:09,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:09,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 178 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 16:31:10,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:10,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594099837] [2025-03-03 16:31:10,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594099837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:10,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672197201] [2025-03-03 16:31:10,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:10,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:10,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:10,082 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-03-03 16:31:10,084 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-03-03 16:31:10,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-03-03 16:31:10,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-03-03 16:31:10,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:10,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:10,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 16:31:10,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-03 16:31:11,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:31:11,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672197201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:11,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:31:11,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 16:31:11,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757544891] [2025-03-03 16:31:11,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:11,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:31:11,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:11,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:31:11,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:31:11,477 INFO L87 Difference]: Start difference. First operand 1404 states and 2075 transitions. Second operand has 4 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:11,889 INFO L93 Difference]: Finished difference Result 2053 states and 3038 transitions. [2025-03-03 16:31:11,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:31:11,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 648 [2025-03-03 16:31:11,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:11,894 INFO L225 Difference]: With dead ends: 2053 [2025-03-03 16:31:11,894 INFO L226 Difference]: Without dead ends: 1403 [2025-03-03 16:31:11,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:31:11,895 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 830 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:11,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1354 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:31:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-03-03 16:31:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1403. [2025-03-03 16:31:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 1386 states have (on average 1.4733044733044733) internal successors, (2042), 1386 states have internal predecessors, (2042), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 2072 transitions. [2025-03-03 16:31:11,920 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 2072 transitions. Word has length 648 [2025-03-03 16:31:11,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:11,920 INFO L471 AbstractCegarLoop]: Abstraction has 1403 states and 2072 transitions. [2025-03-03 16:31:11,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 2072 transitions. [2025-03-03 16:31:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-03-03 16:31:11,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:11,924 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:11,939 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-03-03 16:31:12,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:12,125 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:12,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:12,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1188358162, now seen corresponding path program 1 times [2025-03-03 16:31:12,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:12,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704214903] [2025-03-03 16:31:12,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:12,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:12,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-03-03 16:31:12,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-03-03 16:31:12,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:12,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 178 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 16:31:12,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:12,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704214903] [2025-03-03 16:31:12,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704214903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:12,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881307321] [2025-03-03 16:31:12,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:12,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:12,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:12,987 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-03-03 16:31:12,988 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-03-03 16:31:13,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-03-03 16:31:13,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-03-03 16:31:13,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:13,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:13,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 3338 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 16:31:13,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:14,338 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-03 16:31:14,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:31:14,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881307321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:14,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:31:14,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 16:31:14,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069001849] [2025-03-03 16:31:14,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:14,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:31:14,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:14,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:31:14,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:31:14,342 INFO L87 Difference]: Start difference. First operand 1403 states and 2072 transitions. Second operand has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:14,764 INFO L93 Difference]: Finished difference Result 2051 states and 3032 transitions. [2025-03-03 16:31:14,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:31:14,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 649 [2025-03-03 16:31:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:14,768 INFO L225 Difference]: With dead ends: 2051 [2025-03-03 16:31:14,768 INFO L226 Difference]: Without dead ends: 1402 [2025-03-03 16:31:14,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:31:14,769 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 822 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:14,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1354 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:31:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-03-03 16:31:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2025-03-03 16:31:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1385 states have (on average 1.472202166064982) internal successors, (2039), 1385 states have internal predecessors, (2039), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2069 transitions. [2025-03-03 16:31:14,789 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2069 transitions. Word has length 649 [2025-03-03 16:31:14,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:14,789 INFO L471 AbstractCegarLoop]: Abstraction has 1402 states and 2069 transitions. [2025-03-03 16:31:14,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2069 transitions. [2025-03-03 16:31:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-03-03 16:31:14,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:14,793 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:14,807 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-03-03 16:31:14,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 16:31:14,998 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:14,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:14,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1148537944, now seen corresponding path program 1 times [2025-03-03 16:31:14,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:14,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417987172] [2025-03-03 16:31:14,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:14,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:15,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-03 16:31:15,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-03 16:31:15,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:15,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 178 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 16:31:15,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:15,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417987172] [2025-03-03 16:31:15,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417987172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:15,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135920579] [2025-03-03 16:31:15,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:15,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:15,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:15,736 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-03-03 16:31:15,737 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-03-03 16:31:16,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-03-03 16:31:16,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-03-03 16:31:16,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:16,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:16,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 3341 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 16:31:16,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-03 16:31:17,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:31:17,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135920579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:17,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:31:17,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 16:31:17,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900931481] [2025-03-03 16:31:17,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:17,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:31:17,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:17,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:31:17,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:31:17,042 INFO L87 Difference]: Start difference. First operand 1402 states and 2069 transitions. Second operand has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:17,425 INFO L93 Difference]: Finished difference Result 2049 states and 3026 transitions. [2025-03-03 16:31:17,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:31:17,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 650 [2025-03-03 16:31:17,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:17,430 INFO L225 Difference]: With dead ends: 2049 [2025-03-03 16:31:17,430 INFO L226 Difference]: Without dead ends: 1401 [2025-03-03 16:31:17,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:31:17,431 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 808 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:17,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 1354 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:31:17,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-03-03 16:31:17,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1401. [2025-03-03 16:31:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1384 states have (on average 1.4710982658959537) internal successors, (2036), 1384 states have internal predecessors, (2036), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2066 transitions. [2025-03-03 16:31:17,450 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2066 transitions. Word has length 650 [2025-03-03 16:31:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:17,450 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 2066 transitions. [2025-03-03 16:31:17,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2066 transitions. [2025-03-03 16:31:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-03-03 16:31:17,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:17,455 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:17,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 16:31:17,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 16:31:17,656 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:17,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:17,656 INFO L85 PathProgramCache]: Analyzing trace with hash 676948699, now seen corresponding path program 1 times [2025-03-03 16:31:17,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:17,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492896409] [2025-03-03 16:31:17,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:17,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-03 16:31:17,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-03 16:31:17,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:17,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:18,437 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 178 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 16:31:18,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:18,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492896409] [2025-03-03 16:31:18,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492896409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:18,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512956228] [2025-03-03 16:31:18,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:18,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:18,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:18,440 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-03-03 16:31:18,441 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-03-03 16:31:18,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-03 16:31:19,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-03 16:31:19,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:19,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:19,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 3344 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 16:31:19,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 278 proven. 92 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-03 16:31:19,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-03 16:31:20,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512956228] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:20,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:20,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 14] total 19 [2025-03-03 16:31:20,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570876541] [2025-03-03 16:31:20,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:20,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:31:20,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:20,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:31:20,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:31:20,280 INFO L87 Difference]: Start difference. First operand 1401 states and 2066 transitions. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:20,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:20,575 INFO L93 Difference]: Finished difference Result 2048 states and 3021 transitions. [2025-03-03 16:31:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:31:20,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 651 [2025-03-03 16:31:20,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:20,579 INFO L225 Difference]: With dead ends: 2048 [2025-03-03 16:31:20,579 INFO L226 Difference]: Without dead ends: 1401 [2025-03-03 16:31:20,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1305 GetRequests, 1287 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:31:20,580 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 1811 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1816 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:20,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1816 Valid, 1672 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:31:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-03-03 16:31:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1401. [2025-03-03 16:31:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1384 states have (on average 1.4703757225433527) internal successors, (2035), 1384 states have internal predecessors, (2035), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2065 transitions. [2025-03-03 16:31:20,599 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2065 transitions. Word has length 651 [2025-03-03 16:31:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:20,599 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 2065 transitions. [2025-03-03 16:31:20,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2065 transitions. [2025-03-03 16:31:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2025-03-03 16:31:20,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:20,621 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:20,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 16:31:20,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:20,822 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:20,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:20,823 INFO L85 PathProgramCache]: Analyzing trace with hash -262231837, now seen corresponding path program 1 times [2025-03-03 16:31:20,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:20,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348504505] [2025-03-03 16:31:20,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:20,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:20,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 652 statements into 1 equivalence classes. [2025-03-03 16:31:21,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 652 of 652 statements. [2025-03-03 16:31:21,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:21,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:21,389 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 178 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 16:31:21,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:21,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348504505] [2025-03-03 16:31:21,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348504505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:21,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377640655] [2025-03-03 16:31:21,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:21,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:21,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:21,392 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-03-03 16:31:21,394 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-03-03 16:31:21,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 652 statements into 1 equivalence classes. [2025-03-03 16:31:22,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 652 of 652 statements. [2025-03-03 16:31:22,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:22,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:22,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 3347 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 16:31:22,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 278 proven. 92 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-03 16:31:22,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-03 16:31:23,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377640655] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:23,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:23,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 14] total 19 [2025-03-03 16:31:23,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071285365] [2025-03-03 16:31:23,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:23,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:31:23,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:23,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:31:23,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:31:23,481 INFO L87 Difference]: Start difference. First operand 1401 states and 2065 transitions. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:23,792 INFO L93 Difference]: Finished difference Result 2048 states and 3019 transitions. [2025-03-03 16:31:23,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:31:23,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 652 [2025-03-03 16:31:23,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:23,796 INFO L225 Difference]: With dead ends: 2048 [2025-03-03 16:31:23,796 INFO L226 Difference]: Without dead ends: 1401 [2025-03-03 16:31:23,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1307 GetRequests, 1289 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:31:23,799 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 895 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:23,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 1681 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:31:23,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-03-03 16:31:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1401. [2025-03-03 16:31:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1384 states have (on average 1.4696531791907514) internal successors, (2034), 1384 states have internal predecessors, (2034), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2064 transitions. [2025-03-03 16:31:23,832 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2064 transitions. Word has length 652 [2025-03-03 16:31:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:23,833 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 2064 transitions. [2025-03-03 16:31:23,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2064 transitions. [2025-03-03 16:31:23,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2025-03-03 16:31:23,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:23,839 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:23,852 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-03-03 16:31:24,040 WARN L453 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-03-03 16:31:24,040 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:24,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:24,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1389342238, now seen corresponding path program 1 times [2025-03-03 16:31:24,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:24,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457041200] [2025-03-03 16:31:24,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:24,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:24,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-03-03 16:31:24,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-03-03 16:31:24,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:24,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 178 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 16:31:24,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:24,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457041200] [2025-03-03 16:31:24,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457041200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:24,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411114899] [2025-03-03 16:31:24,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:24,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:24,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:24,637 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-03-03 16:31:24,638 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-03-03 16:31:25,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-03-03 16:31:25,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-03-03 16:31:25,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:25,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:25,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 3350 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 16:31:25,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 278 proven. 92 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-03 16:31:26,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-03 16:31:26,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411114899] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:26,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:26,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 14] total 19 [2025-03-03 16:31:26,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617736978] [2025-03-03 16:31:26,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:26,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:31:26,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:26,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:31:26,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:31:26,674 INFO L87 Difference]: Start difference. First operand 1401 states and 2064 transitions. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:26,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:26,943 INFO L93 Difference]: Finished difference Result 2048 states and 3017 transitions. [2025-03-03 16:31:26,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:31:26,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 653 [2025-03-03 16:31:26,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:26,947 INFO L225 Difference]: With dead ends: 2048 [2025-03-03 16:31:26,947 INFO L226 Difference]: Without dead ends: 1401 [2025-03-03 16:31:26,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1309 GetRequests, 1291 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:31:26,948 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 889 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:26,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 1681 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:31:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-03-03 16:31:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1401. [2025-03-03 16:31:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1384 states have (on average 1.4689306358381502) internal successors, (2033), 1384 states have internal predecessors, (2033), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2063 transitions. [2025-03-03 16:31:26,967 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2063 transitions. Word has length 653 [2025-03-03 16:31:26,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:26,968 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 2063 transitions. [2025-03-03 16:31:26,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:26,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2063 transitions. [2025-03-03 16:31:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2025-03-03 16:31:26,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:26,971 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:26,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-03 16:31:27,172 WARN L453 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-03-03 16:31:27,172 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:27,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:27,173 INFO L85 PathProgramCache]: Analyzing trace with hash 205640505, now seen corresponding path program 1 times [2025-03-03 16:31:27,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:27,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803691639] [2025-03-03 16:31:27,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:27,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:27,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 654 statements into 1 equivalence classes. [2025-03-03 16:31:27,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 654 of 654 statements. [2025-03-03 16:31:27,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:27,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 178 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 16:31:27,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:27,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803691639] [2025-03-03 16:31:27,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803691639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:27,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925218341] [2025-03-03 16:31:27,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:27,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:27,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:27,746 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-03-03 16:31:27,747 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-03-03 16:31:28,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 654 statements into 1 equivalence classes. [2025-03-03 16:31:28,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 654 of 654 statements. [2025-03-03 16:31:28,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:28,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:28,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 3353 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 16:31:28,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 278 proven. 92 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-03 16:31:29,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-03 16:31:29,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925218341] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:29,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:29,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 14] total 19 [2025-03-03 16:31:29,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411785091] [2025-03-03 16:31:29,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:29,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:31:29,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:29,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:31:29,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:31:29,785 INFO L87 Difference]: Start difference. First operand 1401 states and 2063 transitions. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:30,053 INFO L93 Difference]: Finished difference Result 2048 states and 3015 transitions. [2025-03-03 16:31:30,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:31:30,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 654 [2025-03-03 16:31:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:30,056 INFO L225 Difference]: With dead ends: 2048 [2025-03-03 16:31:30,056 INFO L226 Difference]: Without dead ends: 1401 [2025-03-03 16:31:30,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1311 GetRequests, 1293 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:31:30,062 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 1751 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:30,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 1672 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:31:30,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-03-03 16:31:30,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1401. [2025-03-03 16:31:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1384 states have (on average 1.4682080924855492) internal successors, (2032), 1384 states have internal predecessors, (2032), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2062 transitions. [2025-03-03 16:31:30,081 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2062 transitions. Word has length 654 [2025-03-03 16:31:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:30,081 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 2062 transitions. [2025-03-03 16:31:30,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:30,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2062 transitions. [2025-03-03 16:31:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2025-03-03 16:31:30,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:30,084 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:30,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 16:31:30,284 WARN L453 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-03-03 16:31:30,285 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:30,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:30,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2036181769, now seen corresponding path program 1 times [2025-03-03 16:31:30,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:30,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720481276] [2025-03-03 16:31:30,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:30,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:30,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 655 statements into 1 equivalence classes. [2025-03-03 16:31:30,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 655 of 655 statements. [2025-03-03 16:31:30,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:30,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 178 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 16:31:30,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:30,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720481276] [2025-03-03 16:31:30,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720481276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:30,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811349853] [2025-03-03 16:31:30,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:30,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:30,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:30,969 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-03-03 16:31:30,970 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-03-03 16:31:31,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 655 statements into 1 equivalence classes. [2025-03-03 16:31:31,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 655 of 655 statements. [2025-03-03 16:31:31,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:31,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:31,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 3356 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 16:31:31,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 278 proven. 8 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2025-03-03 16:31:31,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-03 16:31:31,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811349853] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:31,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:31,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-03-03 16:31:31,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002831792] [2025-03-03 16:31:31,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:31,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:31:31,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:31,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:31:31,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:31:31,995 INFO L87 Difference]: Start difference. First operand 1401 states and 2062 transitions. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:32,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:32,193 INFO L93 Difference]: Finished difference Result 2049 states and 3015 transitions. [2025-03-03 16:31:32,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:31:32,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 655 [2025-03-03 16:31:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:32,198 INFO L225 Difference]: With dead ends: 2049 [2025-03-03 16:31:32,198 INFO L226 Difference]: Without dead ends: 1402 [2025-03-03 16:31:32,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1312 GetRequests, 1307 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:31:32,200 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 0 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:32,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1813 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:31:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-03-03 16:31:32,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2025-03-03 16:31:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1385 states have (on average 1.467870036101083) internal successors, (2033), 1385 states have internal predecessors, (2033), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2063 transitions. [2025-03-03 16:31:32,230 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2063 transitions. Word has length 655 [2025-03-03 16:31:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:32,231 INFO L471 AbstractCegarLoop]: Abstraction has 1402 states and 2063 transitions. [2025-03-03 16:31:32,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2063 transitions. [2025-03-03 16:31:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2025-03-03 16:31:32,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:32,235 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:32,251 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-03-03 16:31:32,436 WARN L453 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-03-03 16:31:32,436 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:32,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:32,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1703069952, now seen corresponding path program 1 times [2025-03-03 16:31:32,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:32,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057483933] [2025-03-03 16:31:32,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:32,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:32,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes. [2025-03-03 16:31:32,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 656 of 656 statements. [2025-03-03 16:31:32,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:32,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-03 16:31:33,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:33,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057483933] [2025-03-03 16:31:33,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057483933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:33,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531014975] [2025-03-03 16:31:33,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:33,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:33,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:33,031 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-03-03 16:31:33,032 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-03-03 16:31:33,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes. [2025-03-03 16:31:33,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 656 of 656 statements. [2025-03-03 16:31:33,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:33,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:34,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 3365 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 16:31:34,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 278 proven. 8 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2025-03-03 16:31:34,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2025-03-03 16:31:34,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531014975] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:34,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:34,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-03-03 16:31:34,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527972095] [2025-03-03 16:31:34,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:34,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:31:34,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:34,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:31:34,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:31:34,067 INFO L87 Difference]: Start difference. First operand 1402 states and 2063 transitions. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:34,230 INFO L93 Difference]: Finished difference Result 2051 states and 3017 transitions. [2025-03-03 16:31:34,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:31:34,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 656 [2025-03-03 16:31:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:34,234 INFO L225 Difference]: With dead ends: 2051 [2025-03-03 16:31:34,234 INFO L226 Difference]: Without dead ends: 1403 [2025-03-03 16:31:34,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1314 GetRequests, 1309 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:31:34,235 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 0 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:34,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1813 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:31:34,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-03-03 16:31:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1403. [2025-03-03 16:31:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 1386 states have (on average 1.4675324675324675) internal successors, (2034), 1386 states have internal predecessors, (2034), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 2064 transitions. [2025-03-03 16:31:34,254 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 2064 transitions. Word has length 656 [2025-03-03 16:31:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:34,254 INFO L471 AbstractCegarLoop]: Abstraction has 1403 states and 2064 transitions. [2025-03-03 16:31:34,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 2064 transitions. [2025-03-03 16:31:34,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2025-03-03 16:31:34,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:34,258 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:34,274 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-03-03 16:31:34,458 WARN L453 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-03-03 16:31:34,459 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:34,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:34,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1854037873, now seen corresponding path program 1 times [2025-03-03 16:31:34,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:34,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145451147] [2025-03-03 16:31:34,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:34,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:34,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 657 statements into 1 equivalence classes. [2025-03-03 16:31:34,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 657 of 657 statements. [2025-03-03 16:31:34,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:34,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 178 proven. 1 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2025-03-03 16:31:35,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:35,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145451147] [2025-03-03 16:31:35,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145451147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:35,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741224241] [2025-03-03 16:31:35,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:35,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:35,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:35,027 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-03-03 16:31:35,027 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-03-03 16:31:35,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 657 statements into 1 equivalence classes. [2025-03-03 16:31:36,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 657 of 657 statements. [2025-03-03 16:31:36,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:36,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:36,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 3374 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 16:31:36,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 278 proven. 8 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-03-03 16:31:36,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-03-03 16:31:36,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741224241] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:36,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:36,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-03-03 16:31:36,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180374883] [2025-03-03 16:31:36,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:36,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:31:36,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:36,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:31:36,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:31:36,150 INFO L87 Difference]: Start difference. First operand 1403 states and 2064 transitions. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:36,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:36,314 INFO L93 Difference]: Finished difference Result 2053 states and 3019 transitions. [2025-03-03 16:31:36,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:31:36,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 657 [2025-03-03 16:31:36,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:36,317 INFO L225 Difference]: With dead ends: 2053 [2025-03-03 16:31:36,317 INFO L226 Difference]: Without dead ends: 1404 [2025-03-03 16:31:36,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1316 GetRequests, 1311 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:31:36,318 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 0 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:36,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1813 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:31:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2025-03-03 16:31:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1404. [2025-03-03 16:31:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1387 states have (on average 1.4671953857245854) internal successors, (2035), 1387 states have internal predecessors, (2035), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2065 transitions. [2025-03-03 16:31:36,336 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2065 transitions. Word has length 657 [2025-03-03 16:31:36,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:36,337 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 2065 transitions. [2025-03-03 16:31:36,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 16:31:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2065 transitions. [2025-03-03 16:31:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-03 16:31:36,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:36,340 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:36,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-03 16:31:36,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-03 16:31:36,541 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:36,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:36,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1531288896, now seen corresponding path program 1 times [2025-03-03 16:31:36,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:36,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253781956] [2025-03-03 16:31:36,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:36,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:36,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 16:31:36,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 16:31:36,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:36,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 178 proven. 1 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-03-03 16:31:37,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:37,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253781956] [2025-03-03 16:31:37,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253781956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:37,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957498914] [2025-03-03 16:31:37,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:37,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:37,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:37,226 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-03-03 16:31:37,226 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-03-03 16:31:38,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 16:31:38,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 16:31:38,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:38,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:38,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 3383 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 16:31:38,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 278 proven. 30 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-03 16:31:38,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:38,367 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 178 proven. 1 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-03-03 16:31:38,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957498914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:31:38,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:31:38,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2025-03-03 16:31:38,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543994514] [2025-03-03 16:31:38,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:31:38,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:31:38,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:38,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:31:38,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:31:38,369 INFO L87 Difference]: Start difference. First operand 1404 states and 2065 transitions. Second operand has 9 states, 9 states have (on average 64.66666666666667) internal successors, (582), 9 states have internal predecessors, (582), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 16:31:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:38,772 INFO L93 Difference]: Finished difference Result 2057 states and 3025 transitions. [2025-03-03 16:31:38,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:31:38,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 64.66666666666667) internal successors, (582), 9 states have internal predecessors, (582), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 658 [2025-03-03 16:31:38,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:38,775 INFO L225 Difference]: With dead ends: 2057 [2025-03-03 16:31:38,775 INFO L226 Difference]: Without dead ends: 1407 [2025-03-03 16:31:38,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1319 GetRequests, 1311 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:31:38,777 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 10 mSDsluCounter, 3622 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4532 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:38,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4532 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:31:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2025-03-03 16:31:38,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1407. [2025-03-03 16:31:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1390 states have (on average 1.4661870503597123) internal successors, (2038), 1390 states have internal predecessors, (2038), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 2068 transitions. [2025-03-03 16:31:38,796 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 2068 transitions. Word has length 658 [2025-03-03 16:31:38,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:38,796 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 2068 transitions. [2025-03-03 16:31:38,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 64.66666666666667) internal successors, (582), 9 states have internal predecessors, (582), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 16:31:38,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 2068 transitions. [2025-03-03 16:31:38,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-03-03 16:31:38,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:38,800 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:38,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-03 16:31:39,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 16:31:39,001 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:39,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:39,002 INFO L85 PathProgramCache]: Analyzing trace with hash -311475808, now seen corresponding path program 2 times [2025-03-03 16:31:39,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:39,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316292925] [2025-03-03 16:31:39,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:31:39,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:39,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 661 statements into 2 equivalence classes. [2025-03-03 16:31:39,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 173 of 661 statements. [2025-03-03 16:31:39,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 16:31:39,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 2 proven. 171 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-03 16:31:39,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:39,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316292925] [2025-03-03 16:31:39,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316292925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:39,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871449368] [2025-03-03 16:31:39,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:31:39,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:39,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:39,295 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-03-03 16:31:39,296 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-03-03 16:31:40,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 661 statements into 2 equivalence classes. [2025-03-03 16:31:40,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 173 of 661 statements. [2025-03-03 16:31:40,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 16:31:40,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:40,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 16:31:40,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 270 proven. 3 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-03 16:31:40,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 170 proven. 3 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-03 16:31:42,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871449368] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:31:42,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:31:42,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2025-03-03 16:31:42,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567234188] [2025-03-03 16:31:42,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:31:42,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 16:31:42,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:42,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 16:31:42,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:31:42,359 INFO L87 Difference]: Start difference. First operand 1407 states and 2068 transitions. Second operand has 15 states, 15 states have (on average 101.2) internal successors, (1518), 15 states have internal predecessors, (1518), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2025-03-03 16:31:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:43,052 INFO L93 Difference]: Finished difference Result 2532 states and 3725 transitions. [2025-03-03 16:31:43,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:31:43,053 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 101.2) internal successors, (1518), 15 states have internal predecessors, (1518), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 661 [2025-03-03 16:31:43,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:43,057 INFO L225 Difference]: With dead ends: 2532 [2025-03-03 16:31:43,058 INFO L226 Difference]: Without dead ends: 1419 [2025-03-03 16:31:43,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1331 GetRequests, 1314 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:31:43,060 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 1377 mSDsluCounter, 1999 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 2666 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:43,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 2666 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:31:43,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2025-03-03 16:31:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1416. [2025-03-03 16:31:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1399 states have (on average 1.4610436025732667) internal successors, (2044), 1399 states have internal predecessors, (2044), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2074 transitions. [2025-03-03 16:31:43,083 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2074 transitions. Word has length 661 [2025-03-03 16:31:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:43,083 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 2074 transitions. [2025-03-03 16:31:43,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 101.2) internal successors, (1518), 15 states have internal predecessors, (1518), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2025-03-03 16:31:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2074 transitions. [2025-03-03 16:31:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2025-03-03 16:31:43,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:43,087 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:43,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-03 16:31:43,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 16:31:43,288 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:43,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:43,290 INFO L85 PathProgramCache]: Analyzing trace with hash -754914836, now seen corresponding path program 1 times [2025-03-03 16:31:43,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:43,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821811822] [2025-03-03 16:31:43,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:43,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:43,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-03-03 16:31:43,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-03-03 16:31:43,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:43,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-03-03 16:31:44,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821811822] [2025-03-03 16:31:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821811822] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557790122] [2025-03-03 16:31:44,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:44,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:44,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:44,008 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-03-03 16:31:44,008 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-03-03 16:31:44,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-03-03 16:31:45,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-03-03 16:31:45,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:45,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:45,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 3418 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 16:31:45,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 280 proven. 84 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-03-03 16:31:45,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-03-03 16:31:45,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557790122] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:31:45,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:31:45,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 7] total 18 [2025-03-03 16:31:45,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716573776] [2025-03-03 16:31:45,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:31:45,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 16:31:45,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:45,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 16:31:45,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-03 16:31:45,290 INFO L87 Difference]: Start difference. First operand 1416 states and 2074 transitions. Second operand has 18 states, 18 states have (on average 33.388888888888886) internal successors, (601), 18 states have internal predecessors, (601), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 16:31:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:45,953 INFO L93 Difference]: Finished difference Result 2076 states and 3041 transitions. [2025-03-03 16:31:45,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 16:31:45,953 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 33.388888888888886) internal successors, (601), 18 states have internal predecessors, (601), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 665 [2025-03-03 16:31:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:45,956 INFO L225 Difference]: With dead ends: 2076 [2025-03-03 16:31:45,956 INFO L226 Difference]: Without dead ends: 1420 [2025-03-03 16:31:45,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1337 GetRequests, 1319 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:31:45,957 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 22 mSDsluCounter, 10083 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11004 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:45,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11004 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:31:45,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2025-03-03 16:31:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420. [2025-03-03 16:31:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1403 states have (on average 1.459729151817534) internal successors, (2048), 1403 states have internal predecessors, (2048), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 2078 transitions. [2025-03-03 16:31:45,976 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 2078 transitions. Word has length 665 [2025-03-03 16:31:45,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:45,977 INFO L471 AbstractCegarLoop]: Abstraction has 1420 states and 2078 transitions. [2025-03-03 16:31:45,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 33.388888888888886) internal successors, (601), 18 states have internal predecessors, (601), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 16:31:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2078 transitions. [2025-03-03 16:31:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2025-03-03 16:31:45,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:45,980 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:45,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-03 16:31:46,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:46,180 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:46,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:46,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1012609300, now seen corresponding path program 2 times [2025-03-03 16:31:46,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:46,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085107969] [2025-03-03 16:31:46,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:31:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:46,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 669 statements into 2 equivalence classes. [2025-03-03 16:31:46,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 175 of 669 statements. [2025-03-03 16:31:46,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 16:31:46,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2025-03-03 16:31:46,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:46,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085107969] [2025-03-03 16:31:46,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085107969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:46,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:31:46,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:31:46,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968828444] [2025-03-03 16:31:46,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:46,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:31:46,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:46,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:31:46,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:31:46,580 INFO L87 Difference]: Start difference. First operand 1420 states and 2078 transitions. Second operand has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:46,895 INFO L93 Difference]: Finished difference Result 2378 states and 3483 transitions. [2025-03-03 16:31:46,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:31:46,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 669 [2025-03-03 16:31:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:46,898 INFO L225 Difference]: With dead ends: 2378 [2025-03-03 16:31:46,898 INFO L226 Difference]: Without dead ends: 1716 [2025-03-03 16:31:46,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:31:46,899 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 142 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 3604 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:46,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 3604 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:31:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2025-03-03 16:31:46,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1712. [2025-03-03 16:31:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1695 states have (on average 1.463126843657817) internal successors, (2480), 1695 states have internal predecessors, (2480), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2510 transitions. [2025-03-03 16:31:46,922 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2510 transitions. Word has length 669 [2025-03-03 16:31:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:46,923 INFO L471 AbstractCegarLoop]: Abstraction has 1712 states and 2510 transitions. [2025-03-03 16:31:46,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2510 transitions. [2025-03-03 16:31:46,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2025-03-03 16:31:46,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:46,927 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:46,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 16:31:46,927 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:46,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:46,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1858399140, now seen corresponding path program 1 times [2025-03-03 16:31:46,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:46,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873553480] [2025-03-03 16:31:46,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:46,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:47,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-03-03 16:31:47,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-03-03 16:31:47,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:47,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 181 proven. 1 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-03-03 16:31:47,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:47,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873553480] [2025-03-03 16:31:47,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873553480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:47,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902513828] [2025-03-03 16:31:47,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:47,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:47,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:47,540 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-03-03 16:31:47,541 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-03-03 16:31:48,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-03-03 16:31:48,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-03-03 16:31:48,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:48,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:48,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 3460 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 16:31:48,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 281 proven. 30 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-03-03 16:31:48,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 181 proven. 1 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-03-03 16:31:48,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902513828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:31:48,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:31:48,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2025-03-03 16:31:48,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038505219] [2025-03-03 16:31:48,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:31:48,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:31:48,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:48,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:31:48,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:31:48,842 INFO L87 Difference]: Start difference. First operand 1712 states and 2510 transitions. Second operand has 9 states, 9 states have (on average 65.33333333333333) internal successors, (588), 9 states have internal predecessors, (588), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 16:31:49,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:49,223 INFO L93 Difference]: Finished difference Result 2521 states and 3695 transitions. [2025-03-03 16:31:49,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:31:49,223 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 65.33333333333333) internal successors, (588), 9 states have internal predecessors, (588), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 671 [2025-03-03 16:31:49,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:49,226 INFO L225 Difference]: With dead ends: 2521 [2025-03-03 16:31:49,226 INFO L226 Difference]: Without dead ends: 1715 [2025-03-03 16:31:49,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1345 GetRequests, 1337 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:31:49,227 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 10 mSDsluCounter, 5430 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6339 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:49,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 6339 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:31:49,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-03-03 16:31:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1715. [2025-03-03 16:31:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1698 states have (on average 1.4623085983510011) internal successors, (2483), 1698 states have internal predecessors, (2483), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2513 transitions. [2025-03-03 16:31:49,248 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2513 transitions. Word has length 671 [2025-03-03 16:31:49,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:49,248 INFO L471 AbstractCegarLoop]: Abstraction has 1715 states and 2513 transitions. [2025-03-03 16:31:49,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.33333333333333) internal successors, (588), 9 states have internal predecessors, (588), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 16:31:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2513 transitions. [2025-03-03 16:31:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2025-03-03 16:31:49,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:49,252 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:49,269 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-03-03 16:31:49,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:49,453 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:49,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:49,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2104376845, now seen corresponding path program 2 times [2025-03-03 16:31:49,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:49,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148113376] [2025-03-03 16:31:49,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:31:49,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:49,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 674 statements into 2 equivalence classes. [2025-03-03 16:31:49,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 176 of 674 statements. [2025-03-03 16:31:49,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 16:31:49,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-03-03 16:31:49,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:49,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148113376] [2025-03-03 16:31:49,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148113376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:31:49,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:31:49,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:31:49,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278753320] [2025-03-03 16:31:49,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:49,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:31:49,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:49,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:31:49,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:31:49,914 INFO L87 Difference]: Start difference. First operand 1715 states and 2513 transitions. Second operand has 7 states, 7 states have (on average 69.14285714285714) internal successors, (484), 7 states have internal predecessors, (484), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:50,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:50,319 INFO L93 Difference]: Finished difference Result 2532 states and 3706 transitions. [2025-03-03 16:31:50,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:31:50,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 69.14285714285714) internal successors, (484), 7 states have internal predecessors, (484), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 674 [2025-03-03 16:31:50,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:50,323 INFO L225 Difference]: With dead ends: 2532 [2025-03-03 16:31:50,323 INFO L226 Difference]: Without dead ends: 1723 [2025-03-03 16:31:50,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:31:50,325 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 141 mSDsluCounter, 4495 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 5397 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:50,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 5397 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:31:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2025-03-03 16:31:50,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1716. [2025-03-03 16:31:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1699 states have (on average 1.4626250735726898) internal successors, (2485), 1699 states have internal predecessors, (2485), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2515 transitions. [2025-03-03 16:31:50,363 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2515 transitions. Word has length 674 [2025-03-03 16:31:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:50,364 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2515 transitions. [2025-03-03 16:31:50,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.14285714285714) internal successors, (484), 7 states have internal predecessors, (484), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:50,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2515 transitions. [2025-03-03 16:31:50,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2025-03-03 16:31:50,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:50,371 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:50,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 16:31:50,371 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:50,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:50,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1079261762, now seen corresponding path program 1 times [2025-03-03 16:31:50,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:50,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824890321] [2025-03-03 16:31:50,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:50,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:50,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-03-03 16:31:50,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-03-03 16:31:50,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:50,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-03-03 16:31:51,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:51,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824890321] [2025-03-03 16:31:51,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824890321] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:51,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906079565] [2025-03-03 16:31:51,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:51,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:51,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:51,213 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-03-03 16:31:51,215 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-03-03 16:31:52,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-03-03 16:31:52,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-03-03 16:31:52,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:52,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:52,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 3487 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:31:52,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-03-03 16:31:52,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-03 16:31:52,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906079565] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:52,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:31:52,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 15 [2025-03-03 16:31:52,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616209032] [2025-03-03 16:31:52,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:31:52,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:31:52,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:52,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:31:52,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:31:52,610 INFO L87 Difference]: Start difference. First operand 1716 states and 2515 transitions. Second operand has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:52,892 INFO L93 Difference]: Finished difference Result 2796 states and 4094 transitions. [2025-03-03 16:31:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:31:52,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 674 [2025-03-03 16:31:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:52,900 INFO L225 Difference]: With dead ends: 2796 [2025-03-03 16:31:52,900 INFO L226 Difference]: Without dead ends: 1834 [2025-03-03 16:31:52,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1353 GetRequests, 1340 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:31:52,902 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 40 mSDsluCounter, 2705 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3610 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:52,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3610 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:31:52,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2025-03-03 16:31:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1834. [2025-03-03 16:31:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1817 states have (on average 1.4600990643918548) internal successors, (2653), 1817 states have internal predecessors, (2653), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2683 transitions. [2025-03-03 16:31:52,927 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2683 transitions. Word has length 674 [2025-03-03 16:31:52,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:52,927 INFO L471 AbstractCegarLoop]: Abstraction has 1834 states and 2683 transitions. [2025-03-03 16:31:52,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 16:31:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2683 transitions. [2025-03-03 16:31:52,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2025-03-03 16:31:52,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:52,932 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:52,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-03 16:31:53,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:53,132 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:53,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:53,133 INFO L85 PathProgramCache]: Analyzing trace with hash 753754593, now seen corresponding path program 1 times [2025-03-03 16:31:53,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:53,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190441879] [2025-03-03 16:31:53,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:53,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:53,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 675 statements into 1 equivalence classes. [2025-03-03 16:31:53,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 675 of 675 statements. [2025-03-03 16:31:53,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:53,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 181 proven. 10 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-03-03 16:31:53,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:53,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190441879] [2025-03-03 16:31:53,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190441879] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:53,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378283114] [2025-03-03 16:31:53,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:31:53,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:53,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:53,895 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:53,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-03 16:31:54,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 675 statements into 1 equivalence classes. [2025-03-03 16:31:55,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 675 of 675 statements. [2025-03-03 16:31:55,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:31:55,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:55,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 3488 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 16:31:55,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:31:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 281 proven. 84 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-03-03 16:31:55,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:31:55,323 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 181 proven. 10 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-03-03 16:31:55,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378283114] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:31:55,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:31:55,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 7] total 18 [2025-03-03 16:31:55,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806051773] [2025-03-03 16:31:55,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:31:55,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 16:31:55,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:31:55,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 16:31:55,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-03 16:31:55,325 INFO L87 Difference]: Start difference. First operand 1834 states and 2683 transitions. Second operand has 18 states, 18 states have (on average 33.55555555555556) internal successors, (604), 18 states have internal predecessors, (604), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 16:31:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:31:55,943 INFO L93 Difference]: Finished difference Result 2696 states and 3943 transitions. [2025-03-03 16:31:55,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 16:31:55,943 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 33.55555555555556) internal successors, (604), 18 states have internal predecessors, (604), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 675 [2025-03-03 16:31:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:31:55,946 INFO L225 Difference]: With dead ends: 2696 [2025-03-03 16:31:55,947 INFO L226 Difference]: Without dead ends: 1838 [2025-03-03 16:31:55,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1357 GetRequests, 1339 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:31:55,948 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 22 mSDsluCounter, 9165 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10086 SdHoareTripleChecker+Invalid, 2138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:31:55,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10086 Invalid, 2138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2138 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:31:55,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-03 16:31:55,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2025-03-03 16:31:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1821 states have (on average 1.4590884129599122) internal successors, (2657), 1821 states have internal predecessors, (2657), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 16:31:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2687 transitions. [2025-03-03 16:31:55,971 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2687 transitions. Word has length 675 [2025-03-03 16:31:55,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:31:55,971 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2687 transitions. [2025-03-03 16:31:55,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 33.55555555555556) internal successors, (604), 18 states have internal predecessors, (604), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 16:31:55,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2687 transitions. [2025-03-03 16:31:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2025-03-03 16:31:55,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:31:55,975 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 16:31:55,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-03 16:31:56,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:56,176 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:31:56,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:31:56,177 INFO L85 PathProgramCache]: Analyzing trace with hash -226546143, now seen corresponding path program 2 times [2025-03-03 16:31:56,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:31:56,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600107796] [2025-03-03 16:31:56,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:31:56,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:31:56,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 679 statements into 2 equivalence classes. [2025-03-03 16:31:56,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 177 of 679 statements. [2025-03-03 16:31:56,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 16:31:56,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 4 proven. 108 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-03-03 16:31:57,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:31:57,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600107796] [2025-03-03 16:31:57,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600107796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:31:57,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452563420] [2025-03-03 16:31:57,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:31:57,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:31:57,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:31:57,107 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:31:57,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-03 16:31:58,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 679 statements into 2 equivalence classes. [2025-03-03 16:31:58,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 177 of 679 statements. [2025-03-03 16:31:58,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 16:31:58,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:31:58,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-03-03 16:31:58,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:32:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 68 proven. 110 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-03-03 16:32:01,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:32:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 2 proven. 176 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-03-03 16:32:06,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452563420] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:32:06,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:32:06,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 22, 19] total 47 [2025-03-03 16:32:06,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229480896] [2025-03-03 16:32:06,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:32:06,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-03 16:32:06,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:32:06,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-03 16:32:06,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=1838, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 16:32:06,143 INFO L87 Difference]: Start difference. First operand 1838 states and 2687 transitions. Second operand has 47 states, 47 states have (on average 35.04255319148936) internal successors, (1647), 47 states have internal predecessors, (1647), 5 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25)