./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c388302d41c726edd49d8ab9cbc4112c9573480c6a1055a6e43438be9deac626 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:19:41,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:19:41,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:19:41,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:19:41,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:19:41,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:19:41,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:19:41,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:19:41,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:19:41,530 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:19:41,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:19:41,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:19:41,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:19:41,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:19:41,530 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:19:41,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:19:41,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:19:41,530 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:19:41,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:19:41,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:19:41,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:19:41,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:19:41,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:19:41,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:19:41,531 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:19:41,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:19:41,531 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:19:41,531 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:19:41,531 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:19:41,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:19:41,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:19:41,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:19:41,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:19:41,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:19:41,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:19:41,531 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:19:41,531 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:19:41,531 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:19:41,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:19:41,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:19:41,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:19:41,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:19:41,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:19:41,532 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c388302d41c726edd49d8ab9cbc4112c9573480c6a1055a6e43438be9deac626 [2025-03-03 16:19:41,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:19:41,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:19:41,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:19:41,738 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:19:41,739 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:19:41,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2025-03-03 16:19:42,852 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53eb70354/4f474883e86b45c699875ec338ea5fe5/FLAGa5b3ba8ba [2025-03-03 16:19:43,109 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:19:43,109 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2025-03-03 16:19:43,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53eb70354/4f474883e86b45c699875ec338ea5fe5/FLAGa5b3ba8ba [2025-03-03 16:19:43,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53eb70354/4f474883e86b45c699875ec338ea5fe5 [2025-03-03 16:19:43,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:19:43,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:19:43,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:19:43,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:19:43,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:19:43,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43515eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43, skipping insertion in model container [2025-03-03 16:19:43,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:19:43,259 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/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[913,926] [2025-03-03 16:19:43,297 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/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2025-03-03 16:19:43,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:19:43,349 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:19:43,358 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/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[913,926] [2025-03-03 16:19:43,374 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/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2025-03-03 16:19:43,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:19:43,413 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:19:43,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43 WrapperNode [2025-03-03 16:19:43,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:19:43,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:19:43,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:19:43,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:19:43,420 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:19:43" (1/1) ... [2025-03-03 16:19:43,426 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:19:43" (1/1) ... [2025-03-03 16:19:43,453 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 456 [2025-03-03 16:19:43,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:19:43,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:19:43,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:19:43,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:19:43,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,474 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:19:43,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,478 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:19:43,485 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:19:43,485 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:19:43,485 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:19:43,490 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (1/1) ... [2025-03-03 16:19:43,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:19:43,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:19:43,515 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:19:43,516 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:19:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:19:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:19:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:19:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-03-03 16:19:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-03-03 16:19:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:19:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:19:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:19:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:19:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:19:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:19:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:19:43,533 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:19:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:19:43,533 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:19:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:19:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:19:43,533 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:19:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:19:43,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:19:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:19:43,533 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:19:43,610 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:19:43,612 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:19:43,985 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-03-03 16:19:43,985 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:19:43,994 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:19:43,995 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:19:43,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:19:43 BoogieIcfgContainer [2025-03-03 16:19:43,995 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:19:43,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:19:43,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:19:44,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:19:44,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:19:43" (1/3) ... [2025-03-03 16:19:44,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b198b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:19:44, skipping insertion in model container [2025-03-03 16:19:44,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:19:43" (2/3) ... [2025-03-03 16:19:44,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b198b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:19:44, skipping insertion in model container [2025-03-03 16:19:44,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:19:43" (3/3) ... [2025-03-03 16:19:44,002 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2025-03-03 16:19:44,013 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:19:44,016 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.02.cil-1.c that has 10 procedures, 212 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-03-03 16:19:44,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:19:44,060 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;@5175f196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:19:44,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:19:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 212 states, 178 states have (on average 1.4887640449438202) internal successors, (265), 183 states have internal predecessors, (265), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 16:19:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 16:19:44,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:44,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:44,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:44,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:44,077 INFO L85 PathProgramCache]: Analyzing trace with hash -824378389, now seen corresponding path program 1 times [2025-03-03 16:19:44,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:44,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697296380] [2025-03-03 16:19:44,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:44,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:44,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 16:19:44,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 16:19:44,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:44,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:19:44,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:44,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697296380] [2025-03-03 16:19:44,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697296380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:44,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:44,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:19:44,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646627466] [2025-03-03 16:19:44,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:44,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:44,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:44,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:44,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:19:44,323 INFO L87 Difference]: Start difference. First operand has 212 states, 178 states have (on average 1.4887640449438202) internal successors, (265), 183 states have internal predecessors, (265), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 16:19:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:44,384 INFO L93 Difference]: Finished difference Result 408 states and 592 transitions. [2025-03-03 16:19:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:44,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-03-03 16:19:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:44,395 INFO L225 Difference]: With dead ends: 408 [2025-03-03 16:19:44,395 INFO L226 Difference]: Without dead ends: 202 [2025-03-03 16:19:44,399 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:19:44,401 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 95 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:44,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 488 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:44,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-03 16:19:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-03-03 16:19:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.4294117647058824) internal successors, (243), 173 states have internal predecessors, (243), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 16:19:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 285 transitions. [2025-03-03 16:19:44,441 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 285 transitions. Word has length 44 [2025-03-03 16:19:44,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:44,441 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 285 transitions. [2025-03-03 16:19:44,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 16:19:44,443 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 285 transitions. [2025-03-03 16:19:44,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 16:19:44,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:44,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:44,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:19:44,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:44,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:44,446 INFO L85 PathProgramCache]: Analyzing trace with hash 98305194, now seen corresponding path program 1 times [2025-03-03 16:19:44,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:44,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255364601] [2025-03-03 16:19:44,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:44,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:44,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 16:19:44,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 16:19:44,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:44,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:19:44,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:44,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255364601] [2025-03-03 16:19:44,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255364601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:44,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:44,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:19:44,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134919639] [2025-03-03 16:19:44,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:44,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:44,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:44,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:44,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:19:44,559 INFO L87 Difference]: Start difference. First operand 202 states and 285 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 16:19:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:44,611 INFO L93 Difference]: Finished difference Result 326 states and 457 transitions. [2025-03-03 16:19:44,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:44,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-03-03 16:19:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:44,616 INFO L225 Difference]: With dead ends: 326 [2025-03-03 16:19:44,616 INFO L226 Difference]: Without dead ends: 262 [2025-03-03 16:19:44,617 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:19:44,617 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 263 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:44,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 381 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:44,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-03 16:19:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2025-03-03 16:19:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 220 states have (on average 1.4045454545454545) internal successors, (309), 223 states have internal predecessors, (309), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2025-03-03 16:19:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 363 transitions. [2025-03-03 16:19:44,641 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 363 transitions. Word has length 44 [2025-03-03 16:19:44,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:44,641 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 363 transitions. [2025-03-03 16:19:44,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 16:19:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 363 transitions. [2025-03-03 16:19:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 16:19:44,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:44,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:44,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:19:44,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:44,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:44,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1508474249, now seen corresponding path program 1 times [2025-03-03 16:19:44,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:44,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640023287] [2025-03-03 16:19:44,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:44,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:44,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 16:19:44,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 16:19:44,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:44,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:19:44,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:44,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640023287] [2025-03-03 16:19:44,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640023287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:44,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:44,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:19:44,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124360985] [2025-03-03 16:19:44,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:44,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:44,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:44,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:44,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:19:44,707 INFO L87 Difference]: Start difference. First operand 258 states and 363 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 16:19:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:44,746 INFO L93 Difference]: Finished difference Result 486 states and 683 transitions. [2025-03-03 16:19:44,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:44,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2025-03-03 16:19:44,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:44,750 INFO L225 Difference]: With dead ends: 486 [2025-03-03 16:19:44,751 INFO L226 Difference]: Without dead ends: 368 [2025-03-03 16:19:44,751 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:19:44,754 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 260 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:44,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 363 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:44,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-03 16:19:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 364. [2025-03-03 16:19:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 314 states have (on average 1.3789808917197452) internal successors, (433), 317 states have internal predecessors, (433), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (40), 32 states have call predecessors, (40), 32 states have call successors, (40) [2025-03-03 16:19:44,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 507 transitions. [2025-03-03 16:19:44,786 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 507 transitions. Word has length 45 [2025-03-03 16:19:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:44,787 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 507 transitions. [2025-03-03 16:19:44,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 16:19:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 507 transitions. [2025-03-03 16:19:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 16:19:44,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:44,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:44,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:19:44,791 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:44,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:44,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1787491004, now seen corresponding path program 1 times [2025-03-03 16:19:44,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:44,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458748160] [2025-03-03 16:19:44,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:44,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:44,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 16:19:44,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 16:19:44,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:44,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:19:44,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:44,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458748160] [2025-03-03 16:19:44,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458748160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:44,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:44,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:19:44,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110528972] [2025-03-03 16:19:44,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:44,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:44,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:44,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:44,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:19:44,850 INFO L87 Difference]: Start difference. First operand 364 states and 507 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 16:19:44,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:44,885 INFO L93 Difference]: Finished difference Result 772 states and 1060 transitions. [2025-03-03 16:19:44,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:44,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2025-03-03 16:19:44,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:44,888 INFO L225 Difference]: With dead ends: 772 [2025-03-03 16:19:44,888 INFO L226 Difference]: Without dead ends: 548 [2025-03-03 16:19:44,889 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:19:44,889 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 67 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:44,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 572 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:44,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-03 16:19:44,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 489. [2025-03-03 16:19:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 427 states have (on average 1.3629976580796253) internal successors, (582), 432 states have internal predecessors, (582), 40 states have call successors, (40), 21 states have call predecessors, (40), 20 states have return successors, (48), 36 states have call predecessors, (48), 38 states have call successors, (48) [2025-03-03 16:19:44,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 670 transitions. [2025-03-03 16:19:44,914 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 670 transitions. Word has length 46 [2025-03-03 16:19:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:44,914 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 670 transitions. [2025-03-03 16:19:44,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 16:19:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 670 transitions. [2025-03-03 16:19:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 16:19:44,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:44,916 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:19:44,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:19:44,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:44,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash 605918576, now seen corresponding path program 1 times [2025-03-03 16:19:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:44,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004846558] [2025-03-03 16:19:44,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:44,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:44,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 16:19:44,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 16:19:44,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:44,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:44,999 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 16:19:44,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:44,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004846558] [2025-03-03 16:19:44,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004846558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:44,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:44,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:19:45,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856398084] [2025-03-03 16:19:45,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:45,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:45,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:45,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:45,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:19:45,001 INFO L87 Difference]: Start difference. First operand 489 states and 670 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 16:19:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:45,039 INFO L93 Difference]: Finished difference Result 778 states and 1061 transitions. [2025-03-03 16:19:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:45,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 63 [2025-03-03 16:19:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:45,044 INFO L225 Difference]: With dead ends: 778 [2025-03-03 16:19:45,044 INFO L226 Difference]: Without dead ends: 550 [2025-03-03 16:19:45,069 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:19:45,069 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 55 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:45,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 619 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-03 16:19:45,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2025-03-03 16:19:45,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 480 states have (on average 1.3375) internal successors, (642), 485 states have internal predecessors, (642), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (56), 41 states have call predecessors, (56), 43 states have call successors, (56) [2025-03-03 16:19:45,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 743 transitions. [2025-03-03 16:19:45,094 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 743 transitions. Word has length 63 [2025-03-03 16:19:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:45,095 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 743 transitions. [2025-03-03 16:19:45,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 16:19:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 743 transitions. [2025-03-03 16:19:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:19:45,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:45,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:45,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:19:45,097 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:45,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:45,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1930894202, now seen corresponding path program 1 times [2025-03-03 16:19:45,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:45,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646689785] [2025-03-03 16:19:45,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:45,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:45,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:19:45,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:19:45,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:45,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:19:45,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:45,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646689785] [2025-03-03 16:19:45,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646689785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:45,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:45,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:19:45,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586513559] [2025-03-03 16:19:45,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:45,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:19:45,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:45,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:19:45,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:19:45,195 INFO L87 Difference]: Start difference. First operand 550 states and 743 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:45,494 INFO L93 Difference]: Finished difference Result 804 states and 1113 transitions. [2025-03-03 16:19:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:19:45,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2025-03-03 16:19:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:45,498 INFO L225 Difference]: With dead ends: 804 [2025-03-03 16:19:45,498 INFO L226 Difference]: Without dead ends: 681 [2025-03-03 16:19:45,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:45,499 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 426 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:45,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 677 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:19:45,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-03 16:19:45,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 672. [2025-03-03 16:19:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 584 states have (on average 1.3595890410958904) internal successors, (794), 590 states have internal predecessors, (794), 56 states have call successors, (56), 30 states have call predecessors, (56), 30 states have return successors, (68), 52 states have call predecessors, (68), 54 states have call successors, (68) [2025-03-03 16:19:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 918 transitions. [2025-03-03 16:19:45,526 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 918 transitions. Word has length 68 [2025-03-03 16:19:45,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:45,526 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 918 transitions. [2025-03-03 16:19:45,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:45,527 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 918 transitions. [2025-03-03 16:19:45,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:19:45,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:45,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:45,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:19:45,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:45,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash 547077564, now seen corresponding path program 1 times [2025-03-03 16:19:45,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:45,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242739641] [2025-03-03 16:19:45,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:45,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:45,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:19:45,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:19:45,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:45,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:19:45,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:45,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242739641] [2025-03-03 16:19:45,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242739641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:45,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:45,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:19:45,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105193613] [2025-03-03 16:19:45,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:45,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:19:45,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:45,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:19:45,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:45,623 INFO L87 Difference]: Start difference. First operand 672 states and 918 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:46,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:46,017 INFO L93 Difference]: Finished difference Result 1065 states and 1488 transitions. [2025-03-03 16:19:46,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:19:46,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2025-03-03 16:19:46,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:46,022 INFO L225 Difference]: With dead ends: 1065 [2025-03-03 16:19:46,023 INFO L226 Difference]: Without dead ends: 820 [2025-03-03 16:19:46,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:19:46,024 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 416 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:46,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1162 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:19:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-03-03 16:19:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 787. [2025-03-03 16:19:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 681 states have (on average 1.368575624082232) internal successors, (932), 688 states have internal predecessors, (932), 67 states have call successors, (67), 36 states have call predecessors, (67), 37 states have return successors, (82), 64 states have call predecessors, (82), 65 states have call successors, (82) [2025-03-03 16:19:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1081 transitions. [2025-03-03 16:19:46,062 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1081 transitions. Word has length 68 [2025-03-03 16:19:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:46,062 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1081 transitions. [2025-03-03 16:19:46,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1081 transitions. [2025-03-03 16:19:46,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:19:46,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:46,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:46,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:19:46,064 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:46,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:46,064 INFO L85 PathProgramCache]: Analyzing trace with hash 985087067, now seen corresponding path program 1 times [2025-03-03 16:19:46,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:46,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470969693] [2025-03-03 16:19:46,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:46,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:46,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:19:46,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:19:46,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:46,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:19:46,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:46,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470969693] [2025-03-03 16:19:46,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470969693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:46,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:46,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:19:46,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887092365] [2025-03-03 16:19:46,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:46,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:19:46,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:46,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:19:46,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:46,193 INFO L87 Difference]: Start difference. First operand 787 states and 1081 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:46,569 INFO L93 Difference]: Finished difference Result 1420 states and 1996 transitions. [2025-03-03 16:19:46,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:19:46,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2025-03-03 16:19:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:46,575 INFO L225 Difference]: With dead ends: 1420 [2025-03-03 16:19:46,575 INFO L226 Difference]: Without dead ends: 1060 [2025-03-03 16:19:46,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:19:46,577 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 411 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:46,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1146 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:19:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-03-03 16:19:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1026. [2025-03-03 16:19:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 882 states have (on average 1.3820861678004535) internal successors, (1219), 893 states have internal predecessors, (1219), 89 states have call successors, (89), 48 states have call predecessors, (89), 53 states have return successors, (116), 88 states have call predecessors, (116), 87 states have call successors, (116) [2025-03-03 16:19:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1424 transitions. [2025-03-03 16:19:46,652 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1424 transitions. Word has length 68 [2025-03-03 16:19:46,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:46,653 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1424 transitions. [2025-03-03 16:19:46,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1424 transitions. [2025-03-03 16:19:46,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:19:46,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:46,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:46,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:19:46,655 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:46,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:46,655 INFO L85 PathProgramCache]: Analyzing trace with hash -940446244, now seen corresponding path program 1 times [2025-03-03 16:19:46,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:46,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591613701] [2025-03-03 16:19:46,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:46,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:46,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:19:46,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:19:46,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:46,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:19:46,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:46,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591613701] [2025-03-03 16:19:46,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591613701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:46,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:46,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:19:46,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920271269] [2025-03-03 16:19:46,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:46,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:19:46,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:46,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:19:46,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:46,751 INFO L87 Difference]: Start difference. First operand 1026 states and 1424 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:47,159 INFO L93 Difference]: Finished difference Result 2189 states and 3110 transitions. [2025-03-03 16:19:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:19:47,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2025-03-03 16:19:47,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:47,166 INFO L225 Difference]: With dead ends: 2189 [2025-03-03 16:19:47,166 INFO L226 Difference]: Without dead ends: 1590 [2025-03-03 16:19:47,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:19:47,170 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 446 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:47,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1103 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:19:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2025-03-03 16:19:47,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1480. [2025-03-03 16:19:47,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1258 states have (on average 1.3934817170111289) internal successors, (1753), 1283 states have internal predecessors, (1753), 129 states have call successors, (129), 72 states have call predecessors, (129), 91 states have return successors, (204), 132 states have call predecessors, (204), 127 states have call successors, (204) [2025-03-03 16:19:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2086 transitions. [2025-03-03 16:19:47,253 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2086 transitions. Word has length 68 [2025-03-03 16:19:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:47,253 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 2086 transitions. [2025-03-03 16:19:47,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:47,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2086 transitions. [2025-03-03 16:19:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:19:47,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:47,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:47,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:19:47,255 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:47,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:47,255 INFO L85 PathProgramCache]: Analyzing trace with hash 192744349, now seen corresponding path program 1 times [2025-03-03 16:19:47,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:47,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219458289] [2025-03-03 16:19:47,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:47,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:47,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:19:47,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:19:47,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:47,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:19:47,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:47,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219458289] [2025-03-03 16:19:47,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219458289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:47,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:47,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:19:47,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536307317] [2025-03-03 16:19:47,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:47,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:19:47,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:47,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:19:47,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:47,317 INFO L87 Difference]: Start difference. First operand 1480 states and 2086 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:47,725 INFO L93 Difference]: Finished difference Result 3575 states and 5178 transitions. [2025-03-03 16:19:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:19:47,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2025-03-03 16:19:47,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:47,736 INFO L225 Difference]: With dead ends: 3575 [2025-03-03 16:19:47,736 INFO L226 Difference]: Without dead ends: 2522 [2025-03-03 16:19:47,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:19:47,740 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 412 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:47,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1095 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:19:47,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2025-03-03 16:19:47,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2427. [2025-03-03 16:19:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2035 states have (on average 1.398034398034398) internal successors, (2845), 2106 states have internal predecessors, (2845), 205 states have call successors, (205), 120 states have call predecessors, (205), 185 states have return successors, (472), 216 states have call predecessors, (472), 203 states have call successors, (472) [2025-03-03 16:19:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 3522 transitions. [2025-03-03 16:19:47,870 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 3522 transitions. Word has length 68 [2025-03-03 16:19:47,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:47,870 INFO L471 AbstractCegarLoop]: Abstraction has 2427 states and 3522 transitions. [2025-03-03 16:19:47,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:47,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 3522 transitions. [2025-03-03 16:19:47,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:19:47,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:47,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:47,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:19:47,874 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:47,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:47,875 INFO L85 PathProgramCache]: Analyzing trace with hash -47795780, now seen corresponding path program 1 times [2025-03-03 16:19:47,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:47,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043052853] [2025-03-03 16:19:47,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:47,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:47,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:19:47,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:19:47,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:47,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:19:47,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:47,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043052853] [2025-03-03 16:19:47,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043052853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:47,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:47,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:19:47,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131430771] [2025-03-03 16:19:47,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:47,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:19:47,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:47,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:19:47,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:19:47,919 INFO L87 Difference]: Start difference. First operand 2427 states and 3522 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:48,135 INFO L93 Difference]: Finished difference Result 5509 states and 8152 transitions. [2025-03-03 16:19:48,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:19:48,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2025-03-03 16:19:48,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:48,152 INFO L225 Difference]: With dead ends: 5509 [2025-03-03 16:19:48,153 INFO L226 Difference]: Without dead ends: 3510 [2025-03-03 16:19:48,159 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:19:48,160 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 412 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:48,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 807 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:19:48,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2025-03-03 16:19:48,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 3429. [2025-03-03 16:19:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3429 states, 2867 states have (on average 1.385071503313568) internal successors, (3971), 2967 states have internal predecessors, (3971), 301 states have call successors, (301), 174 states have call predecessors, (301), 259 states have return successors, (625), 303 states have call predecessors, (625), 299 states have call successors, (625) [2025-03-03 16:19:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 4897 transitions. [2025-03-03 16:19:48,358 INFO L78 Accepts]: Start accepts. Automaton has 3429 states and 4897 transitions. Word has length 68 [2025-03-03 16:19:48,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:48,359 INFO L471 AbstractCegarLoop]: Abstraction has 3429 states and 4897 transitions. [2025-03-03 16:19:48,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:19:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 4897 transitions. [2025-03-03 16:19:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:19:48,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:48,362 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:19:48,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:19:48,363 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:48,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:48,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1180939628, now seen corresponding path program 1 times [2025-03-03 16:19:48,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:48,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444678115] [2025-03-03 16:19:48,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:48,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:48,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:19:48,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:19:48,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:48,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:48,396 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 16:19:48,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:48,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444678115] [2025-03-03 16:19:48,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444678115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:48,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:48,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:19:48,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112348293] [2025-03-03 16:19:48,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:48,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:48,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:48,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:48,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:19:48,398 INFO L87 Difference]: Start difference. First operand 3429 states and 4897 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 16:19:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:48,490 INFO L93 Difference]: Finished difference Result 3903 states and 5519 transitions. [2025-03-03 16:19:48,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:48,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2025-03-03 16:19:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:48,506 INFO L225 Difference]: With dead ends: 3903 [2025-03-03 16:19:48,506 INFO L226 Difference]: Without dead ends: 3542 [2025-03-03 16:19:48,509 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:19:48,509 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 246 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:48,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 369 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:48,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3542 states. [2025-03-03 16:19:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3542 to 3542. [2025-03-03 16:19:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3542 states, 2968 states have (on average 1.378032345013477) internal successors, (4090), 3068 states have internal predecessors, (4090), 308 states have call successors, (308), 179 states have call predecessors, (308), 264 states have return successors, (635), 310 states have call predecessors, (635), 306 states have call successors, (635) [2025-03-03 16:19:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 5033 transitions. [2025-03-03 16:19:48,684 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 5033 transitions. Word has length 68 [2025-03-03 16:19:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:48,684 INFO L471 AbstractCegarLoop]: Abstraction has 3542 states and 5033 transitions. [2025-03-03 16:19:48,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 16:19:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 5033 transitions. [2025-03-03 16:19:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 16:19:48,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:48,687 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:19:48,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:19:48,687 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:48,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:48,687 INFO L85 PathProgramCache]: Analyzing trace with hash -38331188, now seen corresponding path program 1 times [2025-03-03 16:19:48,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:48,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003513787] [2025-03-03 16:19:48,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:48,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:48,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 16:19:48,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 16:19:48,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:48,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:48,727 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:19:48,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:48,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003513787] [2025-03-03 16:19:48,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003513787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:19:48,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981918981] [2025-03-03 16:19:48,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:48,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:48,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:19:48,729 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:19:48,731 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:19:48,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 16:19:48,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 16:19:48,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:48,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:48,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 16:19:48,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:19:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:19:48,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:19:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 16:19:48,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981918981] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:19:48,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:19:48,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-03-03 16:19:48,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41064188] [2025-03-03 16:19:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:48,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:19:48,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:48,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:19:48,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:19:48,922 INFO L87 Difference]: Start difference. First operand 3542 states and 5033 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 16:19:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:49,177 INFO L93 Difference]: Finished difference Result 3599 states and 5102 transitions. [2025-03-03 16:19:49,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:19:49,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 70 [2025-03-03 16:19:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:49,194 INFO L225 Difference]: With dead ends: 3599 [2025-03-03 16:19:49,194 INFO L226 Difference]: Without dead ends: 3596 [2025-03-03 16:19:49,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:19:49,196 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 491 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:49,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 377 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:19:49,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3596 states. [2025-03-03 16:19:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3596 to 3541. [2025-03-03 16:19:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3541 states, 2968 states have (on average 1.3773584905660377) internal successors, (4088), 3067 states have internal predecessors, (4088), 307 states have call successors, (307), 179 states have call predecessors, (307), 264 states have return successors, (635), 310 states have call predecessors, (635), 306 states have call successors, (635) [2025-03-03 16:19:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 5030 transitions. [2025-03-03 16:19:49,451 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 5030 transitions. Word has length 70 [2025-03-03 16:19:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:49,453 INFO L471 AbstractCegarLoop]: Abstraction has 3541 states and 5030 transitions. [2025-03-03 16:19:49,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 16:19:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 5030 transitions. [2025-03-03 16:19:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 16:19:49,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:49,457 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:19:49,466 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:19:49,661 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,SelfDestructingSolverStorable12 [2025-03-03 16:19:49,661 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:49,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:49,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1188540329, now seen corresponding path program 1 times [2025-03-03 16:19:49,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:49,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875537868] [2025-03-03 16:19:49,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:49,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:49,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 16:19:49,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 16:19:49,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:49,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:19:49,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:49,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875537868] [2025-03-03 16:19:49,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875537868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:19:49,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438121735] [2025-03-03 16:19:49,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:49,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:49,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:19:49,713 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:19:49,714 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:19:49,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 16:19:49,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 16:19:49,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:49,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:49,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 16:19:49,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:19:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:19:49,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:19:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 16:19:50,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438121735] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:19:50,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:19:50,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-03-03 16:19:50,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087032484] [2025-03-03 16:19:50,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:19:50,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:19:50,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:50,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:19:50,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:19:50,061 INFO L87 Difference]: Start difference. First operand 3541 states and 5030 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-03 16:19:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:50,445 INFO L93 Difference]: Finished difference Result 4769 states and 6650 transitions. [2025-03-03 16:19:50,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 16:19:50,446 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 71 [2025-03-03 16:19:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:50,464 INFO L225 Difference]: With dead ends: 4769 [2025-03-03 16:19:50,464 INFO L226 Difference]: Without dead ends: 4348 [2025-03-03 16:19:50,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:19:50,469 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 496 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:50,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 2275 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:19:50,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4348 states. [2025-03-03 16:19:50,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4348 to 3889. [2025-03-03 16:19:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3889 states, 3282 states have (on average 1.364411943936624) internal successors, (4478), 3385 states have internal predecessors, (4478), 326 states have call successors, (326), 192 states have call predecessors, (326), 279 states have return successors, (664), 327 states have call predecessors, (664), 325 states have call successors, (664) [2025-03-03 16:19:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3889 states to 3889 states and 5468 transitions. [2025-03-03 16:19:50,682 INFO L78 Accepts]: Start accepts. Automaton has 3889 states and 5468 transitions. Word has length 71 [2025-03-03 16:19:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:50,683 INFO L471 AbstractCegarLoop]: Abstraction has 3889 states and 5468 transitions. [2025-03-03 16:19:50,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-03 16:19:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3889 states and 5468 transitions. [2025-03-03 16:19:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:19:50,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:50,688 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 16:19:50,695 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:19:50,893 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,SelfDestructingSolverStorable13 [2025-03-03 16:19:50,893 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:50,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash -654795715, now seen corresponding path program 1 times [2025-03-03 16:19:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:50,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200062605] [2025-03-03 16:19:50,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:50,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:50,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:19:50,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:19:50,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:50,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-03 16:19:50,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:50,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200062605] [2025-03-03 16:19:50,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200062605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:19:50,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880579794] [2025-03-03 16:19:50,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:50,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:50,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:19:50,939 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:19:50,942 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:19:50,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:19:51,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:19:51,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:51,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:51,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 16:19:51,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:19:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 16:19:51,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:19:51,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880579794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:51,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:19:51,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:19:51,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890895669] [2025-03-03 16:19:51,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:51,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:51,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:51,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:51,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:51,037 INFO L87 Difference]: Start difference. First operand 3889 states and 5468 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 16:19:51,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:51,178 INFO L93 Difference]: Finished difference Result 4482 states and 6236 transitions. [2025-03-03 16:19:51,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:51,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 90 [2025-03-03 16:19:51,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:51,198 INFO L225 Difference]: With dead ends: 4482 [2025-03-03 16:19:51,198 INFO L226 Difference]: Without dead ends: 3785 [2025-03-03 16:19:51,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:51,201 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 245 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:51,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 392 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states. [2025-03-03 16:19:51,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3768. [2025-03-03 16:19:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3768 states, 3173 states have (on average 1.3662149385439648) internal successors, (4335), 3277 states have internal predecessors, (4335), 319 states have call successors, (319), 187 states have call predecessors, (319), 274 states have return successors, (654), 319 states have call predecessors, (654), 318 states have call successors, (654) [2025-03-03 16:19:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 5308 transitions. [2025-03-03 16:19:51,402 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 5308 transitions. Word has length 90 [2025-03-03 16:19:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:51,402 INFO L471 AbstractCegarLoop]: Abstraction has 3768 states and 5308 transitions. [2025-03-03 16:19:51,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 16:19:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 5308 transitions. [2025-03-03 16:19:51,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 16:19:51,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:51,411 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 16:19:51,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 16:19:51,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:51,615 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:51,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:51,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1735947303, now seen corresponding path program 1 times [2025-03-03 16:19:51,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:51,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805943269] [2025-03-03 16:19:51,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:51,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:51,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 16:19:51,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 16:19:51,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:51,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:19:51,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:51,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805943269] [2025-03-03 16:19:51,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805943269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:19:51,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154156632] [2025-03-03 16:19:51,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:51,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:51,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:19:51,672 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:19:51,674 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:19:51,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 16:19:51,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 16:19:51,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:51,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:51,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:19:51,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:19:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:19:51,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:19:51,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154156632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:51,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:19:51,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:19:51,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037143319] [2025-03-03 16:19:51,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:51,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:51,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:51,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:51,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:51,775 INFO L87 Difference]: Start difference. First operand 3768 states and 5308 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:19:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:51,962 INFO L93 Difference]: Finished difference Result 4086 states and 5702 transitions. [2025-03-03 16:19:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:51,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 105 [2025-03-03 16:19:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:51,980 INFO L225 Difference]: With dead ends: 4086 [2025-03-03 16:19:51,980 INFO L226 Difference]: Without dead ends: 3013 [2025-03-03 16:19:51,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:51,984 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 62 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:51,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 588 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2025-03-03 16:19:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 3013. [2025-03-03 16:19:52,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 2498 states have (on average 1.3967173738991192) internal successors, (3489), 2594 states have internal predecessors, (3489), 272 states have call successors, (272), 156 states have call predecessors, (272), 242 states have return successors, (585), 278 states have call predecessors, (585), 272 states have call successors, (585) [2025-03-03 16:19:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 4346 transitions. [2025-03-03 16:19:52,164 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 4346 transitions. Word has length 105 [2025-03-03 16:19:52,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:52,164 INFO L471 AbstractCegarLoop]: Abstraction has 3013 states and 4346 transitions. [2025-03-03 16:19:52,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 16:19:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 4346 transitions. [2025-03-03 16:19:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:19:52,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:52,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2025-03-03 16:19:52,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 16:19:52,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 16:19:52,372 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:52,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:52,372 INFO L85 PathProgramCache]: Analyzing trace with hash -923451970, now seen corresponding path program 1 times [2025-03-03 16:19:52,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:52,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113594438] [2025-03-03 16:19:52,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:52,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:52,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:19:52,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:19:52,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:52,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 16:19:52,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:52,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113594438] [2025-03-03 16:19:52,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113594438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:19:52,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843612168] [2025-03-03 16:19:52,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:52,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:52,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:19:52,432 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:19:52,434 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:19:52,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:19:52,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:19:52,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:52,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:52,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:19:52,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:19:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 16:19:52,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:19:52,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843612168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:52,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:19:52,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 16:19:52,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029195456] [2025-03-03 16:19:52,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:52,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:52,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:52,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:52,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:52,558 INFO L87 Difference]: Start difference. First operand 3013 states and 4346 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:19:52,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:52,791 INFO L93 Difference]: Finished difference Result 8872 states and 12874 transitions. [2025-03-03 16:19:52,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:52,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 112 [2025-03-03 16:19:52,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:52,813 INFO L225 Difference]: With dead ends: 8872 [2025-03-03 16:19:52,813 INFO L226 Difference]: Without dead ends: 5871 [2025-03-03 16:19:52,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:52,822 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 146 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:52,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 351 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5871 states. [2025-03-03 16:19:53,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5871 to 5791. [2025-03-03 16:19:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5791 states, 4800 states have (on average 1.3960416666666666) internal successors, (6701), 4991 states have internal predecessors, (6701), 510 states have call successors, (510), 308 states have call predecessors, (510), 480 states have return successors, (1121), 507 states have call predecessors, (1121), 510 states have call successors, (1121) [2025-03-03 16:19:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5791 states to 5791 states and 8332 transitions. [2025-03-03 16:19:53,101 INFO L78 Accepts]: Start accepts. Automaton has 5791 states and 8332 transitions. Word has length 112 [2025-03-03 16:19:53,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:53,101 INFO L471 AbstractCegarLoop]: Abstraction has 5791 states and 8332 transitions. [2025-03-03 16:19:53,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:19:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 5791 states and 8332 transitions. [2025-03-03 16:19:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:19:53,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:53,110 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2025-03-03 16:19:53,118 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:19:53,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 16:19:53,314 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:53,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:53,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1924974780, now seen corresponding path program 1 times [2025-03-03 16:19:53,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:53,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893023445] [2025-03-03 16:19:53,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:53,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:53,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:19:53,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:19:53,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:53,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:53,371 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 16:19:53,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:53,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893023445] [2025-03-03 16:19:53,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893023445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:19:53,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438254280] [2025-03-03 16:19:53,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:53,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:53,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:19:53,374 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:19:53,375 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:19:53,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:19:53,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:19:53,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:53,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:53,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:19:53,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:19:53,485 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 16:19:53,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:19:53,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438254280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:53,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:19:53,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 16:19:53,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836846645] [2025-03-03 16:19:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:53,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:53,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:53,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:53,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:53,487 INFO L87 Difference]: Start difference. First operand 5791 states and 8332 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:19:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:54,074 INFO L93 Difference]: Finished difference Result 17148 states and 24826 transitions. [2025-03-03 16:19:54,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:54,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 112 [2025-03-03 16:19:54,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:54,114 INFO L225 Difference]: With dead ends: 17148 [2025-03-03 16:19:54,115 INFO L226 Difference]: Without dead ends: 11369 [2025-03-03 16:19:54,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:54,134 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 152 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:54,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 351 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:54,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11369 states. [2025-03-03 16:19:54,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11369 to 11211. [2025-03-03 16:19:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11211 states, 9270 states have (on average 1.3929881337648329) internal successors, (12913), 9651 states have internal predecessors, (12913), 984 states have call successors, (984), 612 states have call predecessors, (984), 956 states have return successors, (2191), 963 states have call predecessors, (2191), 984 states have call successors, (2191) [2025-03-03 16:19:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11211 states to 11211 states and 16088 transitions. [2025-03-03 16:19:54,712 INFO L78 Accepts]: Start accepts. Automaton has 11211 states and 16088 transitions. Word has length 112 [2025-03-03 16:19:54,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:54,712 INFO L471 AbstractCegarLoop]: Abstraction has 11211 states and 16088 transitions. [2025-03-03 16:19:54,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:19:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 11211 states and 16088 transitions. [2025-03-03 16:19:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:19:54,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:54,726 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2025-03-03 16:19:54,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 16:19:54,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 16:19:54,932 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:54,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:54,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1007324086, now seen corresponding path program 1 times [2025-03-03 16:19:54,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:54,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519726358] [2025-03-03 16:19:54,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:54,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:54,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:19:54,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:19:54,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:54,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 16:19:54,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:54,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519726358] [2025-03-03 16:19:54,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519726358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:19:54,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366198076] [2025-03-03 16:19:54,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:54,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:54,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:19:54,990 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:19:54,992 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:19:55,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:19:55,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:19:55,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:55,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:55,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:19:55,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:19:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 16:19:55,079 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:19:55,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366198076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:55,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:19:55,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:19:55,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461179856] [2025-03-03 16:19:55,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:55,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:55,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:55,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:55,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:55,081 INFO L87 Difference]: Start difference. First operand 11211 states and 16088 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 16:19:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:55,850 INFO L93 Difference]: Finished difference Result 32893 states and 47860 transitions. [2025-03-03 16:19:55,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:55,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 112 [2025-03-03 16:19:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:55,931 INFO L225 Difference]: With dead ends: 32893 [2025-03-03 16:19:55,931 INFO L226 Difference]: Without dead ends: 21695 [2025-03-03 16:19:55,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:55,958 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 158 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:55,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 538 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21695 states. [2025-03-03 16:19:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21695 to 21695. [2025-03-03 16:19:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21695 states, 17939 states have (on average 1.3866993700875188) internal successors, (24876), 18665 states have internal predecessors, (24876), 1869 states have call successors, (1869), 1198 states have call predecessors, (1869), 1886 states have return successors, (4542), 1863 states have call predecessors, (4542), 1869 states have call successors, (4542) [2025-03-03 16:19:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21695 states to 21695 states and 31287 transitions. [2025-03-03 16:19:57,434 INFO L78 Accepts]: Start accepts. Automaton has 21695 states and 31287 transitions. Word has length 112 [2025-03-03 16:19:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:57,435 INFO L471 AbstractCegarLoop]: Abstraction has 21695 states and 31287 transitions. [2025-03-03 16:19:57,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 16:19:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 21695 states and 31287 transitions. [2025-03-03 16:19:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 16:19:57,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:57,497 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 16:19:57,504 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:19:57,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:57,704 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:57,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:57,704 INFO L85 PathProgramCache]: Analyzing trace with hash -453775880, now seen corresponding path program 1 times [2025-03-03 16:19:57,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:57,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163733581] [2025-03-03 16:19:57,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:57,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:57,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:19:57,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:19:57,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:57,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 16:19:57,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:57,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163733581] [2025-03-03 16:19:57,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163733581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:19:57,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022512648] [2025-03-03 16:19:57,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:57,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:19:57,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:19:57,776 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:19:57,778 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:19:57,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:19:57,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:19:57,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:57,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:57,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:19:57,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:19:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:19:57,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:19:57,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022512648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:57,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:19:57,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:19:57,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520250073] [2025-03-03 16:19:57,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:57,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:19:57,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:57,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:19:57,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:57,944 INFO L87 Difference]: Start difference. First operand 21695 states and 31287 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 16:19:58,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:58,851 INFO L93 Difference]: Finished difference Result 45809 states and 68631 transitions. [2025-03-03 16:19:58,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:19:58,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 164 [2025-03-03 16:19:58,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:58,950 INFO L225 Difference]: With dead ends: 45809 [2025-03-03 16:19:58,950 INFO L226 Difference]: Without dead ends: 24129 [2025-03-03 16:19:59,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:19:59,143 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 119 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:59,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 218 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:19:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24129 states. [2025-03-03 16:20:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24129 to 24129. [2025-03-03 16:20:00,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24129 states, 20161 states have (on average 1.3383264719011954) internal successors, (26982), 20887 states have internal predecessors, (26982), 1923 states have call successors, (1923), 1356 states have call predecessors, (1923), 2044 states have return successors, (4610), 1917 states have call predecessors, (4610), 1923 states have call successors, (4610) [2025-03-03 16:20:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24129 states to 24129 states and 33515 transitions. [2025-03-03 16:20:00,580 INFO L78 Accepts]: Start accepts. Automaton has 24129 states and 33515 transitions. Word has length 164 [2025-03-03 16:20:00,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:00,580 INFO L471 AbstractCegarLoop]: Abstraction has 24129 states and 33515 transitions. [2025-03-03 16:20:00,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 16:20:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 24129 states and 33515 transitions. [2025-03-03 16:20:00,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 16:20:00,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:00,625 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 16:20:00,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 16:20:00,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:00,827 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:00,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:00,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1337549113, now seen corresponding path program 1 times [2025-03-03 16:20:00,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:00,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329975326] [2025-03-03 16:20:00,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:00,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:00,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:20:00,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:20:00,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:00,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 16:20:00,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:00,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329975326] [2025-03-03 16:20:00,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329975326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:00,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167011306] [2025-03-03 16:20:00,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:00,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:00,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:00,923 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:20:00,925 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:20:00,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:20:01,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:20:01,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:01,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:01,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:20:01,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 16:20:01,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:01,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167011306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:01,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:01,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:01,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354290860] [2025-03-03 16:20:01,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:01,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:01,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:01,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:01,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:01,090 INFO L87 Difference]: Start difference. First operand 24129 states and 33515 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 16:20:02,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:02,455 INFO L93 Difference]: Finished difference Result 40233 states and 56440 transitions. [2025-03-03 16:20:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:02,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 164 [2025-03-03 16:20:02,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:02,525 INFO L225 Difference]: With dead ends: 40233 [2025-03-03 16:20:02,525 INFO L226 Difference]: Without dead ends: 20643 [2025-03-03 16:20:02,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:02,557 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 134 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:02,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 216 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:02,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20643 states. [2025-03-03 16:20:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20643 to 15011. [2025-03-03 16:20:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15011 states, 12743 states have (on average 1.296084124617437) internal successors, (16516), 12975 states have internal predecessors, (16516), 1183 states have call successors, (1183), 876 states have call predecessors, (1183), 1084 states have return successors, (1942), 1175 states have call predecessors, (1942), 1183 states have call successors, (1942) [2025-03-03 16:20:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15011 states to 15011 states and 19641 transitions. [2025-03-03 16:20:03,328 INFO L78 Accepts]: Start accepts. Automaton has 15011 states and 19641 transitions. Word has length 164 [2025-03-03 16:20:03,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:03,328 INFO L471 AbstractCegarLoop]: Abstraction has 15011 states and 19641 transitions. [2025-03-03 16:20:03,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 16:20:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 15011 states and 19641 transitions. [2025-03-03 16:20:03,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 16:20:03,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:03,344 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 16:20:03,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 16:20:03,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:03,549 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:03,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:03,549 INFO L85 PathProgramCache]: Analyzing trace with hash 751863800, now seen corresponding path program 1 times [2025-03-03 16:20:03,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:03,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652736374] [2025-03-03 16:20:03,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:03,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:03,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:20:03,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:20:03,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:03,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 16:20:03,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:03,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652736374] [2025-03-03 16:20:03,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652736374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:03,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322516944] [2025-03-03 16:20:03,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:03,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:03,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:03,613 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:20:03,614 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:20:03,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:20:03,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:20:03,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:03,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:03,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 16:20:03,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 16:20:03,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:03,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322516944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:03,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:03,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:03,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833988368] [2025-03-03 16:20:03,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:03,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:03,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:03,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:03,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:03,733 INFO L87 Difference]: Start difference. First operand 15011 states and 19641 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 16:20:04,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:04,319 INFO L93 Difference]: Finished difference Result 26359 states and 34394 transitions. [2025-03-03 16:20:04,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:04,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 164 [2025-03-03 16:20:04,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:04,362 INFO L225 Difference]: With dead ends: 26359 [2025-03-03 16:20:04,362 INFO L226 Difference]: Without dead ends: 15945 [2025-03-03 16:20:04,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:04,377 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 130 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:04,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 390 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:04,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15945 states. [2025-03-03 16:20:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15945 to 15835. [2025-03-03 16:20:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15835 states, 13523 states have (on average 1.2756045256230126) internal successors, (17250), 13755 states have internal predecessors, (17250), 1183 states have call successors, (1183), 920 states have call predecessors, (1183), 1128 states have return successors, (1986), 1175 states have call predecessors, (1986), 1183 states have call successors, (1986) [2025-03-03 16:20:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15835 states to 15835 states and 20419 transitions. [2025-03-03 16:20:04,987 INFO L78 Accepts]: Start accepts. Automaton has 15835 states and 20419 transitions. Word has length 164 [2025-03-03 16:20:04,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:04,987 INFO L471 AbstractCegarLoop]: Abstraction has 15835 states and 20419 transitions. [2025-03-03 16:20:04,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 16:20:04,987 INFO L276 IsEmpty]: Start isEmpty. Operand 15835 states and 20419 transitions. [2025-03-03 16:20:05,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 16:20:05,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:05,004 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 16:20:05,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 16:20:05,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 16:20:05,208 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:05,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:05,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1431542298, now seen corresponding path program 1 times [2025-03-03 16:20:05,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803906117] [2025-03-03 16:20:05,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:05,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:05,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 16:20:05,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 16:20:05,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:05,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 16:20:05,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:05,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803906117] [2025-03-03 16:20:05,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803906117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:05,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612682125] [2025-03-03 16:20:05,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:05,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:05,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:05,259 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:20:05,261 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:20:05,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 16:20:05,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 16:20:05,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:05,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:05,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:20:05,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 16:20:05,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:05,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612682125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:05,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:05,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:05,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551406348] [2025-03-03 16:20:05,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:05,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:05,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:05,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:05,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:05,366 INFO L87 Difference]: Start difference. First operand 15835 states and 20419 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 16:20:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:06,891 INFO L93 Difference]: Finished difference Result 45145 states and 58873 transitions. [2025-03-03 16:20:06,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:06,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 165 [2025-03-03 16:20:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:06,999 INFO L225 Difference]: With dead ends: 45145 [2025-03-03 16:20:06,999 INFO L226 Difference]: Without dead ends: 29329 [2025-03-03 16:20:07,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:07,035 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 141 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:07,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 515 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29329 states. [2025-03-03 16:20:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29329 to 29327. [2025-03-03 16:20:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29327 states, 24945 states have (on average 1.2666265784726398) internal successors, (31596), 25409 states have internal predecessors, (31596), 2245 states have call successors, (2245), 1720 states have call predecessors, (2245), 2136 states have return successors, (4298), 2229 states have call predecessors, (4298), 2245 states have call successors, (4298) [2025-03-03 16:20:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29327 states to 29327 states and 38139 transitions. [2025-03-03 16:20:08,922 INFO L78 Accepts]: Start accepts. Automaton has 29327 states and 38139 transitions. Word has length 165 [2025-03-03 16:20:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:08,922 INFO L471 AbstractCegarLoop]: Abstraction has 29327 states and 38139 transitions. [2025-03-03 16:20:08,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 16:20:08,923 INFO L276 IsEmpty]: Start isEmpty. Operand 29327 states and 38139 transitions. [2025-03-03 16:20:08,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 16:20:08,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:08,954 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 16:20:08,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 16:20:09,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 16:20:09,155 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:09,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:09,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1305717853, now seen corresponding path program 1 times [2025-03-03 16:20:09,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:09,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073129748] [2025-03-03 16:20:09,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:09,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:09,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 16:20:09,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 16:20:09,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:09,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:09,203 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 16:20:09,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:09,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073129748] [2025-03-03 16:20:09,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073129748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:09,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336790837] [2025-03-03 16:20:09,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:09,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:09,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:09,205 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:20:09,207 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:20:09,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 16:20:09,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 16:20:09,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:09,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:09,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:20:09,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 16:20:09,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:09,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336790837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:09,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:09,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:09,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445873391] [2025-03-03 16:20:09,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:09,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:09,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:09,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:09,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:09,332 INFO L87 Difference]: Start difference. First operand 29327 states and 38139 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 16:20:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:10,271 INFO L93 Difference]: Finished difference Result 50785 states and 67034 transitions. [2025-03-03 16:20:10,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:10,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 166 [2025-03-03 16:20:10,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:10,353 INFO L225 Difference]: With dead ends: 50785 [2025-03-03 16:20:10,353 INFO L226 Difference]: Without dead ends: 24405 [2025-03-03 16:20:10,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:10,407 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 140 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:10,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 217 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24405 states. [2025-03-03 16:20:11,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24405 to 22961. [2025-03-03 16:20:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22961 states, 19627 states have (on average 1.2309573546644927) internal successors, (24160), 19867 states have internal predecessors, (24160), 1777 states have call successors, (1777), 1364 states have call predecessors, (1777), 1556 states have return successors, (2834), 1745 states have call predecessors, (2834), 1777 states have call successors, (2834) [2025-03-03 16:20:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22961 states to 22961 states and 28771 transitions. [2025-03-03 16:20:11,391 INFO L78 Accepts]: Start accepts. Automaton has 22961 states and 28771 transitions. Word has length 166 [2025-03-03 16:20:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:11,391 INFO L471 AbstractCegarLoop]: Abstraction has 22961 states and 28771 transitions. [2025-03-03 16:20:11,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 16:20:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 22961 states and 28771 transitions. [2025-03-03 16:20:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 16:20:11,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:11,412 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 16:20:11,419 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:20:11,612 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,SelfDestructingSolverStorable23 [2025-03-03 16:20:11,613 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:11,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:11,613 INFO L85 PathProgramCache]: Analyzing trace with hash 847501761, now seen corresponding path program 1 times [2025-03-03 16:20:11,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:11,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083133980] [2025-03-03 16:20:11,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:11,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:11,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 16:20:11,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 16:20:11,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:11,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 16:20:11,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:11,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083133980] [2025-03-03 16:20:11,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083133980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:11,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901789053] [2025-03-03 16:20:11,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:11,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:11,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:11,662 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:20:11,663 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:20:11,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 16:20:11,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 16:20:11,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:11,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:11,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:20:11,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 16:20:11,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:11,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901789053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:11,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:11,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:11,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826653779] [2025-03-03 16:20:11,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:11,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:11,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:11,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:11,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:11,769 INFO L87 Difference]: Start difference. First operand 22961 states and 28771 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 16:20:13,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:13,284 INFO L93 Difference]: Finished difference Result 65403 states and 82859 transitions. [2025-03-03 16:20:13,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:13,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 166 [2025-03-03 16:20:13,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:13,416 INFO L225 Difference]: With dead ends: 65403 [2025-03-03 16:20:13,416 INFO L226 Difference]: Without dead ends: 42469 [2025-03-03 16:20:13,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:13,468 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 147 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:13,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 510 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42469 states. [2025-03-03 16:20:15,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42469 to 42467. [2025-03-03 16:20:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42467 states, 36153 states have (on average 1.2184880922745) internal successors, (44052), 36633 states have internal predecessors, (44052), 3377 states have call successors, (3377), 2552 states have call predecessors, (3377), 2936 states have return successors, (6168), 3313 states have call predecessors, (6168), 3377 states have call successors, (6168) [2025-03-03 16:20:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42467 states to 42467 states and 53597 transitions. [2025-03-03 16:20:15,427 INFO L78 Accepts]: Start accepts. Automaton has 42467 states and 53597 transitions. Word has length 166 [2025-03-03 16:20:15,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:15,427 INFO L471 AbstractCegarLoop]: Abstraction has 42467 states and 53597 transitions. [2025-03-03 16:20:15,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 16:20:15,428 INFO L276 IsEmpty]: Start isEmpty. Operand 42467 states and 53597 transitions. [2025-03-03 16:20:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 16:20:15,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:15,461 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 16:20:15,467 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:20:15,665 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,SelfDestructingSolverStorable24 [2025-03-03 16:20:15,665 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:15,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:15,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1134250223, now seen corresponding path program 1 times [2025-03-03 16:20:15,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:15,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14091836] [2025-03-03 16:20:15,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:15,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:15,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 16:20:15,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 16:20:15,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:15,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 16:20:15,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:15,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14091836] [2025-03-03 16:20:15,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14091836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:15,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109491397] [2025-03-03 16:20:15,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:15,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:15,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:15,715 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:20:15,717 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:20:15,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 16:20:15,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 16:20:15,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:15,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:15,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 16:20:15,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:15,845 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 16:20:15,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:15,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109491397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:15,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:15,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:15,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517695003] [2025-03-03 16:20:15,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:15,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:15,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:15,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:15,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:15,848 INFO L87 Difference]: Start difference. First operand 42467 states and 53597 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 16:20:17,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:17,524 INFO L93 Difference]: Finished difference Result 75911 states and 96061 transitions. [2025-03-03 16:20:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:17,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 166 [2025-03-03 16:20:17,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:17,658 INFO L225 Difference]: With dead ends: 75911 [2025-03-03 16:20:17,658 INFO L226 Difference]: Without dead ends: 43565 [2025-03-03 16:20:17,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:17,713 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 135 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:17,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 370 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43565 states. [2025-03-03 16:20:19,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43565 to 42375. [2025-03-03 16:20:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42375 states, 36061 states have (on average 1.2101161920079864) internal successors, (43638), 36541 states have internal predecessors, (43638), 3377 states have call successors, (3377), 2552 states have call predecessors, (3377), 2936 states have return successors, (6168), 3313 states have call predecessors, (6168), 3377 states have call successors, (6168) [2025-03-03 16:20:19,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42375 states to 42375 states and 53183 transitions. [2025-03-03 16:20:19,919 INFO L78 Accepts]: Start accepts. Automaton has 42375 states and 53183 transitions. Word has length 166 [2025-03-03 16:20:19,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:19,919 INFO L471 AbstractCegarLoop]: Abstraction has 42375 states and 53183 transitions. [2025-03-03 16:20:19,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 16:20:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 42375 states and 53183 transitions. [2025-03-03 16:20:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 16:20:19,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:19,953 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 16:20:19,960 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:20:20,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:20,153 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:20,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1340184306, now seen corresponding path program 1 times [2025-03-03 16:20:20,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:20,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339431730] [2025-03-03 16:20:20,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:20,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:20,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 16:20:20,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 16:20:20,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:20,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 16:20:20,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:20,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339431730] [2025-03-03 16:20:20,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339431730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:20,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:20,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:20,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358909406] [2025-03-03 16:20:20,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:20,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:20,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:20,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:20,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:20,178 INFO L87 Difference]: Start difference. First operand 42375 states and 53183 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:20:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:22,330 INFO L93 Difference]: Finished difference Result 74633 states and 93530 transitions. [2025-03-03 16:20:22,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:22,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 166 [2025-03-03 16:20:22,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:22,431 INFO L225 Difference]: With dead ends: 74633 [2025-03-03 16:20:22,431 INFO L226 Difference]: Without dead ends: 32281 [2025-03-03 16:20:22,477 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:20:22,477 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 174 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:22,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 181 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:22,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32281 states. [2025-03-03 16:20:24,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32281 to 32281. [2025-03-03 16:20:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32281 states, 27531 states have (on average 1.2147760706113109) internal successors, (33444), 27887 states have internal predecessors, (33444), 2533 states have call successors, (2533), 1928 states have call predecessors, (2533), 2216 states have return successors, (4410), 2481 states have call predecessors, (4410), 2533 states have call successors, (4410) [2025-03-03 16:20:24,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32281 states to 32281 states and 40387 transitions. [2025-03-03 16:20:24,410 INFO L78 Accepts]: Start accepts. Automaton has 32281 states and 40387 transitions. Word has length 166 [2025-03-03 16:20:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:24,410 INFO L471 AbstractCegarLoop]: Abstraction has 32281 states and 40387 transitions. [2025-03-03 16:20:24,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:20:24,410 INFO L276 IsEmpty]: Start isEmpty. Operand 32281 states and 40387 transitions. [2025-03-03 16:20:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:20:24,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:24,436 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 16:20:24,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 16:20:24,436 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:24,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:24,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2108339892, now seen corresponding path program 1 times [2025-03-03 16:20:24,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:24,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048680148] [2025-03-03 16:20:24,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:24,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:24,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:20:24,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:20:24,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:24,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:24,480 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-03 16:20:24,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:24,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048680148] [2025-03-03 16:20:24,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048680148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:24,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357135002] [2025-03-03 16:20:24,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:24,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:24,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:24,483 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:20:24,484 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:20:24,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:20:24,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:20:24,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:24,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:24,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 16:20:24,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 16:20:24,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:24,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357135002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:24,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:24,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:24,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512910284] [2025-03-03 16:20:24,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:24,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:24,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:24,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:24,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:24,609 INFO L87 Difference]: Start difference. First operand 32281 states and 40387 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 16:20:25,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:25,965 INFO L93 Difference]: Finished difference Result 57710 states and 72232 transitions. [2025-03-03 16:20:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:25,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 167 [2025-03-03 16:20:25,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:26,077 INFO L225 Difference]: With dead ends: 57710 [2025-03-03 16:20:26,077 INFO L226 Difference]: Without dead ends: 32759 [2025-03-03 16:20:26,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:26,117 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 133 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:26,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 357 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:26,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32759 states. [2025-03-03 16:20:27,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32759 to 32281. [2025-03-03 16:20:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32281 states, 27531 states have (on average 1.2090370854672914) internal successors, (33286), 27887 states have internal predecessors, (33286), 2533 states have call successors, (2533), 1928 states have call predecessors, (2533), 2216 states have return successors, (4410), 2481 states have call predecessors, (4410), 2533 states have call successors, (4410) [2025-03-03 16:20:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32281 states to 32281 states and 40229 transitions. [2025-03-03 16:20:27,820 INFO L78 Accepts]: Start accepts. Automaton has 32281 states and 40229 transitions. Word has length 167 [2025-03-03 16:20:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:27,820 INFO L471 AbstractCegarLoop]: Abstraction has 32281 states and 40229 transitions. [2025-03-03 16:20:27,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 16:20:27,821 INFO L276 IsEmpty]: Start isEmpty. Operand 32281 states and 40229 transitions. [2025-03-03 16:20:27,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 16:20:27,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:27,850 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 16:20:27,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-03 16:20:28,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-03 16:20:28,051 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:28,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:28,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1916941940, now seen corresponding path program 1 times [2025-03-03 16:20:28,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:28,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021086061] [2025-03-03 16:20:28,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:28,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:28,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 16:20:28,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 16:20:28,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:28,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:28,083 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 16:20:28,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:28,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021086061] [2025-03-03 16:20:28,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021086061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:28,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:28,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:28,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121679433] [2025-03-03 16:20:28,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:28,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:28,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:28,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:28,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:28,086 INFO L87 Difference]: Start difference. First operand 32281 states and 40229 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)