./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product20.cil.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/product-lines/elevator_spec2_product20.cil.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 e1240a0d3e559b8971965b03cecb352351a22be921567ab044722f9bb2872bc1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:15:55,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:15:55,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:15:55,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:15:55,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:15:55,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:15:55,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:15:55,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:15:55,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:15:55,250 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:15:55,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:15:55,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:15:55,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:15:55,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:15:55,251 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:15:55,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:15:55,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:15:55,252 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:15:55,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:15:55,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:15:55,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:15:55,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:15:55,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:15:55,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:15:55,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:15:55,252 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 -> e1240a0d3e559b8971965b03cecb352351a22be921567ab044722f9bb2872bc1 [2025-03-03 14:15:55,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:15:55,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:15:55,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:15:55,519 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:15:55,519 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:15:55,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product20.cil.c [2025-03-03 14:15:56,600 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec3519d32/3b84eab0f18e4b26888146623296e8b9/FLAGbf1b8fecd [2025-03-03 14:15:56,908 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:15:56,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product20.cil.c [2025-03-03 14:15:56,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec3519d32/3b84eab0f18e4b26888146623296e8b9/FLAGbf1b8fecd [2025-03-03 14:15:56,940 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec3519d32/3b84eab0f18e4b26888146623296e8b9 [2025-03-03 14:15:56,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:15:56,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:15:56,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:15:56,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:15:56,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:15:56,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:15:56" (1/1) ... [2025-03-03 14:15:56,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1910944d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:56, skipping insertion in model container [2025-03-03 14:15:56,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:15:56" (1/1) ... [2025-03-03 14:15:56,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:15:57,287 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/product-lines/elevator_spec2_product20.cil.c[38445,38458] [2025-03-03 14:15:57,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:15:57,410 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:15:57,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [48] [2025-03-03 14:15:57,417 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [236] [2025-03-03 14:15:57,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1824] [2025-03-03 14:15:57,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1833] [2025-03-03 14:15:57,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2199] [2025-03-03 14:15:57,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2861] [2025-03-03 14:15:57,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2875] [2025-03-03 14:15:57,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2913] [2025-03-03 14:15:57,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3006] [2025-03-03 14:15:57,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3356] [2025-03-03 14:15:57,459 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/product-lines/elevator_spec2_product20.cil.c[38445,38458] [2025-03-03 14:15:57,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:15:57,525 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:15:57,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:57 WrapperNode [2025-03-03 14:15:57,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:15:57,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:15:57,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:15:57,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:15:57,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:57" (1/1) ... [2025-03-03 14:15:57,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:57" (1/1) ... [2025-03-03 14:15:57,588 INFO L138 Inliner]: procedures = 96, calls = 346, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 1130 [2025-03-03 14:15:57,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:15:57,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:15:57,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:15:57,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:15:57,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:57" (1/1) ... [2025-03-03 14:15:57,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:57" (1/1) ... [2025-03-03 14:15:57,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:57" (1/1) ... [2025-03-03 14:15:57,628 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-03 14:15:57,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:57" (1/1) ... [2025-03-03 14:15:57,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:57" (1/1) ... [2025-03-03 14:15:57,644 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:57" (1/1) ... [2025-03-03 14:15:57,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:57" (1/1) ... [2025-03-03 14:15:57,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:57" (1/1) ... [2025-03-03 14:15:57,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:57" (1/1) ... [2025-03-03 14:15:57,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:15:57,670 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:15:57,670 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:15:57,670 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:15:57,674 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:57" (1/1) ... [2025-03-03 14:15:57,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:15:57,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:15:57,702 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 14:15:57,705 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 14:15:57,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:15:57,726 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:15:57,726 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:15:57,726 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:15:57,726 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:15:57,726 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2025-03-03 14:15:57,726 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2025-03-03 14:15:57,726 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:15:57,726 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:15:57,726 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-03 14:15:57,727 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-03 14:15:57,727 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:15:57,727 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:15:57,727 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:15:57,727 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:15:57,727 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:15:57,727 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:15:57,728 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:15:57,728 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:15:57,728 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-03 14:15:57,728 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-03 14:15:57,728 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:15:57,728 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:15:57,729 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:15:57,729 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:15:57,729 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:15:57,729 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:15:57,729 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:15:57,729 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:15:57,729 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-03 14:15:57,729 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-03 14:15:57,729 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:15:57,729 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:15:57,729 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:15:57,729 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:15:57,730 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:15:57,730 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:15:57,730 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:15:57,730 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:15:57,730 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:15:57,731 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:15:57,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:15:57,732 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:15:57,732 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:15:57,732 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:15:57,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:15:57,732 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:15:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2025-03-03 14:15:57,732 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2025-03-03 14:15:57,904 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:15:57,906 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:15:57,958 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3471: #res := ~retValue_acc~29; [2025-03-03 14:15:57,983 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3393: #res := ~retValue_acc~27; [2025-03-03 14:15:57,986 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L324: #res := ~retValue_acc~0; [2025-03-03 14:15:58,000 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L481: #res := ~retValue_acc~1; [2025-03-03 14:15:58,049 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1137: #res#1 := ~retValue_acc~11#1; [2025-03-03 14:15:58,050 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L524-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~3#1; [2025-03-03 14:15:58,081 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812: #res := ~retValue_acc~15; [2025-03-03 14:15:58,356 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018-1: stopRequestedInDirection__wrappee__weight_#res#1 := stopRequestedInDirection__wrappee__weight_~retValue_acc~8#1; [2025-03-03 14:15:58,357 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047: #res#1 := ~retValue_acc~9#1; [2025-03-03 14:15:58,401 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1182: #res := ~retValue_acc~13; [2025-03-03 14:15:58,411 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3432: #res := ~retValue_acc~28; [2025-03-03 14:15:58,498 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L653-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~6#1; [2025-03-03 14:15:58,498 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L666-1: isIdle_#res#1 := isIdle_~retValue_acc~7#1; [2025-03-03 14:15:58,594 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2547: #res := ~retValue_acc~21; [2025-03-03 14:15:58,650 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3353-1: main_#res#1 := main_~retValue_acc~26#1; [2025-03-03 14:15:58,650 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2910-1: valid_product_#res#1 := valid_product_~retValue_acc~24#1; [2025-03-03 14:15:58,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2311: #res := ~retValue_acc~20; [2025-03-03 14:15:58,660 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L490: #res := ~retValue_acc~2; [2025-03-03 14:15:58,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2858: #res := ~retValue_acc~22; [2025-03-03 14:15:58,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1168-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~12#1; [2025-03-03 14:15:58,862 INFO L? ?]: Removed 451 outVars from TransFormulas that were not future-live. [2025-03-03 14:15:58,862 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:15:58,879 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:15:58,879 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:15:58,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:15:58 BoogieIcfgContainer [2025-03-03 14:15:58,880 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:15:58,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:15:58,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:15:58,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:15:58,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:15:56" (1/3) ... [2025-03-03 14:15:58,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584b0276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:15:58, skipping insertion in model container [2025-03-03 14:15:58,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:57" (2/3) ... [2025-03-03 14:15:58,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584b0276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:15:58, skipping insertion in model container [2025-03-03 14:15:58,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:15:58" (3/3) ... [2025-03-03 14:15:58,888 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product20.cil.c [2025-03-03 14:15:58,898 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:15:58,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product20.cil.c that has 26 procedures, 568 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:15:58,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:15:58,955 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;@41f90e83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:15:58,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:15:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 568 states, 442 states have (on average 1.6855203619909502) internal successors, (745), 465 states have internal predecessors, (745), 99 states have call successors, (99), 25 states have call predecessors, (99), 25 states have return successors, (99), 92 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 14:15:58,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 14:15:58,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:58,970 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] [2025-03-03 14:15:58,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:58,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:58,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1527415143, now seen corresponding path program 1 times [2025-03-03 14:15:58,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:58,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709782709] [2025-03-03 14:15:58,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:58,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:59,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 14:15:59,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 14:15:59,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:59,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:59,392 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 14:15:59,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:59,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709782709] [2025-03-03 14:15:59,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709782709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:59,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:59,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:59,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224316765] [2025-03-03 14:15:59,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:59,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:59,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:59,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:59,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:59,411 INFO L87 Difference]: Start difference. First operand has 568 states, 442 states have (on average 1.6855203619909502) internal successors, (745), 465 states have internal predecessors, (745), 99 states have call successors, (99), 25 states have call predecessors, (99), 25 states have return successors, (99), 92 states have call predecessors, (99), 99 states have call successors, (99) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:15:59,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:59,543 INFO L93 Difference]: Finished difference Result 1116 states and 1861 transitions. [2025-03-03 14:15:59,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:59,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2025-03-03 14:15:59,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:59,559 INFO L225 Difference]: With dead ends: 1116 [2025-03-03 14:15:59,559 INFO L226 Difference]: Without dead ends: 560 [2025-03-03 14:15:59,567 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 14:15:59,569 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 5 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:59,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2765 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:59,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-03 14:15:59,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-03-03 14:15:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 436 states have (on average 1.68348623853211) internal successors, (734), 457 states have internal predecessors, (734), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 14:15:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 927 transitions. [2025-03-03 14:15:59,629 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 927 transitions. Word has length 60 [2025-03-03 14:15:59,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:59,629 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 927 transitions. [2025-03-03 14:15:59,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:15:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 927 transitions. [2025-03-03 14:15:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 14:15:59,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:59,632 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] [2025-03-03 14:15:59,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:15:59,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:59,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:59,634 INFO L85 PathProgramCache]: Analyzing trace with hash 311501476, now seen corresponding path program 1 times [2025-03-03 14:15:59,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:59,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951407264] [2025-03-03 14:15:59,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:59,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:59,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:15:59,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:15:59,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:59,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:59,792 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 14:15:59,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:59,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951407264] [2025-03-03 14:15:59,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951407264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:59,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:59,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:59,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44443504] [2025-03-03 14:15:59,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:59,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:59,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:59,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:59,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:59,794 INFO L87 Difference]: Start difference. First operand 560 states and 927 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:15:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:59,860 INFO L93 Difference]: Finished difference Result 1102 states and 1831 transitions. [2025-03-03 14:15:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:59,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-03-03 14:15:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:59,868 INFO L225 Difference]: With dead ends: 1102 [2025-03-03 14:15:59,868 INFO L226 Difference]: Without dead ends: 560 [2025-03-03 14:15:59,871 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 14:15:59,871 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 4 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:59,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2744 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-03 14:15:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-03-03 14:15:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 436 states have (on average 1.6811926605504588) internal successors, (733), 457 states have internal predecessors, (733), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 14:15:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 926 transitions. [2025-03-03 14:15:59,900 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 926 transitions. Word has length 63 [2025-03-03 14:15:59,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:59,901 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 926 transitions. [2025-03-03 14:15:59,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:15:59,901 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 926 transitions. [2025-03-03 14:15:59,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:15:59,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:59,904 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] [2025-03-03 14:15:59,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:15:59,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:59,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:59,906 INFO L85 PathProgramCache]: Analyzing trace with hash 703678963, now seen corresponding path program 1 times [2025-03-03 14:15:59,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:59,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812701963] [2025-03-03 14:15:59,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:59,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:59,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:15:59,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:15:59,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:59,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:00,048 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 14:16:00,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812701963] [2025-03-03 14:16:00,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812701963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:00,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:00,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795085763] [2025-03-03 14:16:00,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:00,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:00,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:00,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:00,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:00,050 INFO L87 Difference]: Start difference. First operand 560 states and 926 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:00,112 INFO L93 Difference]: Finished difference Result 1102 states and 1830 transitions. [2025-03-03 14:16:00,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:00,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-03-03 14:16:00,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:00,118 INFO L225 Difference]: With dead ends: 1102 [2025-03-03 14:16:00,118 INFO L226 Difference]: Without dead ends: 560 [2025-03-03 14:16:00,120 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 14:16:00,122 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 3 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:00,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2744 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-03 14:16:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-03-03 14:16:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 436 states have (on average 1.6788990825688073) internal successors, (732), 457 states have internal predecessors, (732), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 14:16:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 925 transitions. [2025-03-03 14:16:00,143 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 925 transitions. Word has length 64 [2025-03-03 14:16:00,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:00,144 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 925 transitions. [2025-03-03 14:16:00,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 925 transitions. [2025-03-03 14:16:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 14:16:00,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:00,146 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] [2025-03-03 14:16:00,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:16:00,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:00,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:00,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1764325153, now seen corresponding path program 1 times [2025-03-03 14:16:00,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:00,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884899441] [2025-03-03 14:16:00,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:00,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:00,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 14:16:00,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 14:16:00,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:00,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:00,262 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 14:16:00,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:00,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884899441] [2025-03-03 14:16:00,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884899441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:00,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:00,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:00,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175352468] [2025-03-03 14:16:00,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:00,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:00,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:00,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:00,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:00,266 INFO L87 Difference]: Start difference. First operand 560 states and 925 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:00,311 INFO L93 Difference]: Finished difference Result 1102 states and 1829 transitions. [2025-03-03 14:16:00,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:00,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-03-03 14:16:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:00,315 INFO L225 Difference]: With dead ends: 1102 [2025-03-03 14:16:00,316 INFO L226 Difference]: Without dead ends: 560 [2025-03-03 14:16:00,318 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 14:16:00,319 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 2 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:00,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2744 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-03 14:16:00,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-03-03 14:16:00,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 436 states have (on average 1.676605504587156) internal successors, (731), 457 states have internal predecessors, (731), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 14:16:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 924 transitions. [2025-03-03 14:16:00,344 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 924 transitions. Word has length 65 [2025-03-03 14:16:00,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:00,345 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 924 transitions. [2025-03-03 14:16:00,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:00,346 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 924 transitions. [2025-03-03 14:16:00,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:16:00,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:00,347 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] [2025-03-03 14:16:00,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:16:00,347 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:00,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:00,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2072664656, now seen corresponding path program 1 times [2025-03-03 14:16:00,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:00,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490777310] [2025-03-03 14:16:00,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:00,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:00,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:16:00,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:16:00,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:00,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:00,457 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 14:16:00,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:00,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490777310] [2025-03-03 14:16:00,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490777310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:00,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:00,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:00,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176836847] [2025-03-03 14:16:00,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:00,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:00,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:00,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:00,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:00,459 INFO L87 Difference]: Start difference. First operand 560 states and 924 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:00,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:00,497 INFO L93 Difference]: Finished difference Result 1102 states and 1828 transitions. [2025-03-03 14:16:00,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:00,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-03-03 14:16:00,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:00,503 INFO L225 Difference]: With dead ends: 1102 [2025-03-03 14:16:00,503 INFO L226 Difference]: Without dead ends: 560 [2025-03-03 14:16:00,505 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 14:16:00,506 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 1 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:00,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2744 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:00,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-03 14:16:00,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-03-03 14:16:00,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 436 states have (on average 1.6743119266055047) internal successors, (730), 457 states have internal predecessors, (730), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 14:16:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 923 transitions. [2025-03-03 14:16:00,535 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 923 transitions. Word has length 66 [2025-03-03 14:16:00,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:00,535 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 923 transitions. [2025-03-03 14:16:00,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 923 transitions. [2025-03-03 14:16:00,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:16:00,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:00,537 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] [2025-03-03 14:16:00,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:16:00,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:00,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:00,538 INFO L85 PathProgramCache]: Analyzing trace with hash 534333342, now seen corresponding path program 1 times [2025-03-03 14:16:00,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:00,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072236380] [2025-03-03 14:16:00,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:00,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:00,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:16:00,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:16:00,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:00,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:00,756 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 14:16:00,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:00,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072236380] [2025-03-03 14:16:00,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072236380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:00,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:00,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:16:00,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3211717] [2025-03-03 14:16:00,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:00,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:16:00,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:00,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:16:00,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:00,759 INFO L87 Difference]: Start difference. First operand 560 states and 923 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:00,859 INFO L93 Difference]: Finished difference Result 1068 states and 1760 transitions. [2025-03-03 14:16:00,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:16:00,860 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2025-03-03 14:16:00,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:00,864 INFO L225 Difference]: With dead ends: 1068 [2025-03-03 14:16:00,864 INFO L226 Difference]: Without dead ends: 575 [2025-03-03 14:16:00,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:16:00,867 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 91 mSDsluCounter, 6294 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7205 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:00,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7205 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-03 14:16:00,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 573. [2025-03-03 14:16:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 446 states have (on average 1.6704035874439462) internal successors, (745), 469 states have internal predecessors, (745), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2025-03-03 14:16:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 942 transitions. [2025-03-03 14:16:00,887 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 942 transitions. Word has length 67 [2025-03-03 14:16:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:00,887 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 942 transitions. [2025-03-03 14:16:00,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 942 transitions. [2025-03-03 14:16:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:16:00,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:00,889 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] [2025-03-03 14:16:00,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:16:00,889 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:00,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:00,889 INFO L85 PathProgramCache]: Analyzing trace with hash 293793213, now seen corresponding path program 1 times [2025-03-03 14:16:00,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:00,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662406319] [2025-03-03 14:16:00,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:00,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:00,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:16:00,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:16:00,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:00,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:00,963 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 14:16:00,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:00,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662406319] [2025-03-03 14:16:00,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662406319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:00,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:00,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:00,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339226850] [2025-03-03 14:16:00,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:00,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:00,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:00,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:00,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:00,964 INFO L87 Difference]: Start difference. First operand 573 states and 942 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:01,002 INFO L93 Difference]: Finished difference Result 1120 states and 1854 transitions. [2025-03-03 14:16:01,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:01,003 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), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-03-03 14:16:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:01,006 INFO L225 Difference]: With dead ends: 1120 [2025-03-03 14:16:01,006 INFO L226 Difference]: Without dead ends: 554 [2025-03-03 14:16:01,008 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 14:16:01,009 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 0 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2746 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:01,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2746 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-03 14:16:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-03-03 14:16:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 430 states have (on average 1.6651162790697673) internal successors, (716), 451 states have internal predecessors, (716), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 14:16:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 909 transitions. [2025-03-03 14:16:01,028 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 909 transitions. Word has length 67 [2025-03-03 14:16:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:01,028 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 909 transitions. [2025-03-03 14:16:01,029 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), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 909 transitions. [2025-03-03 14:16:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:16:01,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:01,031 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 14:16:01,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:16:01,031 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:01,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:01,031 INFO L85 PathProgramCache]: Analyzing trace with hash -175692144, now seen corresponding path program 1 times [2025-03-03 14:16:01,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:01,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398577685] [2025-03-03 14:16:01,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:01,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:01,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:16:01,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:16:01,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:01,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:01,144 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 14:16:01,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:01,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398577685] [2025-03-03 14:16:01,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398577685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:01,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:01,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:01,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236260853] [2025-03-03 14:16:01,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:01,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:01,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:01,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:01,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:01,145 INFO L87 Difference]: Start difference. First operand 554 states and 909 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:01,299 INFO L93 Difference]: Finished difference Result 1065 states and 1752 transitions. [2025-03-03 14:16:01,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:01,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2025-03-03 14:16:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:01,303 INFO L225 Difference]: With dead ends: 1065 [2025-03-03 14:16:01,303 INFO L226 Difference]: Without dead ends: 563 [2025-03-03 14:16:01,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:01,306 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 55 mSDsluCounter, 3435 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4301 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:01,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4301 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-03 14:16:01,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 554. [2025-03-03 14:16:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 430 states have (on average 1.655813953488372) internal successors, (712), 451 states have internal predecessors, (712), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 14:16:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 905 transitions. [2025-03-03 14:16:01,323 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 905 transitions. Word has length 68 [2025-03-03 14:16:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:01,323 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 905 transitions. [2025-03-03 14:16:01,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 905 transitions. [2025-03-03 14:16:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:16:01,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:01,325 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, 1] [2025-03-03 14:16:01,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:16:01,325 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:01,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:01,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1063988917, now seen corresponding path program 1 times [2025-03-03 14:16:01,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:01,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621109801] [2025-03-03 14:16:01,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:01,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:01,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:16:01,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:16:01,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:01,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:01,456 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 14:16:01,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:01,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621109801] [2025-03-03 14:16:01,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621109801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:01,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:01,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:01,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886548551] [2025-03-03 14:16:01,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:01,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:01,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:01,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:01,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:01,458 INFO L87 Difference]: Start difference. First operand 554 states and 905 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:01,595 INFO L93 Difference]: Finished difference Result 1065 states and 1748 transitions. [2025-03-03 14:16:01,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:01,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2025-03-03 14:16:01,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:01,601 INFO L225 Difference]: With dead ends: 1065 [2025-03-03 14:16:01,601 INFO L226 Difference]: Without dead ends: 563 [2025-03-03 14:16:01,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:01,607 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 54 mSDsluCounter, 3435 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4301 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:01,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4301 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:01,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-03 14:16:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 554. [2025-03-03 14:16:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 430 states have (on average 1.6465116279069767) internal successors, (708), 451 states have internal predecessors, (708), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 14:16:01,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 901 transitions. [2025-03-03 14:16:01,624 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 901 transitions. Word has length 69 [2025-03-03 14:16:01,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:01,625 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 901 transitions. [2025-03-03 14:16:01,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 901 transitions. [2025-03-03 14:16:01,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:16:01,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:01,626 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, 1, 1] [2025-03-03 14:16:01,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:16:01,627 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:01,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:01,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1854879949, now seen corresponding path program 1 times [2025-03-03 14:16:01,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:01,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421823323] [2025-03-03 14:16:01,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:01,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:01,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:16:01,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:16:01,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:01,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:01,728 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 14:16:01,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:01,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421823323] [2025-03-03 14:16:01,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421823323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:01,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:01,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:01,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010549578] [2025-03-03 14:16:01,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:01,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:01,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:01,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:01,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:01,729 INFO L87 Difference]: Start difference. First operand 554 states and 901 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:01,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:01,858 INFO L93 Difference]: Finished difference Result 1065 states and 1744 transitions. [2025-03-03 14:16:01,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:01,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-03 14:16:01,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:01,862 INFO L225 Difference]: With dead ends: 1065 [2025-03-03 14:16:01,862 INFO L226 Difference]: Without dead ends: 563 [2025-03-03 14:16:01,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:01,864 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 53 mSDsluCounter, 3418 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4283 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:01,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4283 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-03 14:16:01,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 554. [2025-03-03 14:16:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 430 states have (on average 1.6372093023255814) internal successors, (704), 451 states have internal predecessors, (704), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 14:16:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 897 transitions. [2025-03-03 14:16:01,881 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 897 transitions. Word has length 70 [2025-03-03 14:16:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:01,881 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 897 transitions. [2025-03-03 14:16:01,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 897 transitions. [2025-03-03 14:16:01,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:16:01,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:01,882 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, 1, 1] [2025-03-03 14:16:01,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:16:01,882 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:01,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:01,882 INFO L85 PathProgramCache]: Analyzing trace with hash -131566686, now seen corresponding path program 1 times [2025-03-03 14:16:01,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:01,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481963838] [2025-03-03 14:16:01,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:01,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:01,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:16:01,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:16:01,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:01,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:01,977 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 14:16:01,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:01,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481963838] [2025-03-03 14:16:01,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481963838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:01,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:01,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:16:01,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646948603] [2025-03-03 14:16:01,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:01,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:16:01,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:01,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:16:01,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:01,979 INFO L87 Difference]: Start difference. First operand 554 states and 897 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:02,049 INFO L93 Difference]: Finished difference Result 1056 states and 1726 transitions. [2025-03-03 14:16:02,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:16:02,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-03 14:16:02,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:02,055 INFO L225 Difference]: With dead ends: 1056 [2025-03-03 14:16:02,055 INFO L226 Difference]: Without dead ends: 533 [2025-03-03 14:16:02,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 14:16:02,058 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 84 mSDsluCounter, 4357 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5243 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:02,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5243 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:02,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-03 14:16:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2025-03-03 14:16:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 409 states have (on average 1.6381418092909537) internal successors, (670), 430 states have internal predecessors, (670), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 14:16:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 863 transitions. [2025-03-03 14:16:02,075 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 863 transitions. Word has length 70 [2025-03-03 14:16:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:02,075 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 863 transitions. [2025-03-03 14:16:02,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:02,075 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 863 transitions. [2025-03-03 14:16:02,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 14:16:02,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:02,076 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, 1, 1, 1] [2025-03-03 14:16:02,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:16:02,076 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:02,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:02,077 INFO L85 PathProgramCache]: Analyzing trace with hash -544810376, now seen corresponding path program 1 times [2025-03-03 14:16:02,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:02,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898517018] [2025-03-03 14:16:02,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:02,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:02,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 14:16:02,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 14:16:02,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:02,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:02,167 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 14:16:02,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:02,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898517018] [2025-03-03 14:16:02,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898517018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:02,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:02,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:02,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263941554] [2025-03-03 14:16:02,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:02,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:02,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:02,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:02,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:02,169 INFO L87 Difference]: Start difference. First operand 533 states and 863 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:02,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:02,230 INFO L93 Difference]: Finished difference Result 1035 states and 1692 transitions. [2025-03-03 14:16:02,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:02,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-03-03 14:16:02,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:02,234 INFO L225 Difference]: With dead ends: 1035 [2025-03-03 14:16:02,234 INFO L226 Difference]: Without dead ends: 533 [2025-03-03 14:16:02,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:02,237 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 17 mSDsluCounter, 3375 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4221 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:02,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4221 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:02,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-03 14:16:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2025-03-03 14:16:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 409 states have (on average 1.6356968215158925) internal successors, (669), 430 states have internal predecessors, (669), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 14:16:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 862 transitions. [2025-03-03 14:16:02,252 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 862 transitions. Word has length 71 [2025-03-03 14:16:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:02,252 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 862 transitions. [2025-03-03 14:16:02,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 862 transitions. [2025-03-03 14:16:02,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 14:16:02,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:02,253 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, 1, 1, 1, 1] [2025-03-03 14:16:02,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:16:02,254 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:02,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:02,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1281635370, now seen corresponding path program 1 times [2025-03-03 14:16:02,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:02,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480253239] [2025-03-03 14:16:02,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:02,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:02,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:16:02,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:16:02,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:02,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:02,333 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 14:16:02,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:02,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480253239] [2025-03-03 14:16:02,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480253239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:02,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:02,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:02,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032772175] [2025-03-03 14:16:02,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:02,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:02,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:02,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:02,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:02,335 INFO L87 Difference]: Start difference. First operand 533 states and 862 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:02,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:02,392 INFO L93 Difference]: Finished difference Result 1035 states and 1691 transitions. [2025-03-03 14:16:02,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:02,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2025-03-03 14:16:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:02,396 INFO L225 Difference]: With dead ends: 1035 [2025-03-03 14:16:02,396 INFO L226 Difference]: Without dead ends: 533 [2025-03-03 14:16:02,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:02,398 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 16 mSDsluCounter, 3375 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4221 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:02,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4221 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-03 14:16:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2025-03-03 14:16:02,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 409 states have (on average 1.6332518337408313) internal successors, (668), 430 states have internal predecessors, (668), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 14:16:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 861 transitions. [2025-03-03 14:16:02,413 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 861 transitions. Word has length 72 [2025-03-03 14:16:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:02,414 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 861 transitions. [2025-03-03 14:16:02,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:02,414 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 861 transitions. [2025-03-03 14:16:02,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 14:16:02,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:02,415 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, 1, 1, 1, 1, 1] [2025-03-03 14:16:02,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:16:02,415 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:02,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:02,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1047682501, now seen corresponding path program 1 times [2025-03-03 14:16:02,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:02,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576630486] [2025-03-03 14:16:02,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:02,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:02,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 14:16:02,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 14:16:02,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:02,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:02,602 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 14:16:02,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:02,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576630486] [2025-03-03 14:16:02,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576630486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:02,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:02,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:16:02,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713181890] [2025-03-03 14:16:02,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:02,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:16:02,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:02,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:16:02,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:16:02,603 INFO L87 Difference]: Start difference. First operand 533 states and 861 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:02,703 INFO L93 Difference]: Finished difference Result 1029 states and 1679 transitions. [2025-03-03 14:16:02,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:16:02,704 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 73 [2025-03-03 14:16:02,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:02,709 INFO L225 Difference]: With dead ends: 1029 [2025-03-03 14:16:02,709 INFO L226 Difference]: Without dead ends: 533 [2025-03-03 14:16:02,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:16:02,712 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 6 mSDsluCounter, 6738 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7583 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:02,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7583 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-03 14:16:02,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2025-03-03 14:16:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 409 states have (on average 1.63080684596577) internal successors, (667), 430 states have internal predecessors, (667), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 14:16:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 860 transitions. [2025-03-03 14:16:02,730 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 860 transitions. Word has length 73 [2025-03-03 14:16:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:02,731 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 860 transitions. [2025-03-03 14:16:02,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 860 transitions. [2025-03-03 14:16:02,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:16:02,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:02,732 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, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:02,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:16:02,733 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:02,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:02,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1884125015, now seen corresponding path program 1 times [2025-03-03 14:16:02,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:02,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110055152] [2025-03-03 14:16:02,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:02,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:02,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:16:02,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:16:02,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:02,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:02,910 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 14:16:02,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:02,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110055152] [2025-03-03 14:16:02,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110055152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:02,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:02,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:02,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008711212] [2025-03-03 14:16:02,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:02,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:02,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:02,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:02,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:02,912 INFO L87 Difference]: Start difference. First operand 533 states and 860 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:16:04,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:04,654 INFO L93 Difference]: Finished difference Result 1657 states and 2737 transitions. [2025-03-03 14:16:04,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:04,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 74 [2025-03-03 14:16:04,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:04,662 INFO L225 Difference]: With dead ends: 1657 [2025-03-03 14:16:04,662 INFO L226 Difference]: Without dead ends: 1169 [2025-03-03 14:16:04,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:16:04,665 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 1976 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2044 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:04,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2044 Valid, 1133 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 1891 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 14:16:04,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2025-03-03 14:16:04,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1047. [2025-03-03 14:16:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 810 states have (on average 1.651851851851852) internal successors, (1338), 840 states have internal predecessors, (1338), 192 states have call successors, (192), 43 states have call predecessors, (192), 44 states have return successors, (194), 176 states have call predecessors, (194), 187 states have call successors, (194) [2025-03-03 14:16:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1724 transitions. [2025-03-03 14:16:04,707 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1724 transitions. Word has length 74 [2025-03-03 14:16:04,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:04,708 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1724 transitions. [2025-03-03 14:16:04,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:16:04,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1724 transitions. [2025-03-03 14:16:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:16:04,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:04,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:16:04,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:16:04,711 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:04,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:04,711 INFO L85 PathProgramCache]: Analyzing trace with hash -456695521, now seen corresponding path program 1 times [2025-03-03 14:16:04,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:04,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209317748] [2025-03-03 14:16:04,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:04,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:04,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:16:04,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:16:04,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:04,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:16:04,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:04,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209317748] [2025-03-03 14:16:04,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209317748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:04,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847671103] [2025-03-03 14:16:04,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:04,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:04,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:04,849 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 14:16:04,851 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 14:16:04,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:16:05,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:16:05,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:05,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:05,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:16:05,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:16:05,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:05,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847671103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:05,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:05,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:16:05,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965924761] [2025-03-03 14:16:05,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:05,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:05,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:05,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:05,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:05,269 INFO L87 Difference]: Start difference. First operand 1047 states and 1724 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:16:05,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:05,722 INFO L93 Difference]: Finished difference Result 2065 states and 3470 transitions. [2025-03-03 14:16:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:05,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-03-03 14:16:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:05,729 INFO L225 Difference]: With dead ends: 2065 [2025-03-03 14:16:05,730 INFO L226 Difference]: Without dead ends: 1063 [2025-03-03 14:16:05,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:16:05,736 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 807 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:05,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 2146 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:16:05,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2025-03-03 14:16:05,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1063. [2025-03-03 14:16:05,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 824 states have (on average 1.6529126213592233) internal successors, (1362), 854 states have internal predecessors, (1362), 192 states have call successors, (192), 45 states have call predecessors, (192), 46 states have return successors, (196), 176 states have call predecessors, (196), 187 states have call successors, (196) [2025-03-03 14:16:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1750 transitions. [2025-03-03 14:16:05,779 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1750 transitions. Word has length 127 [2025-03-03 14:16:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:05,780 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1750 transitions. [2025-03-03 14:16:05,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:16:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1750 transitions. [2025-03-03 14:16:05,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:16:05,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:05,783 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:05,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:05,987 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,SelfDestructingSolverStorable15 [2025-03-03 14:16:05,987 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:05,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:05,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1754190143, now seen corresponding path program 1 times [2025-03-03 14:16:05,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:05,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285422139] [2025-03-03 14:16:05,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:05,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:06,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:16:06,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:16:06,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:06,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:06,098 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:16:06,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:06,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285422139] [2025-03-03 14:16:06,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285422139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:06,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049746826] [2025-03-03 14:16:06,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:06,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:06,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:06,101 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 14:16:06,102 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 14:16:06,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:16:06,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:16:06,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:06,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:06,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 1702 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:16:06,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:16:06,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:06,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049746826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:06,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:06,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:16:06,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827685383] [2025-03-03 14:16:06,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:06,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:06,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:06,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:06,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:06,463 INFO L87 Difference]: Start difference. First operand 1063 states and 1750 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:16:06,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:06,905 INFO L93 Difference]: Finished difference Result 2097 states and 3516 transitions. [2025-03-03 14:16:06,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:06,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2025-03-03 14:16:06,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:06,912 INFO L225 Difference]: With dead ends: 2097 [2025-03-03 14:16:06,912 INFO L226 Difference]: Without dead ends: 1079 [2025-03-03 14:16:06,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:16:06,918 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 808 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:06,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 2143 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:16:06,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2025-03-03 14:16:06,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2025-03-03 14:16:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 838 states have (on average 1.6539379474940334) internal successors, (1386), 868 states have internal predecessors, (1386), 192 states have call successors, (192), 47 states have call predecessors, (192), 48 states have return successors, (198), 176 states have call predecessors, (198), 187 states have call successors, (198) [2025-03-03 14:16:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1776 transitions. [2025-03-03 14:16:06,963 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1776 transitions. Word has length 129 [2025-03-03 14:16:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:06,963 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1776 transitions. [2025-03-03 14:16:06,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:16:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1776 transitions. [2025-03-03 14:16:06,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:16:06,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:06,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:16:06,975 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 14:16:07,167 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,SelfDestructingSolverStorable16 [2025-03-03 14:16:07,168 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:07,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash -958550593, now seen corresponding path program 1 times [2025-03-03 14:16:07,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:07,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767124353] [2025-03-03 14:16:07,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:07,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:07,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:16:07,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:16:07,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:07,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:16:07,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:07,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767124353] [2025-03-03 14:16:07,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767124353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:07,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652929941] [2025-03-03 14:16:07,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:07,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:07,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:07,272 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 14:16:07,274 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 14:16:07,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:16:07,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:16:07,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:07,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:07,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 1704 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:16:07,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:16:07,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:07,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652929941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:07,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:07,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:16:07,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379705629] [2025-03-03 14:16:07,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:07,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:07,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:07,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:07,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:07,641 INFO L87 Difference]: Start difference. First operand 1079 states and 1776 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:16:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:08,072 INFO L93 Difference]: Finished difference Result 2129 states and 3562 transitions. [2025-03-03 14:16:08,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:08,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-03-03 14:16:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:08,078 INFO L225 Difference]: With dead ends: 2129 [2025-03-03 14:16:08,079 INFO L226 Difference]: Without dead ends: 1095 [2025-03-03 14:16:08,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:16:08,084 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 800 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:08,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 2140 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:16:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2025-03-03 14:16:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1095. [2025-03-03 14:16:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 852 states have (on average 1.6549295774647887) internal successors, (1410), 882 states have internal predecessors, (1410), 192 states have call successors, (192), 49 states have call predecessors, (192), 50 states have return successors, (200), 176 states have call predecessors, (200), 187 states have call successors, (200) [2025-03-03 14:16:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1802 transitions. [2025-03-03 14:16:08,124 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1802 transitions. Word has length 131 [2025-03-03 14:16:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:08,124 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1802 transitions. [2025-03-03 14:16:08,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:16:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1802 transitions. [2025-03-03 14:16:08,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:16:08,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:08,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:16:08,135 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 14:16:08,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 14:16:08,331 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:08,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:08,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1042792699, now seen corresponding path program 1 times [2025-03-03 14:16:08,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:08,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97416656] [2025-03-03 14:16:08,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:08,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:08,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:16:08,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:16:08,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:08,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:16:08,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:08,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97416656] [2025-03-03 14:16:08,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97416656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:08,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745836784] [2025-03-03 14:16:08,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:08,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:08,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:08,460 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 14:16:08,462 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 14:16:08,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:16:08,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:16:08,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:08,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:08,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 1706 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:16:08,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:16:08,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:08,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745836784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:08,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:08,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:16:08,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225891944] [2025-03-03 14:16:08,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:08,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:08,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:08,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:08,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:16:08,816 INFO L87 Difference]: Start difference. First operand 1095 states and 1802 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:16:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:09,227 INFO L93 Difference]: Finished difference Result 2161 states and 3608 transitions. [2025-03-03 14:16:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:09,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2025-03-03 14:16:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:09,234 INFO L225 Difference]: With dead ends: 2161 [2025-03-03 14:16:09,234 INFO L226 Difference]: Without dead ends: 1111 [2025-03-03 14:16:09,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:16:09,238 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 796 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 2137 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:09,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 2137 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:16:09,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2025-03-03 14:16:09,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2025-03-03 14:16:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 866 states have (on average 1.6558891454965359) internal successors, (1434), 896 states have internal predecessors, (1434), 192 states have call successors, (192), 51 states have call predecessors, (192), 52 states have return successors, (202), 176 states have call predecessors, (202), 187 states have call successors, (202) [2025-03-03 14:16:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1828 transitions. [2025-03-03 14:16:09,274 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1828 transitions. Word has length 133 [2025-03-03 14:16:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:09,274 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1828 transitions. [2025-03-03 14:16:09,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:16:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1828 transitions. [2025-03-03 14:16:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 14:16:09,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:09,278 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:09,286 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 14:16:09,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:09,479 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:09,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2030878497, now seen corresponding path program 1 times [2025-03-03 14:16:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:09,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704557385] [2025-03-03 14:16:09,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:09,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:09,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:16:09,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:16:09,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:09,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:16:09,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:09,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704557385] [2025-03-03 14:16:09,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704557385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:09,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242804382] [2025-03-03 14:16:09,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:09,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:09,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:09,725 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 14:16:09,727 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 14:16:09,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:16:09,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:16:09,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:09,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:09,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 1708 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:16:09,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:16:10,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:10,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242804382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:10,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:10,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2025-03-03 14:16:10,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344677224] [2025-03-03 14:16:10,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:10,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:10,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:10,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:10,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:10,141 INFO L87 Difference]: Start difference. First operand 1111 states and 1828 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 14:16:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:10,505 INFO L93 Difference]: Finished difference Result 1190 states and 1952 transitions. [2025-03-03 14:16:10,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:10,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 135 [2025-03-03 14:16:10,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:10,512 INFO L225 Difference]: With dead ends: 1190 [2025-03-03 14:16:10,512 INFO L226 Difference]: Without dead ends: 1175 [2025-03-03 14:16:10,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:10,514 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 783 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:10,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 2182 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:16:10,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-03-03 14:16:10,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1117. [2025-03-03 14:16:10,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 872 states have (on average 1.651376146788991) internal successors, (1440), 902 states have internal predecessors, (1440), 192 states have call successors, (192), 51 states have call predecessors, (192), 52 states have return successors, (202), 176 states have call predecessors, (202), 187 states have call successors, (202) [2025-03-03 14:16:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1834 transitions. [2025-03-03 14:16:10,551 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1834 transitions. Word has length 135 [2025-03-03 14:16:10,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:10,551 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1834 transitions. [2025-03-03 14:16:10,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 14:16:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1834 transitions. [2025-03-03 14:16:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:16:10,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:10,555 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:10,562 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 14:16:10,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:10,755 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:10,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash -275018102, now seen corresponding path program 1 times [2025-03-03 14:16:10,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:10,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856422910] [2025-03-03 14:16:10,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:10,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:10,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:16:10,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:16:10,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:10,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:16:10,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:10,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856422910] [2025-03-03 14:16:10,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856422910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:10,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:10,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 14:16:10,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606495436] [2025-03-03 14:16:10,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:10,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:16:10,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:10,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:16:10,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:16:10,977 INFO L87 Difference]: Start difference. First operand 1117 states and 1834 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 10 states have internal predecessors, (95), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:16:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:14,578 INFO L93 Difference]: Finished difference Result 4171 states and 6862 transitions. [2025-03-03 14:16:14,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:16:14,578 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 10 states have internal predecessors, (95), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 140 [2025-03-03 14:16:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:14,594 INFO L225 Difference]: With dead ends: 4171 [2025-03-03 14:16:14,594 INFO L226 Difference]: Without dead ends: 3099 [2025-03-03 14:16:14,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:16:14,621 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 2811 mSDsluCounter, 3676 mSDsCounter, 0 mSdLazyCounter, 9464 mSolverCounterSat, 950 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2889 SdHoareTripleChecker+Valid, 4404 SdHoareTripleChecker+Invalid, 10414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 950 IncrementalHoareTripleChecker+Valid, 9464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:14,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2889 Valid, 4404 Invalid, 10414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [950 Valid, 9464 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 14:16:14,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2025-03-03 14:16:14,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3005. [2025-03-03 14:16:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3005 states, 2280 states have (on average 1.624122807017544) internal successors, (3703), 2356 states have internal predecessors, (3703), 574 states have call successors, (574), 133 states have call predecessors, (574), 150 states have return successors, (631), 548 states have call predecessors, (631), 569 states have call successors, (631) [2025-03-03 14:16:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 4908 transitions. [2025-03-03 14:16:14,733 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 4908 transitions. Word has length 140 [2025-03-03 14:16:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:14,733 INFO L471 AbstractCegarLoop]: Abstraction has 3005 states and 4908 transitions. [2025-03-03 14:16:14,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 10 states have internal predecessors, (95), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:16:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 4908 transitions. [2025-03-03 14:16:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 14:16:14,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:14,741 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:14,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:16:14,741 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:14,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:14,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2087377501, now seen corresponding path program 1 times [2025-03-03 14:16:14,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:14,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164706302] [2025-03-03 14:16:14,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:14,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:14,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 14:16:14,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 14:16:14,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:14,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:16:14,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164706302] [2025-03-03 14:16:14,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164706302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842926933] [2025-03-03 14:16:14,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:14,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:14,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:14,976 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 14:16:14,978 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 14:16:15,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 14:16:15,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 14:16:15,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:15,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:15,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 1724 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:16:15,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:16:15,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:15,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842926933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:15,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:15,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2025-03-03 14:16:15,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664939360] [2025-03-03 14:16:15,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:15,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:15,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:15,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:15,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:16:15,304 INFO L87 Difference]: Start difference. First operand 3005 states and 4908 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:16:15,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:15,580 INFO L93 Difference]: Finished difference Result 3209 states and 5208 transitions. [2025-03-03 14:16:15,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:15,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2025-03-03 14:16:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:15,596 INFO L225 Difference]: With dead ends: 3209 [2025-03-03 14:16:15,596 INFO L226 Difference]: Without dead ends: 3194 [2025-03-03 14:16:15,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:16:15,600 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 787 mSDsluCounter, 2512 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 3369 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:15,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 3369 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:16:15,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2025-03-03 14:16:15,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3173. [2025-03-03 14:16:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3173 states, 2416 states have (on average 1.6187913907284768) internal successors, (3911), 2492 states have internal predecessors, (3911), 590 states have call successors, (590), 149 states have call predecessors, (590), 166 states have return successors, (657), 564 states have call predecessors, (657), 585 states have call successors, (657) [2025-03-03 14:16:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 3173 states and 5158 transitions. [2025-03-03 14:16:15,745 INFO L78 Accepts]: Start accepts. Automaton has 3173 states and 5158 transitions. Word has length 141 [2025-03-03 14:16:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:15,745 INFO L471 AbstractCegarLoop]: Abstraction has 3173 states and 5158 transitions. [2025-03-03 14:16:15,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:16:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3173 states and 5158 transitions. [2025-03-03 14:16:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 14:16:15,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:15,750 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:15,758 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 14:16:15,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:15,950 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:15,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:15,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1484249060, now seen corresponding path program 1 times [2025-03-03 14:16:15,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:15,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936896785] [2025-03-03 14:16:15,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:15,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:15,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:16:15,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:16:15,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:15,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 14:16:16,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:16,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936896785] [2025-03-03 14:16:16,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936896785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:16,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421094912] [2025-03-03 14:16:16,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:16,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:16,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:16,190 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 14:16:16,192 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 14:16:16,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:16:16,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:16:16,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:16,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:16,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 1760 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 14:16:16,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:16:16,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:16,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421094912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:16,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:16,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2025-03-03 14:16:16,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766905916] [2025-03-03 14:16:16,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:16,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:16:16,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:16,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:16:16,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:16:16,539 INFO L87 Difference]: Start difference. First operand 3173 states and 5158 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 6 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-03 14:16:18,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:18,674 INFO L93 Difference]: Finished difference Result 11319 states and 18688 transitions. [2025-03-03 14:16:18,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 14:16:18,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 6 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 151 [2025-03-03 14:16:18,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:18,717 INFO L225 Difference]: With dead ends: 11319 [2025-03-03 14:16:18,717 INFO L226 Difference]: Without dead ends: 8199 [2025-03-03 14:16:18,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:16:18,736 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 2338 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 4673 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2423 SdHoareTripleChecker+Valid, 2730 SdHoareTripleChecker+Invalid, 5193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 4673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:18,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2423 Valid, 2730 Invalid, 5193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [520 Valid, 4673 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:16:18,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2025-03-03 14:16:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 7712. [2025-03-03 14:16:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7712 states, 5913 states have (on average 1.6279384407238289) internal successors, (9626), 6098 states have internal predecessors, (9626), 1362 states have call successors, (1362), 353 states have call predecessors, (1362), 436 states have return successors, (1641), 1326 states have call predecessors, (1641), 1357 states have call successors, (1641) [2025-03-03 14:16:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7712 states to 7712 states and 12629 transitions. [2025-03-03 14:16:19,116 INFO L78 Accepts]: Start accepts. Automaton has 7712 states and 12629 transitions. Word has length 151 [2025-03-03 14:16:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:19,117 INFO L471 AbstractCegarLoop]: Abstraction has 7712 states and 12629 transitions. [2025-03-03 14:16:19,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 6 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-03 14:16:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 7712 states and 12629 transitions. [2025-03-03 14:16:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 14:16:19,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:19,122 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:19,131 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 14:16:19,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:19,323 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:19,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:19,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1193988118, now seen corresponding path program 1 times [2025-03-03 14:16:19,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:19,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138157123] [2025-03-03 14:16:19,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:19,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:19,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:16:19,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:16:19,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:19,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:19,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:19,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138157123] [2025-03-03 14:16:19,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138157123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:19,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393437010] [2025-03-03 14:16:19,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:19,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:19,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:19,642 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 14:16:19,643 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 14:16:19,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:16:19,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:16:19,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:19,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:19,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 1756 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 14:16:19,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:19,986 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:19,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:19,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393437010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:19,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:19,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-03-03 14:16:19,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234570051] [2025-03-03 14:16:19,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:19,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:16:19,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:19,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:16:19,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:16:19,988 INFO L87 Difference]: Start difference. First operand 7712 states and 12629 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 5 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:16:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:21,799 INFO L93 Difference]: Finished difference Result 16758 states and 27634 transitions. [2025-03-03 14:16:21,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:16:21,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 5 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 153 [2025-03-03 14:16:21,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:21,840 INFO L225 Difference]: With dead ends: 16758 [2025-03-03 14:16:21,840 INFO L226 Difference]: Without dead ends: 9099 [2025-03-03 14:16:21,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:16:21,861 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 2084 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 3364 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2168 SdHoareTripleChecker+Valid, 2180 SdHoareTripleChecker+Invalid, 3853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 3364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:21,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2168 Valid, 2180 Invalid, 3853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 3364 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 14:16:21,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9099 states. [2025-03-03 14:16:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9099 to 8150. [2025-03-03 14:16:22,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8150 states, 6231 states have (on average 1.615150056170759) internal successors, (10064), 6452 states have internal predecessors, (10064), 1410 states have call successors, (1410), 383 states have call predecessors, (1410), 508 states have return successors, (1805), 1380 states have call predecessors, (1805), 1405 states have call successors, (1805) [2025-03-03 14:16:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8150 states to 8150 states and 13279 transitions. [2025-03-03 14:16:22,238 INFO L78 Accepts]: Start accepts. Automaton has 8150 states and 13279 transitions. Word has length 153 [2025-03-03 14:16:22,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:22,239 INFO L471 AbstractCegarLoop]: Abstraction has 8150 states and 13279 transitions. [2025-03-03 14:16:22,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 5 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:16:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 8150 states and 13279 transitions. [2025-03-03 14:16:22,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 14:16:22,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:22,244 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:22,252 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 14:16:22,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-03 14:16:22,445 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:22,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1203300983, now seen corresponding path program 1 times [2025-03-03 14:16:22,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:22,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729135855] [2025-03-03 14:16:22,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:22,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:22,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 14:16:22,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 14:16:22,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:22,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:22,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:22,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729135855] [2025-03-03 14:16:22,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729135855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:22,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117826148] [2025-03-03 14:16:22,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:22,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:22,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:22,683 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 14:16:22,685 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 14:16:22,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 14:16:22,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 14:16:22,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:22,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:22,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 1773 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:16:22,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:22,928 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:16:22,928 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:22,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117826148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:22,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:22,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2025-03-03 14:16:22,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490004145] [2025-03-03 14:16:22,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:22,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:16:22,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:22,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:16:22,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:16:22,930 INFO L87 Difference]: Start difference. First operand 8150 states and 13279 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:16:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:23,517 INFO L93 Difference]: Finished difference Result 20491 states and 33797 transitions. [2025-03-03 14:16:23,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:16:23,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 158 [2025-03-03 14:16:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:23,591 INFO L225 Difference]: With dead ends: 20491 [2025-03-03 14:16:23,592 INFO L226 Difference]: Without dead ends: 12398 [2025-03-03 14:16:23,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:16:23,632 INFO L435 NwaCegarLoop]: 1531 mSDtfsCounter, 801 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:23,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 2382 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12398 states. [2025-03-03 14:16:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12398 to 8126. [2025-03-03 14:16:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8126 states, 6219 states have (on average 1.6144074610065926) internal successors, (10040), 6428 states have internal predecessors, (10040), 1410 states have call successors, (1410), 383 states have call predecessors, (1410), 496 states have return successors, (1751), 1380 states have call predecessors, (1751), 1405 states have call successors, (1751) [2025-03-03 14:16:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8126 states to 8126 states and 13201 transitions. [2025-03-03 14:16:24,218 INFO L78 Accepts]: Start accepts. Automaton has 8126 states and 13201 transitions. Word has length 158 [2025-03-03 14:16:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:24,219 INFO L471 AbstractCegarLoop]: Abstraction has 8126 states and 13201 transitions. [2025-03-03 14:16:24,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:16:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 8126 states and 13201 transitions. [2025-03-03 14:16:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 14:16:24,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:24,223 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:24,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 14:16:24,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-03 14:16:24,425 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:24,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash -497439496, now seen corresponding path program 1 times [2025-03-03 14:16:24,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:24,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557839584] [2025-03-03 14:16:24,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:24,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:24,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 14:16:24,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 14:16:24,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:24,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:24,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:24,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557839584] [2025-03-03 14:16:24,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557839584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:24,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701787938] [2025-03-03 14:16:24,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:24,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:24,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:24,659 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 14:16:24,660 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 14:16:24,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 14:16:24,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 14:16:24,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:24,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:24,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 1772 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:16:24,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:25,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:25,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701787938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:25,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:25,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:25,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853181807] [2025-03-03 14:16:25,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:25,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:25,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:25,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:25,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:25,007 INFO L87 Difference]: Start difference. First operand 8126 states and 13201 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:16:26,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:26,377 INFO L93 Difference]: Finished difference Result 21701 states and 35875 transitions. [2025-03-03 14:16:26,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:26,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 158 [2025-03-03 14:16:26,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:26,445 INFO L225 Difference]: With dead ends: 21701 [2025-03-03 14:16:26,445 INFO L226 Difference]: Without dead ends: 13620 [2025-03-03 14:16:26,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:26,476 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 1877 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:26,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1955 Valid, 941 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 14:16:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13620 states. [2025-03-03 14:16:26,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13620 to 13030. [2025-03-03 14:16:27,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13030 states, 9856 states have (on average 1.6042004870129871) internal successors, (15811), 10236 states have internal predecessors, (15811), 2370 states have call successors, (2370), 596 states have call predecessors, (2370), 803 states have return successors, (3185), 2359 states have call predecessors, (3185), 2365 states have call successors, (3185) [2025-03-03 14:16:27,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13030 states to 13030 states and 21366 transitions. [2025-03-03 14:16:27,073 INFO L78 Accepts]: Start accepts. Automaton has 13030 states and 21366 transitions. Word has length 158 [2025-03-03 14:16:27,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:27,074 INFO L471 AbstractCegarLoop]: Abstraction has 13030 states and 21366 transitions. [2025-03-03 14:16:27,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:16:27,074 INFO L276 IsEmpty]: Start isEmpty. Operand 13030 states and 21366 transitions. [2025-03-03 14:16:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 14:16:27,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:27,079 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:27,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 14:16:27,281 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,SelfDestructingSolverStorable25 [2025-03-03 14:16:27,282 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:27,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:27,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1759017449, now seen corresponding path program 1 times [2025-03-03 14:16:27,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:27,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957159097] [2025-03-03 14:16:27,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:27,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:27,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 14:16:27,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 14:16:27,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:27,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:27,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:27,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957159097] [2025-03-03 14:16:27,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957159097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:27,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126452688] [2025-03-03 14:16:27,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:27,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:27,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:27,522 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 14:16:27,525 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 14:16:27,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 14:16:27,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 14:16:27,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:27,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:27,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 1774 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:16:27,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:27,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126452688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:27,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:27,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:27,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082010057] [2025-03-03 14:16:27,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:27,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:27,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:27,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:27,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:27,880 INFO L87 Difference]: Start difference. First operand 13030 states and 21366 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:16:30,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:30,572 INFO L93 Difference]: Finished difference Result 37865 states and 64206 transitions. [2025-03-03 14:16:30,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:30,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 159 [2025-03-03 14:16:30,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:30,736 INFO L225 Difference]: With dead ends: 37865 [2025-03-03 14:16:30,737 INFO L226 Difference]: Without dead ends: 24880 [2025-03-03 14:16:30,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:30,813 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 1880 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1957 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:30,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1957 Valid, 909 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 14:16:30,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24880 states. [2025-03-03 14:16:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24880 to 23821. [2025-03-03 14:16:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23821 states, 17715 states have (on average 1.5935083262771663) internal successors, (28229), 18509 states have internal predecessors, (28229), 4646 states have call successors, (4646), 1022 states have call predecessors, (4646), 1459 states have return successors, (7091), 4697 states have call predecessors, (7091), 4641 states have call successors, (7091) [2025-03-03 14:16:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23821 states to 23821 states and 39966 transitions. [2025-03-03 14:16:31,968 INFO L78 Accepts]: Start accepts. Automaton has 23821 states and 39966 transitions. Word has length 159 [2025-03-03 14:16:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:31,968 INFO L471 AbstractCegarLoop]: Abstraction has 23821 states and 39966 transitions. [2025-03-03 14:16:31,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:16:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 23821 states and 39966 transitions. [2025-03-03 14:16:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 14:16:31,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:31,974 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:31,982 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 14:16:32,174 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,SelfDestructingSolverStorable26 [2025-03-03 14:16:32,175 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:32,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:32,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1305265070, now seen corresponding path program 1 times [2025-03-03 14:16:32,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:32,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69962916] [2025-03-03 14:16:32,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:32,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:32,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 14:16:32,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 14:16:32,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:32,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:32,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:32,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69962916] [2025-03-03 14:16:32,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69962916] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:32,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723754233] [2025-03-03 14:16:32,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:32,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:32,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:32,458 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 14:16:32,459 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 14:16:32,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 14:16:32,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 14:16:32,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:32,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:32,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 1776 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:16:32,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:32,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:32,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723754233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:32,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:32,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:32,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815875745] [2025-03-03 14:16:32,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:32,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:32,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:32,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:32,819 INFO L87 Difference]: Start difference. First operand 23821 states and 39966 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:16:36,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:36,283 INFO L93 Difference]: Finished difference Result 73833 states and 131305 transitions. [2025-03-03 14:16:36,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:36,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2025-03-03 14:16:36,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:36,669 INFO L225 Difference]: With dead ends: 73833 [2025-03-03 14:16:36,670 INFO L226 Difference]: Without dead ends: 50057 [2025-03-03 14:16:36,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:36,789 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 1867 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1943 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:36,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1943 Valid, 905 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 14:16:36,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50057 states. [2025-03-03 14:16:39,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50057 to 48025. [2025-03-03 14:16:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48025 states, 34986 states have (on average 1.5823758074658434) internal successors, (55361), 36794 states have internal predecessors, (55361), 10159 states have call successors, (10159), 1874 states have call predecessors, (10159), 2879 states have return successors, (18318), 10406 states have call predecessors, (18318), 10154 states have call successors, (18318) [2025-03-03 14:16:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48025 states to 48025 states and 83838 transitions. [2025-03-03 14:16:39,986 INFO L78 Accepts]: Start accepts. Automaton has 48025 states and 83838 transitions. Word has length 160 [2025-03-03 14:16:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:39,986 INFO L471 AbstractCegarLoop]: Abstraction has 48025 states and 83838 transitions. [2025-03-03 14:16:39,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:16:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 48025 states and 83838 transitions. [2025-03-03 14:16:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 14:16:39,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:39,991 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:40,000 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 14:16:40,192 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,SelfDestructingSolverStorable27 [2025-03-03 14:16:40,192 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:40,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:40,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1808746429, now seen corresponding path program 1 times [2025-03-03 14:16:40,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:40,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034754883] [2025-03-03 14:16:40,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:40,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:40,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 14:16:40,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 14:16:40,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:40,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:40,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:40,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034754883] [2025-03-03 14:16:40,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034754883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:40,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245316995] [2025-03-03 14:16:40,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:40,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:40,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:40,390 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 14:16:40,392 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 14:16:40,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 14:16:40,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 14:16:40,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:40,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:40,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 1778 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:16:40,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:40,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:40,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245316995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:40,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:40,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:40,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700436700] [2025-03-03 14:16:40,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:40,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:40,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:40,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:40,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:40,717 INFO L87 Difference]: Start difference. First operand 48025 states and 83838 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:16:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:47,738 INFO L93 Difference]: Finished difference Result 155526 states and 299058 transitions. [2025-03-03 14:16:47,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:47,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 161 [2025-03-03 14:16:47,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:48,512 INFO L225 Difference]: With dead ends: 155526 [2025-03-03 14:16:48,512 INFO L226 Difference]: Without dead ends: 107546 [2025-03-03 14:16:48,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:48,778 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1854 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1929 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:48,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1929 Valid, 901 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:16:48,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107546 states. [2025-03-03 14:16:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107546 to 103701. [2025-03-03 14:16:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103701 states, 73857 states have (on average 1.5707245081711958) internal successors, (116009), 78179 states have internal predecessors, (116009), 23836 states have call successors, (23836), 3578 states have call predecessors, (23836), 6007 states have return successors, (52561), 24691 states have call predecessors, (52561), 23831 states have call successors, (52561) [2025-03-03 14:16:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103701 states to 103701 states and 192406 transitions. [2025-03-03 14:16:56,996 INFO L78 Accepts]: Start accepts. Automaton has 103701 states and 192406 transitions. Word has length 161 [2025-03-03 14:16:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:56,997 INFO L471 AbstractCegarLoop]: Abstraction has 103701 states and 192406 transitions. [2025-03-03 14:16:56,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:16:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 103701 states and 192406 transitions. [2025-03-03 14:16:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 14:16:57,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:57,002 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:57,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 14:16:57,203 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,SelfDestructingSolverStorable28 [2025-03-03 14:16:57,203 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:57,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:57,206 INFO L85 PathProgramCache]: Analyzing trace with hash -236803156, now seen corresponding path program 1 times [2025-03-03 14:16:57,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:57,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148721807] [2025-03-03 14:16:57,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:57,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 14:16:57,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 14:16:57,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:57,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:57,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:57,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148721807] [2025-03-03 14:16:57,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148721807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:57,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271100643] [2025-03-03 14:16:57,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:57,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:57,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:57,417 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 14:16:57,418 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 14:16:57,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 14:16:57,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 14:16:57,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:57,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:57,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 1780 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:16:57,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:57,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:57,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271100643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:57,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:57,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:57,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455220607] [2025-03-03 14:16:57,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:57,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:57,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:57,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:57,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:57,757 INFO L87 Difference]: Start difference. First operand 103701 states and 192406 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 4 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18)