./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product32.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_spec3_product32.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 d14be9b096a9cbd7bae6b76d9713e8ec6e66d6633cec6a9d1cec5445761f8a9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:18:24,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:18:25,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:18:25,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:18:25,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:18:25,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:18:25,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:18:25,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:18:25,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:18:25,061 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:18:25,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:18:25,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:18:25,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:18:25,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:18:25,062 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:18:25,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:18:25,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:18:25,063 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:18:25,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:18:25,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:18:25,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:18:25,063 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:18:25,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:18:25,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:18:25,064 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:18:25,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:18:25,064 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:18:25,064 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:18:25,064 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:18:25,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:18:25,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:18:25,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:18:25,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:18:25,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:18:25,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:18:25,065 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:18:25,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:18:25,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:18:25,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:18:25,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:18:25,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:18:25,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:18:25,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:18:25,065 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 -> d14be9b096a9cbd7bae6b76d9713e8ec6e66d6633cec6a9d1cec5445761f8a9c [2025-03-03 14:18:25,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:18:25,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:18:25,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:18:25,274 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:18:25,274 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:18:25,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product32.cil.c [2025-03-03 14:18:26,377 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a42dd09d/0038919d11144c6fa13bcfe69a988276/FLAGe4f184a18 [2025-03-03 14:18:26,742 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:18:26,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product32.cil.c [2025-03-03 14:18:26,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a42dd09d/0038919d11144c6fa13bcfe69a988276/FLAGe4f184a18 [2025-03-03 14:18:26,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a42dd09d/0038919d11144c6fa13bcfe69a988276 [2025-03-03 14:18:26,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:18:26,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:18:26,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:18:26,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:18:26,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:18:26,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:18:26" (1/1) ... [2025-03-03 14:18:26,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:26, skipping insertion in model container [2025-03-03 14:18:26,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:18:26" (1/1) ... [2025-03-03 14:18:26,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:18:26,991 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_spec3_product32.cil.c[3233,3246] [2025-03-03 14:18:27,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:18:27,264 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:18:27,270 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2025-03-03 14:18:27,272 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [151] [2025-03-03 14:18:27,272 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [160] [2025-03-03 14:18:27,272 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [198] [2025-03-03 14:18:27,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [564] [2025-03-03 14:18:27,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [753] [2025-03-03 14:18:27,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [873] [2025-03-03 14:18:27,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1540] [2025-03-03 14:18:27,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1558] [2025-03-03 14:18:27,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1907] [2025-03-03 14:18:27,279 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_spec3_product32.cil.c[3233,3246] [2025-03-03 14:18:27,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:18:27,386 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:18:27,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:27 WrapperNode [2025-03-03 14:18:27,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:18:27,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:18:27,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:18:27,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:18:27,393 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:18:27" (1/1) ... [2025-03-03 14:18:27,408 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:18:27" (1/1) ... [2025-03-03 14:18:27,438 INFO L138 Inliner]: procedures = 97, calls = 361, calls flagged for inlining = 29, calls inlined = 25, statements flattened = 1006 [2025-03-03 14:18:27,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:18:27,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:18:27,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:18:27,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:18:27,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:27" (1/1) ... [2025-03-03 14:18:27,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:27" (1/1) ... [2025-03-03 14:18:27,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:27" (1/1) ... [2025-03-03 14:18:27,482 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 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:18:27,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:27" (1/1) ... [2025-03-03 14:18:27,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:27" (1/1) ... [2025-03-03 14:18:27,495 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:27" (1/1) ... [2025-03-03 14:18:27,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:27" (1/1) ... [2025-03-03 14:18:27,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:27" (1/1) ... [2025-03-03 14:18:27,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:27" (1/1) ... [2025-03-03 14:18:27,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:18:27,507 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:18:27,507 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:18:27,508 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:18:27,508 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:27" (1/1) ... [2025-03-03 14:18:27,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:18:27,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:27,543 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:18:27,548 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:18:27,565 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-03-03 14:18:27,565 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-03-03 14:18:27,565 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:18:27,565 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:18:27,565 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:18:27,565 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:18:27,565 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-03-03 14:18:27,565 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-03-03 14:18:27,565 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:18:27,565 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:18:27,565 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:18:27,565 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:18:27,565 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:18:27,565 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:18:27,565 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-03 14:18:27,565 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-03 14:18:27,565 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-03 14:18:27,566 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-03 14:18:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:18:27,566 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:18:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:18:27,566 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:18:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:18:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-03 14:18:27,566 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-03 14:18:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:18:27,566 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:18:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-03 14:18:27,566 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-03 14:18:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-03 14:18:27,566 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-03 14:18:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:18:27,566 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:18:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:18:27,566 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:18:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:18:27,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:18:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:18:27,566 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:18:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-03-03 14:18:27,568 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:18:27,569 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-03-03 14:18:27,569 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:18:27,569 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:18:27,569 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:18:27,569 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:18:27,569 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:18:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:18:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:18:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:18:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:18:27,570 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:18:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:18:27,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:18:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:18:27,570 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:18:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2025-03-03 14:18:27,570 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2025-03-03 14:18:27,730 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:18:27,733 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:18:27,810 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2850-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~25#1; [2025-03-03 14:18:27,810 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2878: #res#1 := ~retValue_acc~26#1; [2025-03-03 14:18:27,814 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2206: #res := ~retValue_acc~17; [2025-03-03 14:18:27,835 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L792: #res := ~retValue_acc~5; [2025-03-03 14:18:27,867 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3554: #res := ~retValue_acc~30; [2025-03-03 14:18:27,934 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2794-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~24#1; [2025-03-03 14:18:27,934 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731-1: stopRequestedInDirection__wrappee__twothirdsfull_#res#1 := stopRequestedInDirection__wrappee__twothirdsfull_~retValue_acc~22#1; [2025-03-03 14:18:27,934 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2760: #res#1 := ~retValue_acc~23#1; [2025-03-03 14:18:27,945 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923: #res := ~retValue_acc~28; [2025-03-03 14:18:28,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2691: #res := ~retValue_acc~21; [2025-03-03 14:18:28,181 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2163-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; [2025-03-03 14:18:28,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2326-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~19#1; [2025-03-03 14:18:28,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2339-1: isIdle_#res#1 := isIdle_~retValue_acc~20#1; [2025-03-03 14:18:28,251 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1537: #res := ~retValue_acc~10; [2025-03-03 14:18:28,262 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L870: #res := ~retValue_acc~7; [2025-03-03 14:18:28,265 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1981: #res := ~retValue_acc~13; [2025-03-03 14:18:28,268 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2154: #res := ~retValue_acc~14; [2025-03-03 14:18:28,413 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L831: #res := ~retValue_acc~6; [2025-03-03 14:18:28,427 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2197: #res := ~retValue_acc~16; [2025-03-03 14:18:28,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2246-1: isEmpty_#res#1 := isEmpty_~retValue_acc~18#1; [2025-03-03 14:18:28,502 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1226: #res := ~retValue_acc~9; [2025-03-03 14:18:28,548 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-1: main_#res#1 := main_~retValue_acc~12#1; [2025-03-03 14:18:28,548 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L195-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-03 14:18:28,557 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L990: #res := ~retValue_acc~8; [2025-03-03 14:18:28,628 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2909-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~27#1; [2025-03-03 14:18:28,781 INFO L? ?]: Removed 497 outVars from TransFormulas that were not future-live. [2025-03-03 14:18:28,781 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:18:28,808 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:18:28,808 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:18:28,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:18:28 BoogieIcfgContainer [2025-03-03 14:18:28,808 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:18:28,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:18:28,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:18:28,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:18:28,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:18:26" (1/3) ... [2025-03-03 14:18:28,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fb3272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:18:28, skipping insertion in model container [2025-03-03 14:18:28,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:27" (2/3) ... [2025-03-03 14:18:28,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fb3272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:18:28, skipping insertion in model container [2025-03-03 14:18:28,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:18:28" (3/3) ... [2025-03-03 14:18:28,816 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product32.cil.c [2025-03-03 14:18:28,826 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:18:28,828 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product32.cil.c that has 30 procedures, 628 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:18:28,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:18:28,903 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;@6859f37e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:18:28,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:18:28,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 628 states, 482 states have (on average 1.6597510373443984) internal successors, (800), 502 states have internal predecessors, (800), 115 states have call successors, (115), 29 states have call predecessors, (115), 29 states have return successors, (115), 111 states have call predecessors, (115), 115 states have call successors, (115) [2025-03-03 14:18:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:18:28,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:28,916 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:18:28,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:28,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1888915641, now seen corresponding path program 1 times [2025-03-03 14:18:28,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:28,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554872832] [2025-03-03 14:18:28,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:28,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:29,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:18:29,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:18:29,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:29,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:29,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:29,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554872832] [2025-03-03 14:18:29,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554872832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:29,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:29,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:29,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734809873] [2025-03-03 14:18:29,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:29,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:29,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:29,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:29,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:29,501 INFO L87 Difference]: Start difference. First operand has 628 states, 482 states have (on average 1.6597510373443984) internal successors, (800), 502 states have internal predecessors, (800), 115 states have call successors, (115), 29 states have call predecessors, (115), 29 states have return successors, (115), 111 states have call predecessors, (115), 115 states have call successors, (115) Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:29,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:29,689 INFO L93 Difference]: Finished difference Result 1253 states and 2072 transitions. [2025-03-03 14:18:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:29,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 67 [2025-03-03 14:18:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:29,706 INFO L225 Difference]: With dead ends: 1253 [2025-03-03 14:18:29,706 INFO L226 Difference]: Without dead ends: 633 [2025-03-03 14:18:29,712 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:18:29,715 INFO L435 NwaCegarLoop]: 1015 mSDtfsCounter, 91 mSDsluCounter, 4989 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6004 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:29,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6004 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:29,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-03 14:18:29,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 631. [2025-03-03 14:18:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 485 states have (on average 1.6536082474226803) internal successors, (802), 505 states have internal predecessors, (802), 116 states have call successors, (116), 29 states have call predecessors, (116), 29 states have return successors, (115), 110 states have call predecessors, (115), 113 states have call successors, (115) [2025-03-03 14:18:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1033 transitions. [2025-03-03 14:18:29,791 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1033 transitions. Word has length 67 [2025-03-03 14:18:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:29,791 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 1033 transitions. [2025-03-03 14:18:29,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1033 transitions. [2025-03-03 14:18:29,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:18:29,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:29,800 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:18:29,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:18:29,800 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:29,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:29,801 INFO L85 PathProgramCache]: Analyzing trace with hash 440805100, now seen corresponding path program 1 times [2025-03-03 14:18:29,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:29,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96609329] [2025-03-03 14:18:29,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:29,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:29,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:18:29,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:18:29,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:29,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:29,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:29,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96609329] [2025-03-03 14:18:29,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96609329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:29,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:29,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:29,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448447529] [2025-03-03 14:18:29,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:29,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:29,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:29,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:29,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:29,965 INFO L87 Difference]: Start difference. First operand 631 states and 1033 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:30,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:30,043 INFO L93 Difference]: Finished difference Result 1244 states and 2047 transitions. [2025-03-03 14:18:30,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:30,043 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2025-03-03 14:18:30,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:30,050 INFO L225 Difference]: With dead ends: 1244 [2025-03-03 14:18:30,051 INFO L226 Difference]: Without dead ends: 607 [2025-03-03 14:18:30,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:18:30,055 INFO L435 NwaCegarLoop]: 1003 mSDtfsCounter, 14 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:30,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3004 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-03 14:18:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2025-03-03 14:18:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 464 states have (on average 1.644396551724138) internal successors, (763), 482 states have internal predecessors, (763), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 990 transitions. [2025-03-03 14:18:30,094 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 990 transitions. Word has length 68 [2025-03-03 14:18:30,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:30,094 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 990 transitions. [2025-03-03 14:18:30,095 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 990 transitions. [2025-03-03 14:18:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:18:30,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:30,098 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:18:30,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:18:30,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:30,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:30,102 INFO L85 PathProgramCache]: Analyzing trace with hash 931593515, now seen corresponding path program 1 times [2025-03-03 14:18:30,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:30,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690520734] [2025-03-03 14:18:30,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:30,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:30,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:18:30,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:18:30,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:30,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:30,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:30,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690520734] [2025-03-03 14:18:30,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690520734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:30,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:30,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:30,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198469154] [2025-03-03 14:18:30,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:30,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:30,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:30,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:30,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:30,408 INFO L87 Difference]: Start difference. First operand 607 states and 990 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:30,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:30,490 INFO L93 Difference]: Finished difference Result 1207 states and 1979 transitions. [2025-03-03 14:18:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:30,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2025-03-03 14:18:30,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:30,496 INFO L225 Difference]: With dead ends: 1207 [2025-03-03 14:18:30,497 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 14:18:30,499 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:18:30,501 INFO L435 NwaCegarLoop]: 979 mSDtfsCounter, 77 mSDsluCounter, 4825 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 5804 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:30,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 5804 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 14:18:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-03 14:18:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 458 states have (on average 1.6375545851528384) internal successors, (750), 476 states have internal predecessors, (750), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 977 transitions. [2025-03-03 14:18:30,531 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 977 transitions. Word has length 68 [2025-03-03 14:18:30,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:30,533 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 977 transitions. [2025-03-03 14:18:30,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:30,533 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 977 transitions. [2025-03-03 14:18:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:18:30,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:30,534 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:18:30,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:18:30,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:30,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:30,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1022080991, now seen corresponding path program 1 times [2025-03-03 14:18:30,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:30,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818046604] [2025-03-03 14:18:30,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:30,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:18:30,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:18:30,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:30,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:30,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:30,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818046604] [2025-03-03 14:18:30,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818046604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:30,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:30,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:30,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998841395] [2025-03-03 14:18:30,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:30,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:30,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:30,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:30,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:30,715 INFO L87 Difference]: Start difference. First operand 601 states and 977 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:30,786 INFO L93 Difference]: Finished difference Result 1195 states and 1953 transitions. [2025-03-03 14:18:30,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:30,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2025-03-03 14:18:30,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:30,791 INFO L225 Difference]: With dead ends: 1195 [2025-03-03 14:18:30,791 INFO L226 Difference]: Without dead ends: 595 [2025-03-03 14:18:30,794 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:18:30,795 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 63 mSDsluCounter, 4777 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5744 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:30,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5744 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-03 14:18:30,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-03-03 14:18:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 452 states have (on average 1.6305309734513274) internal successors, (737), 470 states have internal predecessors, (737), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 964 transitions. [2025-03-03 14:18:30,816 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 964 transitions. Word has length 69 [2025-03-03 14:18:30,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:30,816 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 964 transitions. [2025-03-03 14:18:30,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 964 transitions. [2025-03-03 14:18:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:18:30,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:30,817 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:18:30,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:18:30,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:30,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash -651593659, now seen corresponding path program 1 times [2025-03-03 14:18:30,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:30,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298422565] [2025-03-03 14:18:30,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:30,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:18:30,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:18:30,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:30,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:30,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298422565] [2025-03-03 14:18:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298422565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:30,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:30,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:30,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022612379] [2025-03-03 14:18:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:30,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:30,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:30,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:30,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:30,965 INFO L87 Difference]: Start difference. First operand 595 states and 964 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:31,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:31,039 INFO L93 Difference]: Finished difference Result 1183 states and 1927 transitions. [2025-03-03 14:18:31,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:31,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-03-03 14:18:31,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:31,044 INFO L225 Difference]: With dead ends: 1183 [2025-03-03 14:18:31,045 INFO L226 Difference]: Without dead ends: 589 [2025-03-03 14:18:31,047 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:18:31,048 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 49 mSDsluCounter, 4729 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5684 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:31,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5684 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:31,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-03 14:18:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-03-03 14:18:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.6233183856502242) internal successors, (724), 464 states have internal predecessors, (724), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 951 transitions. [2025-03-03 14:18:31,066 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 951 transitions. Word has length 70 [2025-03-03 14:18:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:31,066 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 951 transitions. [2025-03-03 14:18:31,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 951 transitions. [2025-03-03 14:18:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:18:31,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:31,067 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:18:31,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:18:31,068 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:31,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:31,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1674387331, now seen corresponding path program 1 times [2025-03-03 14:18:31,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:31,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295837065] [2025-03-03 14:18:31,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:31,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:31,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:18:31,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:18:31,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:31,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:31,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:31,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295837065] [2025-03-03 14:18:31,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295837065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:31,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:31,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:31,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54484017] [2025-03-03 14:18:31,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:31,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:31,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:31,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:31,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:31,186 INFO L87 Difference]: Start difference. First operand 589 states and 951 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:31,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:31,240 INFO L93 Difference]: Finished difference Result 1171 states and 1901 transitions. [2025-03-03 14:18:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:31,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-03-03 14:18:31,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:31,244 INFO L225 Difference]: With dead ends: 1171 [2025-03-03 14:18:31,244 INFO L226 Difference]: Without dead ends: 589 [2025-03-03 14:18:31,247 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:18:31,247 INFO L435 NwaCegarLoop]: 943 mSDtfsCounter, 24 mSDsluCounter, 4693 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5636 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:31,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5636 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:31,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-03 14:18:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-03-03 14:18:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.6210762331838564) internal successors, (723), 464 states have internal predecessors, (723), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 950 transitions. [2025-03-03 14:18:31,265 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 950 transitions. Word has length 70 [2025-03-03 14:18:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:31,265 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 950 transitions. [2025-03-03 14:18:31,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 950 transitions. [2025-03-03 14:18:31,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 14:18:31,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:31,266 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:18:31,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:18:31,267 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:31,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:31,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1246533381, now seen corresponding path program 1 times [2025-03-03 14:18:31,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:31,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267771534] [2025-03-03 14:18:31,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:31,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:31,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 14:18:31,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 14:18:31,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:31,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:31,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:31,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267771534] [2025-03-03 14:18:31,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267771534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:31,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:31,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:31,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251878409] [2025-03-03 14:18:31,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:31,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:31,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:31,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:31,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:31,345 INFO L87 Difference]: Start difference. First operand 589 states and 950 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:31,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:31,388 INFO L93 Difference]: Finished difference Result 1162 states and 1886 transitions. [2025-03-03 14:18:31,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:31,389 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-03-03 14:18:31,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:31,393 INFO L225 Difference]: With dead ends: 1162 [2025-03-03 14:18:31,393 INFO L226 Difference]: Without dead ends: 589 [2025-03-03 14:18:31,396 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:18:31,396 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 15 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2790 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:31,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2790 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-03 14:18:31,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-03-03 14:18:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.6188340807174888) internal successors, (722), 464 states have internal predecessors, (722), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 949 transitions. [2025-03-03 14:18:31,415 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 949 transitions. Word has length 71 [2025-03-03 14:18:31,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:31,415 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 949 transitions. [2025-03-03 14:18:31,415 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 949 transitions. [2025-03-03 14:18:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 14:18:31,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:31,418 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:18:31,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:18:31,418 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:31,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:31,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1524887693, now seen corresponding path program 1 times [2025-03-03 14:18:31,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:31,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222439383] [2025-03-03 14:18:31,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:31,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:31,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:18:31,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:18:31,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:31,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:31,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:31,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222439383] [2025-03-03 14:18:31,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222439383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:31,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:31,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:31,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828786396] [2025-03-03 14:18:31,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:31,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:31,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:31,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:31,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:31,512 INFO L87 Difference]: Start difference. First operand 589 states and 949 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:31,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:31,551 INFO L93 Difference]: Finished difference Result 1162 states and 1884 transitions. [2025-03-03 14:18:31,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:31,551 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2025-03-03 14:18:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:31,555 INFO L225 Difference]: With dead ends: 1162 [2025-03-03 14:18:31,555 INFO L226 Difference]: Without dead ends: 589 [2025-03-03 14:18:31,558 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:18:31,558 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 14 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:31,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2792 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:31,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-03 14:18:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-03-03 14:18:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.616591928251121) internal successors, (721), 464 states have internal predecessors, (721), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 948 transitions. [2025-03-03 14:18:31,574 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 948 transitions. Word has length 72 [2025-03-03 14:18:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:31,575 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 948 transitions. [2025-03-03 14:18:31,575 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 948 transitions. [2025-03-03 14:18:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 14:18:31,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:31,576 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:18:31,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:18:31,576 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:31,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:31,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1988718782, now seen corresponding path program 1 times [2025-03-03 14:18:31,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:31,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901958172] [2025-03-03 14:18:31,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:31,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:31,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 14:18:31,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 14:18:31,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:31,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:31,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:31,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901958172] [2025-03-03 14:18:31,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901958172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:31,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:31,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:31,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581091694] [2025-03-03 14:18:31,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:31,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:31,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:31,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:31,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:31,642 INFO L87 Difference]: Start difference. First operand 589 states and 948 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:31,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:31,675 INFO L93 Difference]: Finished difference Result 1162 states and 1882 transitions. [2025-03-03 14:18:31,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:31,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-03-03 14:18:31,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:31,679 INFO L225 Difference]: With dead ends: 1162 [2025-03-03 14:18:31,679 INFO L226 Difference]: Without dead ends: 589 [2025-03-03 14:18:31,681 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:18:31,681 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 13 mSDsluCounter, 1857 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2794 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:18:31,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2794 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:31,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-03 14:18:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-03-03 14:18:31,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.6143497757847534) internal successors, (720), 464 states have internal predecessors, (720), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 947 transitions. [2025-03-03 14:18:31,696 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 947 transitions. Word has length 73 [2025-03-03 14:18:31,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:31,696 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 947 transitions. [2025-03-03 14:18:31,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:31,696 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 947 transitions. [2025-03-03 14:18:31,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:18:31,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:31,697 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:18:31,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:18:31,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:31,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:31,698 INFO L85 PathProgramCache]: Analyzing trace with hash -363262928, now seen corresponding path program 1 times [2025-03-03 14:18:31,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:31,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270919612] [2025-03-03 14:18:31,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:31,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:31,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:18:31,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:18:31,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:31,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:31,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:31,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270919612] [2025-03-03 14:18:31,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270919612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:31,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:31,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:31,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225622439] [2025-03-03 14:18:31,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:31,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:31,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:31,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:31,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:31,767 INFO L87 Difference]: Start difference. First operand 589 states and 947 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:31,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:31,807 INFO L93 Difference]: Finished difference Result 1162 states and 1880 transitions. [2025-03-03 14:18:31,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:31,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-03 14:18:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:31,812 INFO L225 Difference]: With dead ends: 1162 [2025-03-03 14:18:31,813 INFO L226 Difference]: Without dead ends: 589 [2025-03-03 14:18:31,815 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:18:31,815 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 12 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:31,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2796 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-03 14:18:31,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-03-03 14:18:31,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.6121076233183858) internal successors, (719), 464 states have internal predecessors, (719), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:18:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 946 transitions. [2025-03-03 14:18:31,833 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 946 transitions. Word has length 74 [2025-03-03 14:18:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:31,833 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 946 transitions. [2025-03-03 14:18:31,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:18:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 946 transitions. [2025-03-03 14:18:31,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 14:18:31,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:31,834 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:18:31,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:18:31,835 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:31,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:31,835 INFO L85 PathProgramCache]: Analyzing trace with hash 188871809, now seen corresponding path program 1 times [2025-03-03 14:18:31,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:31,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331784805] [2025-03-03 14:18:31,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:31,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:31,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:18:31,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:18:31,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:31,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:18:31,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:31,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331784805] [2025-03-03 14:18:31,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331784805] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:18:31,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515470400] [2025-03-03 14:18:31,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:31,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:31,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:31,979 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:18:31,980 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:18:32,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:18:32,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:18:32,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:32,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:32,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:18:32,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:18:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:32,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:18:32,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515470400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:32,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:18:32,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:18:32,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215708833] [2025-03-03 14:18:32,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:32,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:18:32,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:32,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:18:32,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:32,280 INFO L87 Difference]: Start difference. First operand 589 states and 946 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:32,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:32,333 INFO L93 Difference]: Finished difference Result 1678 states and 2726 transitions. [2025-03-03 14:18:32,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:18:32,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2025-03-03 14:18:32,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:32,341 INFO L225 Difference]: With dead ends: 1678 [2025-03-03 14:18:32,342 INFO L226 Difference]: Without dead ends: 1107 [2025-03-03 14:18:32,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:32,344 INFO L435 NwaCegarLoop]: 1611 mSDtfsCounter, 907 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 2452 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:32,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 2452 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-03-03 14:18:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1092. [2025-03-03 14:18:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 834 states have (on average 1.6235011990407673) internal successors, (1354), 869 states have internal predecessors, (1354), 205 states have call successors, (205), 53 states have call predecessors, (205), 52 states have return successors, (207), 197 states have call predecessors, (207), 202 states have call successors, (207) [2025-03-03 14:18:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1766 transitions. [2025-03-03 14:18:32,380 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1766 transitions. Word has length 75 [2025-03-03 14:18:32,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:32,381 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1766 transitions. [2025-03-03 14:18:32,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:32,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1766 transitions. [2025-03-03 14:18:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:18:32,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:32,382 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:18:32,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:18:32,586 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,SelfDestructingSolverStorable10 [2025-03-03 14:18:32,586 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:32,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1553745434, now seen corresponding path program 1 times [2025-03-03 14:18:32,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:32,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536910148] [2025-03-03 14:18:32,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:32,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:32,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:18:32,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:18:32,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:32,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:18:32,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:32,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536910148] [2025-03-03 14:18:32,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536910148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:18:32,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607545131] [2025-03-03 14:18:32,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:32,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:32,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:32,711 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:18:32,712 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:18:32,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:18:32,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:18:32,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:32,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:32,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:18:32,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:18:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:33,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:18:33,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607545131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:33,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:18:33,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:18:33,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816378424] [2025-03-03 14:18:33,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:33,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:18:33,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:33,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:18:33,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:33,044 INFO L87 Difference]: Start difference. First operand 1092 states and 1766 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:33,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:33,128 INFO L93 Difference]: Finished difference Result 2684 states and 4368 transitions. [2025-03-03 14:18:33,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:18:33,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2025-03-03 14:18:33,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:33,140 INFO L225 Difference]: With dead ends: 2684 [2025-03-03 14:18:33,140 INFO L226 Difference]: Without dead ends: 1610 [2025-03-03 14:18:33,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:33,146 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 905 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 2514 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:33,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 2514 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2025-03-03 14:18:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1562. [2025-03-03 14:18:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1195 states have (on average 1.6343096234309624) internal successors, (1953), 1247 states have internal predecessors, (1953), 292 states have call successors, (292), 74 states have call predecessors, (292), 74 states have return successors, (299), 282 states have call predecessors, (299), 289 states have call successors, (299) [2025-03-03 14:18:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2544 transitions. [2025-03-03 14:18:33,212 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2544 transitions. Word has length 76 [2025-03-03 14:18:33,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:33,213 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 2544 transitions. [2025-03-03 14:18:33,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:18:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2544 transitions. [2025-03-03 14:18:33,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 14:18:33,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:33,215 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:18:33,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:18:33,419 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,SelfDestructingSolverStorable11 [2025-03-03 14:18:33,419 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:33,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:33,420 INFO L85 PathProgramCache]: Analyzing trace with hash 810804980, now seen corresponding path program 1 times [2025-03-03 14:18:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:33,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698626724] [2025-03-03 14:18:33,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:33,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 14:18:33,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 14:18:33,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:33,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:33,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:33,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698626724] [2025-03-03 14:18:33,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698626724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:33,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:33,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:33,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143000912] [2025-03-03 14:18:33,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:33,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:33,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:33,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:33,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:33,527 INFO L87 Difference]: Start difference. First operand 1562 states and 2544 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:34,069 INFO L93 Difference]: Finished difference Result 4610 states and 7681 transitions. [2025-03-03 14:18:34,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:34,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2025-03-03 14:18:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:34,086 INFO L225 Difference]: With dead ends: 4610 [2025-03-03 14:18:34,087 INFO L226 Difference]: Without dead ends: 3066 [2025-03-03 14:18:34,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:18:34,094 INFO L435 NwaCegarLoop]: 1079 mSDtfsCounter, 941 mSDsluCounter, 3863 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 4942 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:34,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 4942 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:18:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2025-03-03 14:18:34,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 3019. [2025-03-03 14:18:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 2311 states have (on average 1.6339247079186499) internal successors, (3776), 2411 states have internal predecessors, (3776), 563 states have call successors, (563), 142 states have call predecessors, (563), 144 states have return successors, (679), 549 states have call predecessors, (679), 559 states have call successors, (679) [2025-03-03 14:18:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 5018 transitions. [2025-03-03 14:18:34,226 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 5018 transitions. Word has length 78 [2025-03-03 14:18:34,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:34,226 INFO L471 AbstractCegarLoop]: Abstraction has 3019 states and 5018 transitions. [2025-03-03 14:18:34,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 5018 transitions. [2025-03-03 14:18:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:18:34,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:34,227 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:18:34,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:18:34,228 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:34,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:34,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1750443354, now seen corresponding path program 1 times [2025-03-03 14:18:34,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:34,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896079841] [2025-03-03 14:18:34,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:34,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:34,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:18:34,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:18:34,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:34,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:18:34,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:34,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896079841] [2025-03-03 14:18:34,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896079841] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:18:34,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268611101] [2025-03-03 14:18:34,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:34,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:34,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:34,356 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:18:34,359 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:18:34,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:18:34,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:18:34,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:34,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:34,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:18:34,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:18:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:34,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:18:34,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268611101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:34,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:18:34,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-03 14:18:34,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746286402] [2025-03-03 14:18:34,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:34,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:34,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:34,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:34,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:18:34,710 INFO L87 Difference]: Start difference. First operand 3019 states and 5018 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:18:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:35,426 INFO L93 Difference]: Finished difference Result 8192 states and 13882 transitions. [2025-03-03 14:18:35,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:35,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 79 [2025-03-03 14:18:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:35,464 INFO L225 Difference]: With dead ends: 8192 [2025-03-03 14:18:35,465 INFO L226 Difference]: Without dead ends: 5191 [2025-03-03 14:18:35,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:18:35,486 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 805 mSDsluCounter, 3513 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 4484 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:35,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 4484 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:18:35,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5191 states. [2025-03-03 14:18:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5191 to 5148. [2025-03-03 14:18:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5148 states, 3934 states have (on average 1.5882053889171326) internal successors, (6248), 4100 states have internal predecessors, (6248), 950 states have call successors, (950), 256 states have call predecessors, (950), 263 states have return successors, (1283), 931 states have call predecessors, (1283), 944 states have call successors, (1283) [2025-03-03 14:18:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 8481 transitions. [2025-03-03 14:18:35,739 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 8481 transitions. Word has length 79 [2025-03-03 14:18:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:35,739 INFO L471 AbstractCegarLoop]: Abstraction has 5148 states and 8481 transitions. [2025-03-03 14:18:35,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:18:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 8481 transitions. [2025-03-03 14:18:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:18:35,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:35,740 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:18:35,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:18:35,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:35,941 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:35,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:35,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1702049862, now seen corresponding path program 1 times [2025-03-03 14:18:35,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:35,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364164947] [2025-03-03 14:18:35,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:35,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:35,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:18:35,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:18:35,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:35,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:18:36,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:36,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364164947] [2025-03-03 14:18:36,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364164947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:36,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:36,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:36,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558820376] [2025-03-03 14:18:36,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:36,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:36,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:36,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:36,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:36,003 INFO L87 Difference]: Start difference. First operand 5148 states and 8481 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:36,186 INFO L93 Difference]: Finished difference Result 10302 states and 17137 transitions. [2025-03-03 14:18:36,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:36,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2025-03-03 14:18:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:36,221 INFO L225 Difference]: With dead ends: 10302 [2025-03-03 14:18:36,221 INFO L226 Difference]: Without dead ends: 5172 [2025-03-03 14:18:36,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:18:36,242 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 12 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2760 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:36,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2760 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:36,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2025-03-03 14:18:36,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 5156. [2025-03-03 14:18:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5156 states, 3940 states have (on average 1.5868020304568529) internal successors, (6252), 4106 states have internal predecessors, (6252), 950 states have call successors, (950), 260 states have call predecessors, (950), 265 states have return successors, (1272), 929 states have call predecessors, (1272), 944 states have call successors, (1272) [2025-03-03 14:18:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5156 states to 5156 states and 8474 transitions. [2025-03-03 14:18:36,505 INFO L78 Accepts]: Start accepts. Automaton has 5156 states and 8474 transitions. Word has length 79 [2025-03-03 14:18:36,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:36,506 INFO L471 AbstractCegarLoop]: Abstraction has 5156 states and 8474 transitions. [2025-03-03 14:18:36,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 5156 states and 8474 transitions. [2025-03-03 14:18:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 14:18:36,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:36,507 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:36,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:18:36,507 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:36,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:36,508 INFO L85 PathProgramCache]: Analyzing trace with hash 794423674, now seen corresponding path program 1 times [2025-03-03 14:18:36,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:36,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858167676] [2025-03-03 14:18:36,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:36,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:36,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:18:36,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:18:36,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:36,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:18:36,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:36,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858167676] [2025-03-03 14:18:36,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858167676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:36,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:36,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:36,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45037591] [2025-03-03 14:18:36,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:36,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:36,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:36,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:36,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:36,657 INFO L87 Difference]: Start difference. First operand 5156 states and 8474 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:18:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:37,337 INFO L93 Difference]: Finished difference Result 15401 states and 26333 transitions. [2025-03-03 14:18:37,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:37,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-03-03 14:18:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:37,417 INFO L225 Difference]: With dead ends: 15401 [2025-03-03 14:18:37,417 INFO L226 Difference]: Without dead ends: 10263 [2025-03-03 14:18:37,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:18:37,443 INFO L435 NwaCegarLoop]: 1015 mSDtfsCounter, 938 mSDsluCounter, 3683 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 4698 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:37,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 4698 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:18:37,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10263 states. [2025-03-03 14:18:37,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10263 to 10194. [2025-03-03 14:18:37,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10194 states, 7792 states have (on average 1.582777207392197) internal successors, (12333), 8118 states have internal predecessors, (12333), 1872 states have call successors, (1872), 514 states have call predecessors, (1872), 529 states have return successors, (3066), 1841 states have call predecessors, (3066), 1862 states have call successors, (3066) [2025-03-03 14:18:37,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10194 states to 10194 states and 17271 transitions. [2025-03-03 14:18:37,930 INFO L78 Accepts]: Start accepts. Automaton has 10194 states and 17271 transitions. Word has length 87 [2025-03-03 14:18:37,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:37,931 INFO L471 AbstractCegarLoop]: Abstraction has 10194 states and 17271 transitions. [2025-03-03 14:18:37,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:18:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 10194 states and 17271 transitions. [2025-03-03 14:18:37,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 14:18:37,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:37,933 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:37,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:18:37,933 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:37,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:37,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1059686405, now seen corresponding path program 1 times [2025-03-03 14:18:37,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:37,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95132297] [2025-03-03 14:18:37,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:37,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:37,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 14:18:37,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 14:18:37,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:37,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:18:38,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:38,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95132297] [2025-03-03 14:18:38,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95132297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:38,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:38,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:38,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406012913] [2025-03-03 14:18:38,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:38,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:38,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:38,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:38,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:38,008 INFO L87 Difference]: Start difference. First operand 10194 states and 17271 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:18:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:38,421 INFO L93 Difference]: Finished difference Result 20442 states and 35115 transitions. [2025-03-03 14:18:38,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:38,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2025-03-03 14:18:38,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:38,484 INFO L225 Difference]: With dead ends: 20442 [2025-03-03 14:18:38,484 INFO L226 Difference]: Without dead ends: 10266 [2025-03-03 14:18:38,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:18:38,521 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 12 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:38,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2751 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:38,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10266 states. [2025-03-03 14:18:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10266 to 10234. [2025-03-03 14:18:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10234 states, 7828 states have (on average 1.5806080735820134) internal successors, (12373), 8146 states have internal predecessors, (12373), 1872 states have call successors, (1872), 530 states have call predecessors, (1872), 533 states have return successors, (3050), 1837 states have call predecessors, (3050), 1862 states have call successors, (3050) [2025-03-03 14:18:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10234 states to 10234 states and 17295 transitions. [2025-03-03 14:18:38,934 INFO L78 Accepts]: Start accepts. Automaton has 10234 states and 17295 transitions. Word has length 88 [2025-03-03 14:18:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:38,934 INFO L471 AbstractCegarLoop]: Abstraction has 10234 states and 17295 transitions. [2025-03-03 14:18:38,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:18:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 10234 states and 17295 transitions. [2025-03-03 14:18:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 14:18:38,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:38,936 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:38,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:18:38,937 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:38,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:38,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1977863271, now seen corresponding path program 1 times [2025-03-03 14:18:38,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:38,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127900156] [2025-03-03 14:18:38,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:38,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:38,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 14:18:38,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 14:18:38,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:38,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:39,082 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:18:39,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:39,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127900156] [2025-03-03 14:18:39,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127900156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:39,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:39,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:39,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017679871] [2025-03-03 14:18:39,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:39,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:39,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:39,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:39,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:39,084 INFO L87 Difference]: Start difference. First operand 10234 states and 17295 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:18:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:40,219 INFO L93 Difference]: Finished difference Result 30713 states and 54978 transitions. [2025-03-03 14:18:40,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:40,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2025-03-03 14:18:40,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:40,373 INFO L225 Difference]: With dead ends: 30713 [2025-03-03 14:18:40,373 INFO L226 Difference]: Without dead ends: 20497 [2025-03-03 14:18:40,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:18:40,542 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 934 mSDsluCounter, 3769 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 4809 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:40,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 4809 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:18:40,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20497 states. [2025-03-03 14:18:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20497 to 20396. [2025-03-03 14:18:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20396 states, 15604 states have (on average 1.5772237887721097) internal successors, (24611), 16234 states have internal predecessors, (24611), 3722 states have call successors, (3722), 1054 states have call predecessors, (3722), 1069 states have return successors, (7782), 3667 states have call predecessors, (7782), 3704 states have call successors, (7782) [2025-03-03 14:18:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20396 states to 20396 states and 36115 transitions. [2025-03-03 14:18:41,355 INFO L78 Accepts]: Start accepts. Automaton has 20396 states and 36115 transitions. Word has length 97 [2025-03-03 14:18:41,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:41,355 INFO L471 AbstractCegarLoop]: Abstraction has 20396 states and 36115 transitions. [2025-03-03 14:18:41,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:18:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 20396 states and 36115 transitions. [2025-03-03 14:18:41,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 14:18:41,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:41,357 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:41,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:18:41,357 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:41,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1877580619, now seen corresponding path program 1 times [2025-03-03 14:18:41,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:41,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574672320] [2025-03-03 14:18:41,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:41,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:41,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 14:18:41,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 14:18:41,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:41,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:18:41,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:41,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574672320] [2025-03-03 14:18:41,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574672320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:41,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:41,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:41,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869279715] [2025-03-03 14:18:41,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:41,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:41,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:41,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:41,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:41,435 INFO L87 Difference]: Start difference. First operand 20396 states and 36115 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:18:42,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:42,110 INFO L93 Difference]: Finished difference Result 40918 states and 74065 transitions. [2025-03-03 14:18:42,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:42,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-03-03 14:18:42,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:42,350 INFO L225 Difference]: With dead ends: 40918 [2025-03-03 14:18:42,350 INFO L226 Difference]: Without dead ends: 20540 [2025-03-03 14:18:42,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:18:42,435 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 11 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:42,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2751 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:42,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20540 states. [2025-03-03 14:18:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20540 to 20476. [2025-03-03 14:18:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20476 states, 15676 states have (on average 1.5750829293187039) internal successors, (24691), 16306 states have internal predecessors, (24691), 3722 states have call successors, (3722), 1070 states have call predecessors, (3722), 1077 states have return successors, (7762), 3659 states have call predecessors, (7762), 3704 states have call successors, (7762) [2025-03-03 14:18:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20476 states to 20476 states and 36175 transitions. [2025-03-03 14:18:43,244 INFO L78 Accepts]: Start accepts. Automaton has 20476 states and 36175 transitions. Word has length 98 [2025-03-03 14:18:43,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:43,244 INFO L471 AbstractCegarLoop]: Abstraction has 20476 states and 36175 transitions. [2025-03-03 14:18:43,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:18:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 20476 states and 36175 transitions. [2025-03-03 14:18:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:18:43,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:43,246 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:43,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:18:43,247 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:43,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:43,248 INFO L85 PathProgramCache]: Analyzing trace with hash 709823494, now seen corresponding path program 1 times [2025-03-03 14:18:43,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:43,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524204167] [2025-03-03 14:18:43,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:43,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:43,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:18:43,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:18:43,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:43,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:18:43,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:43,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524204167] [2025-03-03 14:18:43,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524204167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:43,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:43,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:43,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026235652] [2025-03-03 14:18:43,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:43,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:43,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:43,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:43,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:43,390 INFO L87 Difference]: Start difference. First operand 20476 states and 36175 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:18:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:45,387 INFO L93 Difference]: Finished difference Result 61565 states and 118979 transitions. [2025-03-03 14:18:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:45,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-03-03 14:18:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:45,758 INFO L225 Difference]: With dead ends: 61565 [2025-03-03 14:18:45,758 INFO L226 Difference]: Without dead ends: 41107 [2025-03-03 14:18:45,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:18:45,912 INFO L435 NwaCegarLoop]: 1050 mSDtfsCounter, 930 mSDsluCounter, 3810 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 4860 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:45,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 4860 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:18:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41107 states. [2025-03-03 14:18:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41107 to 40942. [2025-03-03 14:18:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40942 states, 31348 states have (on average 1.5727000127599846) internal successors, (49301), 32602 states have internal predecessors, (49301), 7428 states have call successors, (7428), 2134 states have call predecessors, (7428), 2165 states have return successors, (21230), 7325 states have call predecessors, (21230), 7394 states have call successors, (21230) [2025-03-03 14:18:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40942 states to 40942 states and 77959 transitions. [2025-03-03 14:18:47,689 INFO L78 Accepts]: Start accepts. Automaton has 40942 states and 77959 transitions. Word has length 108 [2025-03-03 14:18:47,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:47,690 INFO L471 AbstractCegarLoop]: Abstraction has 40942 states and 77959 transitions. [2025-03-03 14:18:47,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:18:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 40942 states and 77959 transitions. [2025-03-03 14:18:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:18:47,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:47,691 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:47,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:18:47,692 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:47,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:47,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1381924099, now seen corresponding path program 1 times [2025-03-03 14:18:47,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:47,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466782583] [2025-03-03 14:18:47,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:47,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:47,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:18:47,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:18:47,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:47,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:18:47,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:47,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466782583] [2025-03-03 14:18:47,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466782583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:47,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:47,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:47,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692014600] [2025-03-03 14:18:47,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:47,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:47,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:47,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:47,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:47,753 INFO L87 Difference]: Start difference. First operand 40942 states and 77959 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:18:49,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:49,818 INFO L93 Difference]: Finished difference Result 82186 states and 162223 transitions. [2025-03-03 14:18:49,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:49,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-03-03 14:18:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:50,140 INFO L225 Difference]: With dead ends: 82186 [2025-03-03 14:18:50,140 INFO L226 Difference]: Without dead ends: 41262 [2025-03-03 14:18:50,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:18:50,411 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 10 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:50,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2751 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41262 states. [2025-03-03 14:18:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41262 to 41134. [2025-03-03 14:18:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41134 states, 31524 states have (on average 1.5700101509960664) internal successors, (49493), 32778 states have internal predecessors, (49493), 7428 states have call successors, (7428), 2166 states have call predecessors, (7428), 2181 states have return successors, (21214), 7309 states have call predecessors, (21214), 7394 states have call successors, (21214) [2025-03-03 14:18:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41134 states to 41134 states and 78135 transitions. [2025-03-03 14:18:52,212 INFO L78 Accepts]: Start accepts. Automaton has 41134 states and 78135 transitions. Word has length 109 [2025-03-03 14:18:52,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:52,213 INFO L471 AbstractCegarLoop]: Abstraction has 41134 states and 78135 transitions. [2025-03-03 14:18:52,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:18:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand 41134 states and 78135 transitions. [2025-03-03 14:18:52,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 14:18:52,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:52,216 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:52,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:18:52,216 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:52,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:52,216 INFO L85 PathProgramCache]: Analyzing trace with hash -542955038, now seen corresponding path program 1 times [2025-03-03 14:18:52,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:52,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339414232] [2025-03-03 14:18:52,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:52,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:52,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:18:52,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:18:52,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:52,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 14:18:52,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:52,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339414232] [2025-03-03 14:18:52,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339414232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:18:52,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731296081] [2025-03-03 14:18:52,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:52,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:52,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:52,366 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:18:52,368 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:18:52,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:18:52,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:18:52,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:52,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:52,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1876 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:18:52,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:18:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 14:18:52,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:18:52,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731296081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:52,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:18:52,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-03 14:18:52,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081755135] [2025-03-03 14:18:52,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:52,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:18:52,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:52,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:18:52,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:18:52,810 INFO L87 Difference]: Start difference. First operand 41134 states and 78135 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-03 14:19:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:00,161 INFO L93 Difference]: Finished difference Result 146637 states and 302827 transitions. [2025-03-03 14:19:00,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:19:00,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 148 [2025-03-03 14:19:00,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:01,301 INFO L225 Difference]: With dead ends: 146637 [2025-03-03 14:19:01,301 INFO L226 Difference]: Without dead ends: 105521 [2025-03-03 14:19:01,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:19:01,608 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 2725 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 7152 mSolverCounterSat, 562 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2917 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 7714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 562 IncrementalHoareTripleChecker+Valid, 7152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:01,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2917 Valid, 2588 Invalid, 7714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [562 Valid, 7152 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 14:19:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105521 states. [2025-03-03 14:19:05,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105521 to 104248. [2025-03-03 14:19:05,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104248 states, 80010 states have (on average 1.5643669541307337) internal successors, (125165), 83048 states have internal predecessors, (125165), 18568 states have call successors, (18568), 5382 states have call predecessors, (18568), 5669 states have return successors, (65620), 18553 states have call predecessors, (65620), 18502 states have call successors, (65620) [2025-03-03 14:19:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104248 states to 104248 states and 209353 transitions. [2025-03-03 14:19:07,276 INFO L78 Accepts]: Start accepts. Automaton has 104248 states and 209353 transitions. Word has length 148 [2025-03-03 14:19:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:07,277 INFO L471 AbstractCegarLoop]: Abstraction has 104248 states and 209353 transitions. [2025-03-03 14:19:07,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-03 14:19:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 104248 states and 209353 transitions. [2025-03-03 14:19:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:19:07,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:07,278 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:07,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:19:07,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:07,479 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:07,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:07,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1763280547, now seen corresponding path program 1 times [2025-03-03 14:19:07,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:07,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895647600] [2025-03-03 14:19:07,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:07,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:07,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:19:07,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:19:07,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:07,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:07,678 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 14:19:07,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:07,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895647600] [2025-03-03 14:19:07,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895647600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:07,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:07,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:07,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878170527] [2025-03-03 14:19:07,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:07,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:07,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:07,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:07,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:07,680 INFO L87 Difference]: Start difference. First operand 104248 states and 209353 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:19:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:13,783 INFO L93 Difference]: Finished difference Result 212126 states and 429999 transitions. [2025-03-03 14:19:13,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:19:13,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 120 [2025-03-03 14:19:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:14,879 INFO L225 Difference]: With dead ends: 212126 [2025-03-03 14:19:14,879 INFO L226 Difference]: Without dead ends: 107848 [2025-03-03 14:19:15,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:15,716 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 778 mSDsluCounter, 3530 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 4496 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:15,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 4496 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:19:15,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107848 states.