./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product11.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 8e809cb7921b0f8738511433928ba20d09f78a0d0fe23412d97e6052fa9e13ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:15:46,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:15:46,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:15:46,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:15:46,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:15:46,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:15:46,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:15:46,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:15:46,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:15:46,230 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:15:46,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:15:46,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:15:46,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:15:46,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:15:46,231 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:15:46,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:15:46,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:15:46,232 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:15:46,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:15:46,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:15:46,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:15:46,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:15:46,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:15:46,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:15:46,232 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:15:46,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:15:46,233 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:15:46,233 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:15:46,233 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:15:46,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:15:46,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:15:46,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:15:46,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:15:46,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:15:46,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:15:46,234 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:15:46,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:15:46,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:15:46,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:15:46,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:15:46,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:15:46,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:15:46,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:15:46,234 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 -> 8e809cb7921b0f8738511433928ba20d09f78a0d0fe23412d97e6052fa9e13ec [2025-03-03 14:15:46,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:15:46,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:15:46,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:15:46,473 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:15:46,473 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:15:46,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product11.cil.c [2025-03-03 14:15:47,601 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c52a538f/f1b753c5226b4ca2a52c3239f6d388db/FLAG26da445a7 [2025-03-03 14:15:47,895 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:15:47,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product11.cil.c [2025-03-03 14:15:47,912 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c52a538f/f1b753c5226b4ca2a52c3239f6d388db/FLAG26da445a7 [2025-03-03 14:15:47,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c52a538f/f1b753c5226b4ca2a52c3239f6d388db [2025-03-03 14:15:47,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:15:47,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:15:47,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:15:47,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:15:47,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:15:47,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:15:47" (1/1) ... [2025-03-03 14:15:47,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ef471a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:47, skipping insertion in model container [2025-03-03 14:15:47,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:15:47" (1/1) ... [2025-03-03 14:15:47,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:15:48,087 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product11.cil.c[1545,1558] [2025-03-03 14:15:48,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:15:48,326 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:15:48,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-03-03 14:15:48,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [57] [2025-03-03 14:15:48,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [421] [2025-03-03 14:15:48,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [541] [2025-03-03 14:15:48,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [907] [2025-03-03 14:15:48,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2442] [2025-03-03 14:15:48,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2533] [2025-03-03 14:15:48,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2714] [2025-03-03 14:15:48,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3375] [2025-03-03 14:15:48,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3387] [2025-03-03 14:15:48,342 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product11.cil.c[1545,1558] [2025-03-03 14:15:48,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:15:48,454 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:15:48,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:48 WrapperNode [2025-03-03 14:15:48,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:15:48,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:15:48,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:15:48,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:15:48,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:48" (1/1) ... [2025-03-03 14:15:48,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:48" (1/1) ... [2025-03-03 14:15:48,506 INFO L138 Inliner]: procedures = 93, calls = 338, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 1125 [2025-03-03 14:15:48,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:15:48,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:15:48,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:15:48,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:15:48,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:48" (1/1) ... [2025-03-03 14:15:48,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:48" (1/1) ... [2025-03-03 14:15:48,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:48" (1/1) ... [2025-03-03 14:15:48,541 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:15:48,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:48" (1/1) ... [2025-03-03 14:15:48,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:48" (1/1) ... [2025-03-03 14:15:48,555 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:48" (1/1) ... [2025-03-03 14:15:48,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:48" (1/1) ... [2025-03-03 14:15:48,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:48" (1/1) ... [2025-03-03 14:15:48,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:48" (1/1) ... [2025-03-03 14:15:48,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:15:48,573 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:15:48,573 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:15:48,573 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:15:48,574 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:48" (1/1) ... [2025-03-03 14:15:48,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:15:48,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:15:48,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:15:48,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:15:48,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:15:48,619 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:15:48,619 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:15:48,619 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:15:48,619 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:15:48,619 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-03 14:15:48,619 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-03 14:15:48,619 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:15:48,620 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:15:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:15:48,620 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:15:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:15:48,620 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:15:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:15:48,621 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:15:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-03 14:15:48,621 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-03 14:15:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:15:48,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:15:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:15:48,622 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:15:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:15:48,623 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:15:48,623 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-03 14:15:48,623 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:15:48,623 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-03-03 14:15:48,623 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:15:48,623 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:15:48,623 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:15:48,623 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:15:48,623 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:15:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:15:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:15:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:15:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:15:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:15:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:15:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:15:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:15:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:15:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:15:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:15:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:15:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:15:48,779 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:15:48,782 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:15:48,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L538: #res := ~retValue_acc~4; [2025-03-03 14:15:48,826 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: #res := ~retValue_acc~8; [2025-03-03 14:15:48,836 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1145: #res := ~retValue_acc~9; [2025-03-03 14:15:48,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1801: #res#1 := ~retValue_acc~19#1; [2025-03-03 14:15:48,897 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1188-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~11#1; [2025-03-03 14:15:48,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2430: #res := ~retValue_acc~23; [2025-03-03 14:15:49,156 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1682-1: stopRequestedInDirection__wrappee__empty_#res#1 := stopRequestedInDirection__wrappee__empty_~retValue_acc~16#1; [2025-03-03 14:15:49,156 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1711: #res#1 := ~retValue_acc~17#1; [2025-03-03 14:15:49,203 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1846: #res := ~retValue_acc~21; [2025-03-03 14:15:49,214 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L499: #res := ~retValue_acc~3; [2025-03-03 14:15:49,273 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1237-1: isEmpty_#res#1 := isEmpty_~retValue_acc~13#1; [2025-03-03 14:15:49,327 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1317-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~14#1; [2025-03-03 14:15:49,327 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1330-1: isIdle_#res#1 := isIdle_~retValue_acc~15#1; [2025-03-03 14:15:49,470 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1832-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~20#1; [2025-03-03 14:15:49,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3061: #res := ~retValue_acc~26; [2025-03-03 14:15:49,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3419-1: valid_product_#res#1 := valid_product_~retValue_acc~29#1; [2025-03-03 14:15:49,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L418-1: main_#res#1 := main_~retValue_acc~1#1; [2025-03-03 14:15:49,587 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2825: #res := ~retValue_acc~25; [2025-03-03 14:15:49,589 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1154: #res := ~retValue_acc~10; [2025-03-03 14:15:49,592 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3372: #res := ~retValue_acc~27; [2025-03-03 14:15:49,678 INFO L? ?]: Removed 443 outVars from TransFormulas that were not future-live. [2025-03-03 14:15:49,678 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:15:49,698 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:15:49,698 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:15:49,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:15:49 BoogieIcfgContainer [2025-03-03 14:15:49,698 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:15:49,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:15:49,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:15:49,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:15:49,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:15:47" (1/3) ... [2025-03-03 14:15:49,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94e9250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:15:49, skipping insertion in model container [2025-03-03 14:15:49,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:48" (2/3) ... [2025-03-03 14:15:49,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94e9250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:15:49, skipping insertion in model container [2025-03-03 14:15:49,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:15:49" (3/3) ... [2025-03-03 14:15:49,708 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product11.cil.c [2025-03-03 14:15:49,720 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:15:49,723 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product11.cil.c that has 24 procedures, 553 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:15:49,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:15:49,783 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;@54f3b468, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:15:49,784 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:15:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 553 states, 434 states have (on average 1.695852534562212) internal successors, (736), 455 states have internal predecessors, (736), 94 states have call successors, (94), 23 states have call predecessors, (94), 23 states have return successors, (94), 88 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 14:15:49,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:15:49,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:49,812 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:49,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:49,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:49,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1046708872, now seen corresponding path program 1 times [2025-03-03 14:15:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:49,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484226605] [2025-03-03 14:15:49,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:49,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:49,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:15:49,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:15:49,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:49,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:50,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:50,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484226605] [2025-03-03 14:15:50,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484226605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:50,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:50,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:50,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593523335] [2025-03-03 14:15:50,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:50,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:50,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:50,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:50,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:50,302 INFO L87 Difference]: Start difference. First operand has 553 states, 434 states have (on average 1.695852534562212) internal successors, (736), 455 states have internal predecessors, (736), 94 states have call successors, (94), 23 states have call predecessors, (94), 23 states have return successors, (94), 88 states have call predecessors, (94), 94 states have call successors, (94) Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:50,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:50,420 INFO L93 Difference]: Finished difference Result 1086 states and 1823 transitions. [2025-03-03 14:15:50,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:50,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2025-03-03 14:15:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:50,435 INFO L225 Difference]: With dead ends: 1086 [2025-03-03 14:15:50,435 INFO L226 Difference]: Without dead ends: 545 [2025-03-03 14:15:50,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:50,446 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 5 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:50,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2708 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:50,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-03 14:15:50,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-03 14:15:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.6939252336448598) internal successors, (725), 447 states have internal predecessors, (725), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 14:15:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 908 transitions. [2025-03-03 14:15:50,511 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 908 transitions. Word has length 102 [2025-03-03 14:15:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:50,512 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 908 transitions. [2025-03-03 14:15:50,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 908 transitions. [2025-03-03 14:15:50,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:15:50,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:50,517 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:50,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:15:50,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:50,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:50,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1362502316, now seen corresponding path program 1 times [2025-03-03 14:15:50,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:50,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682788822] [2025-03-03 14:15:50,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:50,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:50,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:15:50,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:15:50,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:50,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:50,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:50,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682788822] [2025-03-03 14:15:50,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682788822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:50,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:50,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:50,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099426082] [2025-03-03 14:15:50,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:50,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:50,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:50,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:50,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:50,676 INFO L87 Difference]: Start difference. First operand 545 states and 908 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), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:50,736 INFO L93 Difference]: Finished difference Result 1072 states and 1793 transitions. [2025-03-03 14:15:50,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:50,737 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), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-03-03 14:15:50,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:50,756 INFO L225 Difference]: With dead ends: 1072 [2025-03-03 14:15:50,756 INFO L226 Difference]: Without dead ends: 545 [2025-03-03 14:15:50,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:50,761 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 4 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:50,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2687 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:50,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-03 14:15:50,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-03 14:15:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.691588785046729) internal successors, (724), 447 states have internal predecessors, (724), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 14:15:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 907 transitions. [2025-03-03 14:15:50,791 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 907 transitions. Word has length 105 [2025-03-03 14:15:50,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:50,792 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 907 transitions. [2025-03-03 14:15:50,792 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), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 907 transitions. [2025-03-03 14:15:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 14:15:50,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:50,796 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:50,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:15:50,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:50,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:50,798 INFO L85 PathProgramCache]: Analyzing trace with hash -530323998, now seen corresponding path program 1 times [2025-03-03 14:15:50,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:50,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945705429] [2025-03-03 14:15:50,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:50,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:50,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 14:15:50,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 14:15:50,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:50,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:50,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:50,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945705429] [2025-03-03 14:15:50,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945705429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:50,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:50,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:50,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122666409] [2025-03-03 14:15:50,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:50,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:50,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:50,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:50,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:50,937 INFO L87 Difference]: Start difference. First operand 545 states and 907 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:50,986 INFO L93 Difference]: Finished difference Result 1072 states and 1792 transitions. [2025-03-03 14:15:50,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:50,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2025-03-03 14:15:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:50,992 INFO L225 Difference]: With dead ends: 1072 [2025-03-03 14:15:50,992 INFO L226 Difference]: Without dead ends: 545 [2025-03-03 14:15:50,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:50,995 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 3 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2687 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:15:50,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2687 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:50,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-03 14:15:51,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-03 14:15:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.689252336448598) internal successors, (723), 447 states have internal predecessors, (723), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 14:15:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 906 transitions. [2025-03-03 14:15:51,018 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 906 transitions. Word has length 106 [2025-03-03 14:15:51,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:51,019 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 906 transitions. [2025-03-03 14:15:51,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 906 transitions. [2025-03-03 14:15:51,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 14:15:51,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:51,022 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:51,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:15:51,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:51,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:51,023 INFO L85 PathProgramCache]: Analyzing trace with hash 366658929, now seen corresponding path program 1 times [2025-03-03 14:15:51,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:51,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503105471] [2025-03-03 14:15:51,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:51,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:51,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:15:51,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:15:51,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:51,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:51,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:51,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503105471] [2025-03-03 14:15:51,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503105471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:51,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:51,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:51,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501386974] [2025-03-03 14:15:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:51,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:51,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:51,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:51,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:51,167 INFO L87 Difference]: Start difference. First operand 545 states and 906 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:51,209 INFO L93 Difference]: Finished difference Result 1072 states and 1791 transitions. [2025-03-03 14:15:51,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:51,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-03-03 14:15:51,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:51,215 INFO L225 Difference]: With dead ends: 1072 [2025-03-03 14:15:51,215 INFO L226 Difference]: Without dead ends: 545 [2025-03-03 14:15:51,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:51,218 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 2 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:51,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2687 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-03 14:15:51,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-03 14:15:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.6869158878504673) internal successors, (722), 447 states have internal predecessors, (722), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 14:15:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 905 transitions. [2025-03-03 14:15:51,246 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 905 transitions. Word has length 107 [2025-03-03 14:15:51,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:51,246 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 905 transitions. [2025-03-03 14:15:51,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:51,247 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 905 transitions. [2025-03-03 14:15:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:15:51,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:51,250 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:51,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:15:51,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:51,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:51,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1022382561, now seen corresponding path program 1 times [2025-03-03 14:15:51,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:51,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999118952] [2025-03-03 14:15:51,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:51,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:51,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:15:51,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:15:51,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:51,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:51,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:51,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999118952] [2025-03-03 14:15:51,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999118952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:51,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:51,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:51,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552176280] [2025-03-03 14:15:51,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:51,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:51,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:51,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:51,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:51,392 INFO L87 Difference]: Start difference. First operand 545 states and 905 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:51,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:51,434 INFO L93 Difference]: Finished difference Result 1072 states and 1790 transitions. [2025-03-03 14:15:51,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:51,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-03-03 14:15:51,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:51,439 INFO L225 Difference]: With dead ends: 1072 [2025-03-03 14:15:51,439 INFO L226 Difference]: Without dead ends: 545 [2025-03-03 14:15:51,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:51,443 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 1 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:51,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2687 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:51,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-03 14:15:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-03 14:15:51,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.6845794392523366) internal successors, (721), 447 states have internal predecessors, (721), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 14:15:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 904 transitions. [2025-03-03 14:15:51,469 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 904 transitions. Word has length 108 [2025-03-03 14:15:51,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:51,470 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 904 transitions. [2025-03-03 14:15:51,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 904 transitions. [2025-03-03 14:15:51,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:15:51,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:51,473 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:51,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:15:51,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:51,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:51,474 INFO L85 PathProgramCache]: Analyzing trace with hash -263736946, now seen corresponding path program 1 times [2025-03-03 14:15:51,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:51,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933531452] [2025-03-03 14:15:51,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:51,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:51,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:15:51,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:15:51,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:51,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:51,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:51,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933531452] [2025-03-03 14:15:51,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933531452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:51,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:51,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:15:51,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954403270] [2025-03-03 14:15:51,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:51,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:15:51,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:51,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:15:51,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:15:51,698 INFO L87 Difference]: Start difference. First operand 545 states and 904 transitions. Second operand has 9 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:15:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:51,804 INFO L93 Difference]: Finished difference Result 1038 states and 1722 transitions. [2025-03-03 14:15:51,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:15:51,805 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-03-03 14:15:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:51,809 INFO L225 Difference]: With dead ends: 1038 [2025-03-03 14:15:51,809 INFO L226 Difference]: Without dead ends: 560 [2025-03-03 14:15:51,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:15:51,811 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 91 mSDsluCounter, 6161 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7053 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:51,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7053 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:51,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-03 14:15:51,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 558. [2025-03-03 14:15:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 438 states have (on average 1.6803652968036529) internal successors, (736), 459 states have internal predecessors, (736), 95 states have call successors, (95), 23 states have call predecessors, (95), 24 states have return successors, (92), 88 states have call predecessors, (92), 90 states have call successors, (92) [2025-03-03 14:15:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 923 transitions. [2025-03-03 14:15:51,833 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 923 transitions. Word has length 109 [2025-03-03 14:15:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:51,833 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 923 transitions. [2025-03-03 14:15:51,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:15:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 923 transitions. [2025-03-03 14:15:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:15:51,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:51,836 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:51,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:15:51,836 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:51,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:51,837 INFO L85 PathProgramCache]: Analyzing trace with hash -277987091, now seen corresponding path program 1 times [2025-03-03 14:15:51,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:51,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251375157] [2025-03-03 14:15:51,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:51,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:51,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:15:51,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:15:51,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:51,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:51,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:51,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251375157] [2025-03-03 14:15:51,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251375157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:51,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:51,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:51,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075261026] [2025-03-03 14:15:51,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:51,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:51,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:51,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:51,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:51,930 INFO L87 Difference]: Start difference. First operand 558 states and 923 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:51,974 INFO L93 Difference]: Finished difference Result 1090 states and 1816 transitions. [2025-03-03 14:15:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:51,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 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:15:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:51,979 INFO L225 Difference]: With dead ends: 1090 [2025-03-03 14:15:51,980 INFO L226 Difference]: Without dead ends: 539 [2025-03-03 14:15:51,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:51,983 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 0 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2689 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:51,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2689 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:51,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-03 14:15:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-03-03 14:15:51,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 422 states have (on average 1.6753554502369667) internal successors, (707), 441 states have internal predecessors, (707), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 14:15:52,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 890 transitions. [2025-03-03 14:15:52,003 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 890 transitions. Word has length 109 [2025-03-03 14:15:52,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:52,003 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 890 transitions. [2025-03-03 14:15:52,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:52,004 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 890 transitions. [2025-03-03 14:15:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:15:52,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:52,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:52,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:15:52,007 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:52,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:52,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1964604335, now seen corresponding path program 1 times [2025-03-03 14:15:52,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:52,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939605114] [2025-03-03 14:15:52,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:52,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:52,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:15:52,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:15:52,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:52,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:52,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:52,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939605114] [2025-03-03 14:15:52,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939605114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:52,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:52,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:52,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452268807] [2025-03-03 14:15:52,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:52,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:52,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:52,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:52,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:52,164 INFO L87 Difference]: Start difference. First operand 539 states and 890 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:52,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:52,317 INFO L93 Difference]: Finished difference Result 1035 states and 1714 transitions. [2025-03-03 14:15:52,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:52,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2025-03-03 14:15:52,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:52,323 INFO L225 Difference]: With dead ends: 1035 [2025-03-03 14:15:52,323 INFO L226 Difference]: Without dead ends: 548 [2025-03-03 14:15:52,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:52,325 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 55 mSDsluCounter, 3359 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4206 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:52,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4206 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:52,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-03 14:15:52,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 539. [2025-03-03 14:15:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 422 states have (on average 1.6658767772511849) internal successors, (703), 441 states have internal predecessors, (703), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 14:15:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 886 transitions. [2025-03-03 14:15:52,342 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 886 transitions. Word has length 110 [2025-03-03 14:15:52,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:52,342 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 886 transitions. [2025-03-03 14:15:52,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:52,342 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 886 transitions. [2025-03-03 14:15:52,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:15:52,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:52,345 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:52,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:15:52,345 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:52,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:52,345 INFO L85 PathProgramCache]: Analyzing trace with hash -566165051, now seen corresponding path program 1 times [2025-03-03 14:15:52,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:52,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061049945] [2025-03-03 14:15:52,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:52,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:52,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:15:52,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:15:52,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:52,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:52,461 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:52,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:52,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061049945] [2025-03-03 14:15:52,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061049945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:52,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:52,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:52,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266476323] [2025-03-03 14:15:52,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:52,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:52,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:52,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:52,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:52,463 INFO L87 Difference]: Start difference. First operand 539 states and 886 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:52,610 INFO L93 Difference]: Finished difference Result 1035 states and 1710 transitions. [2025-03-03 14:15:52,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:52,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2025-03-03 14:15:52,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:52,614 INFO L225 Difference]: With dead ends: 1035 [2025-03-03 14:15:52,614 INFO L226 Difference]: Without dead ends: 548 [2025-03-03 14:15:52,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:52,617 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 54 mSDsluCounter, 3359 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4206 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:52,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4206 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-03 14:15:52,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 539. [2025-03-03 14:15:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 422 states have (on average 1.6563981042654028) internal successors, (699), 441 states have internal predecessors, (699), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 14:15:52,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 882 transitions. [2025-03-03 14:15:52,638 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 882 transitions. Word has length 111 [2025-03-03 14:15:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:52,638 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 882 transitions. [2025-03-03 14:15:52,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:52,638 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 882 transitions. [2025-03-03 14:15:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:15:52,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:52,641 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:52,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:15:52,641 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:52,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:52,642 INFO L85 PathProgramCache]: Analyzing trace with hash -961272142, now seen corresponding path program 1 times [2025-03-03 14:15:52,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:52,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110556913] [2025-03-03 14:15:52,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:52,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:52,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:15:52,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:15:52,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:52,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:52,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:52,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110556913] [2025-03-03 14:15:52,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110556913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:52,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:52,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:52,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379696539] [2025-03-03 14:15:52,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:52,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:52,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:52,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:52,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:52,755 INFO L87 Difference]: Start difference. First operand 539 states and 882 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:52,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:52,881 INFO L93 Difference]: Finished difference Result 1035 states and 1706 transitions. [2025-03-03 14:15:52,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:52,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2025-03-03 14:15:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:52,885 INFO L225 Difference]: With dead ends: 1035 [2025-03-03 14:15:52,885 INFO L226 Difference]: Without dead ends: 548 [2025-03-03 14:15:52,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:52,887 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 53 mSDsluCounter, 3342 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4188 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:52,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4188 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-03 14:15:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 539. [2025-03-03 14:15:52,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 422 states have (on average 1.646919431279621) internal successors, (695), 441 states have internal predecessors, (695), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 14:15:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 878 transitions. [2025-03-03 14:15:52,903 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 878 transitions. Word has length 112 [2025-03-03 14:15:52,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:52,903 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 878 transitions. [2025-03-03 14:15:52,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 878 transitions. [2025-03-03 14:15:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:15:52,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:52,906 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:52,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:15:52,906 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:52,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:52,906 INFO L85 PathProgramCache]: Analyzing trace with hash 913561697, now seen corresponding path program 1 times [2025-03-03 14:15:52,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:52,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134410365] [2025-03-03 14:15:52,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:52,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:52,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:15:52,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:15:52,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:52,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:53,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:53,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134410365] [2025-03-03 14:15:53,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134410365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:53,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:53,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:15:53,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936136092] [2025-03-03 14:15:53,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:53,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:15:53,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:53,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:15:53,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:53,033 INFO L87 Difference]: Start difference. First operand 539 states and 878 transitions. Second operand has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:15:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:53,087 INFO L93 Difference]: Finished difference Result 1026 states and 1688 transitions. [2025-03-03 14:15:53,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:15:53,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2025-03-03 14:15:53,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:53,091 INFO L225 Difference]: With dead ends: 1026 [2025-03-03 14:15:53,091 INFO L226 Difference]: Without dead ends: 518 [2025-03-03 14:15:53,092 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:15:53,093 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 84 mSDsluCounter, 4262 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5129 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:53,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5129 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-03 14:15:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-03-03 14:15:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 401 states have (on average 1.6483790523690773) internal successors, (661), 420 states have internal predecessors, (661), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 14:15:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 844 transitions. [2025-03-03 14:15:53,106 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 844 transitions. Word has length 112 [2025-03-03 14:15:53,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:53,106 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 844 transitions. [2025-03-03 14:15:53,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:15:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 844 transitions. [2025-03-03 14:15:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:15:53,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:53,109 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:53,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:15:53,109 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:53,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:53,109 INFO L85 PathProgramCache]: Analyzing trace with hash 424642472, now seen corresponding path program 1 times [2025-03-03 14:15:53,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:53,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815796991] [2025-03-03 14:15:53,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:53,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:53,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:15:53,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:15:53,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:53,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:53,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:53,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815796991] [2025-03-03 14:15:53,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815796991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:53,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:53,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:53,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751168656] [2025-03-03 14:15:53,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:53,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:53,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:53,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:53,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:53,202 INFO L87 Difference]: Start difference. First operand 518 states and 844 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:53,261 INFO L93 Difference]: Finished difference Result 1005 states and 1654 transitions. [2025-03-03 14:15:53,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:53,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2025-03-03 14:15:53,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:53,265 INFO L225 Difference]: With dead ends: 1005 [2025-03-03 14:15:53,265 INFO L226 Difference]: Without dead ends: 518 [2025-03-03 14:15:53,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:53,267 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 17 mSDsluCounter, 3299 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:53,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4126 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-03 14:15:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-03-03 14:15:53,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 401 states have (on average 1.6458852867830425) internal successors, (660), 420 states have internal predecessors, (660), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 14:15:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 843 transitions. [2025-03-03 14:15:53,280 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 843 transitions. Word has length 113 [2025-03-03 14:15:53,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:53,280 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 843 transitions. [2025-03-03 14:15:53,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:53,280 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 843 transitions. [2025-03-03 14:15:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:15:53,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:53,283 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:53,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:15:53,283 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:53,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:53,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1187655093, now seen corresponding path program 1 times [2025-03-03 14:15:53,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:53,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966692730] [2025-03-03 14:15:53,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:53,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:53,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:15:53,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:15:53,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:53,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:53,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:53,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966692730] [2025-03-03 14:15:53,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966692730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:53,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:53,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:53,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451271252] [2025-03-03 14:15:53,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:53,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:53,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:53,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:53,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:53,375 INFO L87 Difference]: Start difference. First operand 518 states and 843 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:53,432 INFO L93 Difference]: Finished difference Result 1005 states and 1653 transitions. [2025-03-03 14:15:53,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:53,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-03-03 14:15:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:53,436 INFO L225 Difference]: With dead ends: 1005 [2025-03-03 14:15:53,436 INFO L226 Difference]: Without dead ends: 518 [2025-03-03 14:15:53,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:53,438 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 16 mSDsluCounter, 3299 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:53,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4126 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-03 14:15:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-03-03 14:15:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 401 states have (on average 1.6433915211970074) internal successors, (659), 420 states have internal predecessors, (659), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 14:15:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 842 transitions. [2025-03-03 14:15:53,452 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 842 transitions. Word has length 114 [2025-03-03 14:15:53,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:53,452 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 842 transitions. [2025-03-03 14:15:53,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:15:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 842 transitions. [2025-03-03 14:15:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:15:53,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:53,455 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:53,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:15:53,455 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:53,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:53,455 INFO L85 PathProgramCache]: Analyzing trace with hash -179424885, now seen corresponding path program 1 times [2025-03-03 14:15:53,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:53,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852952134] [2025-03-03 14:15:53,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:53,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:53,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:15:53,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:15:53,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:53,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:15:53,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:53,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852952134] [2025-03-03 14:15:53,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852952134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:53,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:53,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:15:53,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371341860] [2025-03-03 14:15:53,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:53,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:15:53,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:53,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:15:53,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:15:53,629 INFO L87 Difference]: Start difference. First operand 518 states and 842 transitions. Second operand has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:15:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:53,715 INFO L93 Difference]: Finished difference Result 999 states and 1641 transitions. [2025-03-03 14:15:53,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:15:53,716 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 115 [2025-03-03 14:15:53,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:53,719 INFO L225 Difference]: With dead ends: 999 [2025-03-03 14:15:53,720 INFO L226 Difference]: Without dead ends: 518 [2025-03-03 14:15:53,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:15:53,722 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 6 mSDsluCounter, 6586 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7412 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:53,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7412 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-03 14:15:53,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-03-03 14:15:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 401 states have (on average 1.6408977556109725) internal successors, (658), 420 states have internal predecessors, (658), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 14:15:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 841 transitions. [2025-03-03 14:15:53,736 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 841 transitions. Word has length 115 [2025-03-03 14:15:53,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:53,737 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 841 transitions. [2025-03-03 14:15:53,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:15:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 841 transitions. [2025-03-03 14:15:53,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:15:53,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:53,739 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:53,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:15:53,739 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:53,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:53,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1220302616, now seen corresponding path program 1 times [2025-03-03 14:15:53,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:53,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807116240] [2025-03-03 14:15:53,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:53,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:53,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:15:53,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:15:53,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:53,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:15:53,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:53,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807116240] [2025-03-03 14:15:53,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807116240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:15:53,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580477268] [2025-03-03 14:15:53,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:53,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:15:53,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:15:53,830 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:15:53,832 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:15:53,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:15:54,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:15:54,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:54,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:54,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:15:54,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:15:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:15:54,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:15:54,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580477268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:54,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:15:54,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:15:54,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294539683] [2025-03-03 14:15:54,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:54,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:15:54,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:54,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:15:54,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:15:54,197 INFO L87 Difference]: Start difference. First operand 518 states and 841 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:15:54,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:54,634 INFO L93 Difference]: Finished difference Result 999 states and 1663 transitions. [2025-03-03 14:15:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:54,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2025-03-03 14:15:54,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:54,639 INFO L225 Difference]: With dead ends: 999 [2025-03-03 14:15:54,639 INFO L226 Difference]: Without dead ends: 526 [2025-03-03 14:15:54,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:15:54,641 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 804 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:54,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 2109 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:15:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-03 14:15:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-03 14:15:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 408 states have (on average 1.642156862745098) internal successors, (670), 427 states have internal predecessors, (670), 94 states have call successors, (94), 24 states have call predecessors, (94), 23 states have return successors, (90), 87 states have call predecessors, (90), 89 states have call successors, (90) [2025-03-03 14:15:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 854 transitions. [2025-03-03 14:15:54,660 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 854 transitions. Word has length 116 [2025-03-03 14:15:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:54,660 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 854 transitions. [2025-03-03 14:15:54,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:15:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 854 transitions. [2025-03-03 14:15:54,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:15:54,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:54,663 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:54,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:15:54,867 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,SelfDestructingSolverStorable14 [2025-03-03 14:15:54,867 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:54,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:54,868 INFO L85 PathProgramCache]: Analyzing trace with hash 590259932, now seen corresponding path program 1 times [2025-03-03 14:15:54,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:54,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738091893] [2025-03-03 14:15:54,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:54,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:54,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:15:54,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:15:54,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:54,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:15:54,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:54,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738091893] [2025-03-03 14:15:54,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738091893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:15:54,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257270188] [2025-03-03 14:15:54,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:54,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:15:54,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:15:54,964 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:15:54,965 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:15:55,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:15:55,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:15:55,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:55,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:55,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 1434 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:15:55,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:15:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:15:55,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:15:55,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257270188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:55,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:15:55,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:15:55,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869908877] [2025-03-03 14:15:55,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:55,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:15:55,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:55,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:15:55,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:15:55,407 INFO L87 Difference]: Start difference. First operand 526 states and 854 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:15:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:55,846 INFO L93 Difference]: Finished difference Result 1015 states and 1686 transitions. [2025-03-03 14:15:55,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:55,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2025-03-03 14:15:55,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:55,851 INFO L225 Difference]: With dead ends: 1015 [2025-03-03 14:15:55,852 INFO L226 Difference]: Without dead ends: 534 [2025-03-03 14:15:55,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:15:55,855 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 798 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:55,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 2106 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:15:55,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-03 14:15:55,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-03-03 14:15:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 415 states have (on average 1.6433734939759037) internal successors, (682), 434 states have internal predecessors, (682), 94 states have call successors, (94), 25 states have call predecessors, (94), 24 states have return successors, (91), 87 states have call predecessors, (91), 89 states have call successors, (91) [2025-03-03 14:15:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 867 transitions. [2025-03-03 14:15:55,877 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 867 transitions. Word has length 118 [2025-03-03 14:15:55,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:55,877 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 867 transitions. [2025-03-03 14:15:55,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:15:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 867 transitions. [2025-03-03 14:15:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:15:55,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:55,881 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:55,891 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:15:56,085 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,SelfDestructingSolverStorable15 [2025-03-03 14:15:56,085 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:56,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:56,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1256529080, now seen corresponding path program 1 times [2025-03-03 14:15:56,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:56,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223603095] [2025-03-03 14:15:56,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:56,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:56,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:15:56,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:15:56,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:56,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:15:56,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:56,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223603095] [2025-03-03 14:15:56,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223603095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:15:56,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278591870] [2025-03-03 14:15:56,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:56,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:15:56,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:15:56,188 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:15:56,190 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:15:56,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:15:56,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:15:56,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:56,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:56,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 1436 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:15:56,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:15:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:15:56,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:15:56,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278591870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:56,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:15:56,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:15:56,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575781627] [2025-03-03 14:15:56,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:56,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:15:56,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:56,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:15:56,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:15:56,514 INFO L87 Difference]: Start difference. First operand 534 states and 867 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:15:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:56,901 INFO L93 Difference]: Finished difference Result 1031 states and 1709 transitions. [2025-03-03 14:15:56,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:56,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2025-03-03 14:15:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:56,906 INFO L225 Difference]: With dead ends: 1031 [2025-03-03 14:15:56,906 INFO L226 Difference]: Without dead ends: 542 [2025-03-03 14:15:56,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:15:56,908 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 779 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:56,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 2103 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:15:56,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-03 14:15:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-03-03 14:15:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 422 states have (on average 1.6445497630331753) internal successors, (694), 441 states have internal predecessors, (694), 94 states have call successors, (94), 26 states have call predecessors, (94), 25 states have return successors, (92), 87 states have call predecessors, (92), 89 states have call successors, (92) [2025-03-03 14:15:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 880 transitions. [2025-03-03 14:15:56,923 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 880 transitions. Word has length 120 [2025-03-03 14:15:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:56,924 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 880 transitions. [2025-03-03 14:15:56,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:15:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 880 transitions. [2025-03-03 14:15:56,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:15:56,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:56,926 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:56,934 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:15:57,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:15:57,128 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:57,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:57,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1252436182, now seen corresponding path program 1 times [2025-03-03 14:15:57,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:57,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924297122] [2025-03-03 14:15:57,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:57,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:57,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:15:57,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:15:57,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:57,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:15:57,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:57,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924297122] [2025-03-03 14:15:57,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924297122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:15:57,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478867629] [2025-03-03 14:15:57,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:57,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:15:57,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:15:57,219 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:15:57,220 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:15:57,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:15:57,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:15:57,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:57,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:57,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 1438 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:15:57,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:15:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:15:57,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:15:57,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478867629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:57,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:15:57,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 14:15:57,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77337160] [2025-03-03 14:15:57,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:57,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:15:57,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:57,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:15:57,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:15:57,576 INFO L87 Difference]: Start difference. First operand 542 states and 880 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:15:57,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:57,935 INFO L93 Difference]: Finished difference Result 1047 states and 1732 transitions. [2025-03-03 14:15:57,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:57,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2025-03-03 14:15:57,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:57,939 INFO L225 Difference]: With dead ends: 1047 [2025-03-03 14:15:57,939 INFO L226 Difference]: Without dead ends: 550 [2025-03-03 14:15:57,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:15:57,942 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 786 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:57,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 2100 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:15:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-03 14:15:57,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2025-03-03 14:15:57,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 429 states have (on average 1.6456876456876457) internal successors, (706), 448 states have internal predecessors, (706), 94 states have call successors, (94), 27 states have call predecessors, (94), 26 states have return successors, (93), 87 states have call predecessors, (93), 89 states have call successors, (93) [2025-03-03 14:15:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 893 transitions. [2025-03-03 14:15:57,957 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 893 transitions. Word has length 122 [2025-03-03 14:15:57,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:57,957 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 893 transitions. [2025-03-03 14:15:57,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:15:57,958 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 893 transitions. [2025-03-03 14:15:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:15:57,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:57,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:57,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:15:58,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 14:15:58,165 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:58,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:58,170 INFO L85 PathProgramCache]: Analyzing trace with hash -939805656, now seen corresponding path program 1 times [2025-03-03 14:15:58,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:58,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872720201] [2025-03-03 14:15:58,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:58,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:58,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:15:58,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:15:58,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:58,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:15:58,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:58,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872720201] [2025-03-03 14:15:58,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872720201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:15:58,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579636039] [2025-03-03 14:15:58,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:58,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:15:58,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:15:58,373 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:15:58,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:15:58,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:15:58,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:15:58,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:58,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:58,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:15:58,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:15:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:15:58,740 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:15:58,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579636039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:58,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:15:58,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2025-03-03 14:15:58,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886410989] [2025-03-03 14:15:58,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:58,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:15:58,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:58,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:15:58,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:15:58,741 INFO L87 Difference]: Start difference. First operand 550 states and 893 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 14:15:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:59,006 INFO L93 Difference]: Finished difference Result 598 states and 964 transitions. [2025-03-03 14:15:59,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:15:59,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2025-03-03 14:15:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:59,012 INFO L225 Difference]: With dead ends: 598 [2025-03-03 14:15:59,012 INFO L226 Difference]: Without dead ends: 583 [2025-03-03 14:15:59,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:15:59,013 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 816 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:59,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1516 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:15:59,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-03 14:15:59,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 553. [2025-03-03 14:15:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 432 states have (on average 1.6412037037037037) internal successors, (709), 451 states have internal predecessors, (709), 94 states have call successors, (94), 27 states have call predecessors, (94), 26 states have return successors, (93), 87 states have call predecessors, (93), 89 states have call successors, (93) [2025-03-03 14:15:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 896 transitions. [2025-03-03 14:15:59,034 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 896 transitions. Word has length 124 [2025-03-03 14:15:59,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:59,034 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 896 transitions. [2025-03-03 14:15:59,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 14:15:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 896 transitions. [2025-03-03 14:15:59,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:15:59,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:59,038 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:59,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:15:59,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:15:59,239 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:59,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:59,239 INFO L85 PathProgramCache]: Analyzing trace with hash -342136890, now seen corresponding path program 1 times [2025-03-03 14:15:59,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:59,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256130533] [2025-03-03 14:15:59,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:59,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:59,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:15:59,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:15:59,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:59,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:15:59,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256130533] [2025-03-03 14:15:59,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256130533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:15:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422309084] [2025-03-03 14:15:59,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:59,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:15:59,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:15:59,505 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:15:59,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:15:59,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:15:59,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:15:59,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:59,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:59,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:15:59,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:15:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:15:59,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:15:59,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422309084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:59,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:15:59,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2025-03-03 14:15:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696633046] [2025-03-03 14:15:59,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:59,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:15:59,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:59,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:15:59,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:15:59,762 INFO L87 Difference]: Start difference. First operand 553 states and 896 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:15:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:59,782 INFO L93 Difference]: Finished difference Result 568 states and 914 transitions. [2025-03-03 14:15:59,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:15:59,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) Word has length 130 [2025-03-03 14:15:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:59,788 INFO L225 Difference]: With dead ends: 568 [2025-03-03 14:15:59,788 INFO L226 Difference]: Without dead ends: 553 [2025-03-03 14:15:59,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:15:59,790 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 0 mSDsluCounter, 2510 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3348 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:59,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3348 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:59,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-03 14:15:59,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-03 14:15:59,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 432 states have (on average 1.6388888888888888) internal successors, (708), 451 states have internal predecessors, (708), 94 states have call successors, (94), 27 states have call predecessors, (94), 26 states have return successors, (93), 87 states have call predecessors, (93), 89 states have call successors, (93) [2025-03-03 14:15:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 895 transitions. [2025-03-03 14:15:59,808 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 895 transitions. Word has length 130 [2025-03-03 14:15:59,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:59,808 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 895 transitions. [2025-03-03 14:15:59,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:15:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 895 transitions. [2025-03-03 14:15:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:15:59,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:59,810 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:59,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:16:00,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:00,012 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:00,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:00,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1909213322, now seen corresponding path program 1 times [2025-03-03 14:16:00,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:00,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025327276] [2025-03-03 14:16:00,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:00,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:00,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:16:00,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:16:00,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:00,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 14:16:00,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:00,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025327276] [2025-03-03 14:16:00,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025327276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:00,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183454651] [2025-03-03 14:16:00,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:00,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:00,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:00,259 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:00,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:16:00,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:16:00,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:16:00,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:00,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:00,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 14:16:00,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:16:00,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:00,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183454651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:00,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:00,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2025-03-03 14:16:00,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291705327] [2025-03-03 14:16:00,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:00,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:16:00,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:00,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:16:00,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:16:00,641 INFO L87 Difference]: Start difference. First operand 553 states and 895 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 6 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-03 14:16:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:03,058 INFO L93 Difference]: Finished difference Result 1903 states and 3149 transitions. [2025-03-03 14:16:03,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 14:16:03,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 6 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 140 [2025-03-03 14:16:03,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:03,068 INFO L225 Difference]: With dead ends: 1903 [2025-03-03 14:16:03,068 INFO L226 Difference]: Without dead ends: 1395 [2025-03-03 14:16:03,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:16:03,072 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 2324 mSDsluCounter, 2252 mSDsCounter, 0 mSdLazyCounter, 4604 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2407 SdHoareTripleChecker+Valid, 2758 SdHoareTripleChecker+Invalid, 5110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 4604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:03,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2407 Valid, 2758 Invalid, 5110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [506 Valid, 4604 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 14:16:03,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-03-03 14:16:03,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1281. [2025-03-03 14:16:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1006 states have (on average 1.6610337972166997) internal successors, (1671), 1045 states have internal predecessors, (1671), 210 states have call successors, (210), 59 states have call predecessors, (210), 64 states have return successors, (229), 202 states have call predecessors, (229), 205 states have call successors, (229) [2025-03-03 14:16:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 2110 transitions. [2025-03-03 14:16:03,135 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 2110 transitions. Word has length 140 [2025-03-03 14:16:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:03,137 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 2110 transitions. [2025-03-03 14:16:03,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 6 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-03 14:16:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 2110 transitions. [2025-03-03 14:16:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 14:16:03,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:03,140 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:03,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:03,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:03,345 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:03,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:03,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1191097436, now seen corresponding path program 1 times [2025-03-03 14:16:03,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:03,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178429918] [2025-03-03 14:16:03,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:03,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:03,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 14:16:03,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 14:16:03,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:03,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:03,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:03,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178429918] [2025-03-03 14:16:03,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178429918] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:03,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249149949] [2025-03-03 14:16:03,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:03,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:03,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:03,579 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:03,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:16:03,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 14:16:03,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 14:16:03,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:03,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:03,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 14:16:03,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:03,915 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:03,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:03,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249149949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:03,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:03,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-03-03 14:16:03,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779696639] [2025-03-03 14:16:03,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:03,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:16:03,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:03,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:16:03,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:16:03,916 INFO L87 Difference]: Start difference. First operand 1281 states and 2110 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:16:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:05,614 INFO L93 Difference]: Finished difference Result 2775 states and 4594 transitions. [2025-03-03 14:16:05,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:16:05,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 142 [2025-03-03 14:16:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:05,626 INFO L225 Difference]: With dead ends: 2775 [2025-03-03 14:16:05,626 INFO L226 Difference]: Without dead ends: 1539 [2025-03-03 14:16:05,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:16:05,632 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 2074 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 3282 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2156 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 3749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 3282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:05,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2156 Valid, 2035 Invalid, 3749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 3282 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 14:16:05,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2025-03-03 14:16:05,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1352. [2025-03-03 14:16:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1058 states have (on average 1.6474480151228734) internal successors, (1743), 1103 states have internal predecessors, (1743), 218 states have call successors, (218), 64 states have call predecessors, (218), 75 states have return successors, (255), 210 states have call predecessors, (255), 213 states have call successors, (255) [2025-03-03 14:16:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2216 transitions. [2025-03-03 14:16:05,685 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2216 transitions. Word has length 142 [2025-03-03 14:16:05,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:05,685 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 2216 transitions. [2025-03-03 14:16:05,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:16:05,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2216 transitions. [2025-03-03 14:16:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 14:16:05,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:05,689 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:05,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 14:16:05,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 14:16:05,889 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:05,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:05,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1363408580, now seen corresponding path program 1 times [2025-03-03 14:16:05,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:05,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892440367] [2025-03-03 14:16:05,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:05,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:05,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:16:05,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:16:05,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:05,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:06,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:06,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892440367] [2025-03-03 14:16:06,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892440367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:06,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827756392] [2025-03-03 14:16:06,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:06,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:06,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:06,094 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:06,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:16:06,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:16:06,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:16:06,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:06,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:06,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 1505 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:16:06,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:16:06,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:06,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827756392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:06,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:06,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2025-03-03 14:16:06,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175055472] [2025-03-03 14:16:06,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:06,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:16:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:06,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:16:06,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:16:06,334 INFO L87 Difference]: Start difference. First operand 1352 states and 2216 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:16:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:06,402 INFO L93 Difference]: Finished difference Result 3349 states and 5559 transitions. [2025-03-03 14:16:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:16:06,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2025-03-03 14:16:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:06,413 INFO L225 Difference]: With dead ends: 3349 [2025-03-03 14:16:06,414 INFO L226 Difference]: Without dead ends: 2046 [2025-03-03 14:16:06,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:16:06,419 INFO L435 NwaCegarLoop]: 1491 mSDtfsCounter, 781 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:06,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 2321 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:06,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2025-03-03 14:16:06,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1348. [2025-03-03 14:16:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1056 states have (on average 1.646780303030303) internal successors, (1739), 1099 states have internal predecessors, (1739), 218 states have call successors, (218), 64 states have call predecessors, (218), 73 states have return successors, (246), 210 states have call predecessors, (246), 213 states have call successors, (246) [2025-03-03 14:16:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2203 transitions. [2025-03-03 14:16:06,476 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2203 transitions. Word has length 147 [2025-03-03 14:16:06,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:06,477 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 2203 transitions. [2025-03-03 14:16:06,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:16:06,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2203 transitions. [2025-03-03 14:16:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 14:16:06,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:06,480 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:06,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 14:16:06,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:06,681 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:06,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:06,681 INFO L85 PathProgramCache]: Analyzing trace with hash 914711941, now seen corresponding path program 1 times [2025-03-03 14:16:06,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:06,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360104605] [2025-03-03 14:16:06,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:06,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:06,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:16:06,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:16:06,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:06,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:06,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:06,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360104605] [2025-03-03 14:16:06,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360104605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:06,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783378391] [2025-03-03 14:16:06,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:06,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:06,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:06,882 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:06,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 14:16:06,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:16:07,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:16:07,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:07,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:07,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:16:07,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:07,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:07,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:07,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783378391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:07,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:07,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669356151] [2025-03-03 14:16:07,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:07,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:07,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:07,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:07,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:07,184 INFO L87 Difference]: Start difference. First operand 1348 states and 2203 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:08,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:08,290 INFO L93 Difference]: Finished difference Result 4218 states and 7015 transitions. [2025-03-03 14:16:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:08,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 147 [2025-03-03 14:16:08,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:08,309 INFO L225 Difference]: With dead ends: 4218 [2025-03-03 14:16:08,309 INFO L226 Difference]: Without dead ends: 2915 [2025-03-03 14:16:08,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:08,314 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 1859 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1935 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:08,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1935 Valid, 916 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 14:16:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2025-03-03 14:16:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 2803. [2025-03-03 14:16:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2803 states, 2166 states have (on average 1.649584487534626) internal successors, (3573), 2262 states have internal predecessors, (3573), 487 states have call successors, (487), 123 states have call predecessors, (487), 149 states have return successors, (595), 479 states have call predecessors, (595), 482 states have call successors, (595) [2025-03-03 14:16:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2803 states and 4655 transitions. [2025-03-03 14:16:08,408 INFO L78 Accepts]: Start accepts. Automaton has 2803 states and 4655 transitions. Word has length 147 [2025-03-03 14:16:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:08,409 INFO L471 AbstractCegarLoop]: Abstraction has 2803 states and 4655 transitions. [2025-03-03 14:16:08,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 4655 transitions. [2025-03-03 14:16:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 14:16:08,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:08,412 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:08,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:08,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-03 14:16:08,613 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:08,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:08,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1708878824, now seen corresponding path program 1 times [2025-03-03 14:16:08,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:08,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119270424] [2025-03-03 14:16:08,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:08,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:08,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:16:08,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:16:08,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:08,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:08,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:08,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119270424] [2025-03-03 14:16:08,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119270424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:08,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890979979] [2025-03-03 14:16:08,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:08,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:08,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:08,812 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:08,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 14:16:08,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:16:09,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:16:09,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:09,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:09,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 1506 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:16:09,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:09,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:09,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890979979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:09,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:09,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:09,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81155981] [2025-03-03 14:16:09,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:09,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:09,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:09,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:09,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:09,141 INFO L87 Difference]: Start difference. First operand 2803 states and 4655 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:10,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:10,369 INFO L93 Difference]: Finished difference Result 9010 states and 15277 transitions. [2025-03-03 14:16:10,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:10,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 148 [2025-03-03 14:16:10,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:10,409 INFO L225 Difference]: With dead ends: 9010 [2025-03-03 14:16:10,409 INFO L226 Difference]: Without dead ends: 6252 [2025-03-03 14:16:10,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:10,425 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 1864 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1939 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:10,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1939 Valid, 876 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 14:16:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6252 states. [2025-03-03 14:16:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6252 to 6013. [2025-03-03 14:16:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6013 states, 4565 states have (on average 1.6453450164293537) internal successors, (7511), 4789 states have internal predecessors, (7511), 1138 states have call successors, (1138), 241 states have call predecessors, (1138), 309 states have return successors, (1532), 1134 states have call predecessors, (1532), 1133 states have call successors, (1532) [2025-03-03 14:16:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6013 states to 6013 states and 10181 transitions. [2025-03-03 14:16:10,694 INFO L78 Accepts]: Start accepts. Automaton has 6013 states and 10181 transitions. Word has length 148 [2025-03-03 14:16:10,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:10,695 INFO L471 AbstractCegarLoop]: Abstraction has 6013 states and 10181 transitions. [2025-03-03 14:16:10,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 6013 states and 10181 transitions. [2025-03-03 14:16:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:16:10,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:10,699 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:10,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:10,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-03 14:16:10,900 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:10,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1435817697, now seen corresponding path program 1 times [2025-03-03 14:16:10,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:10,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821955758] [2025-03-03 14:16:10,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:10,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:10,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:16:10,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:16:10,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:10,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:11,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:11,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821955758] [2025-03-03 14:16:11,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821955758] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:11,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222187789] [2025-03-03 14:16:11,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:11,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:11,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:11,086 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:11,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 14:16:11,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:16:11,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:16:11,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:11,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:11,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 1508 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:16:11,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:11,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:11,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222187789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:11,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:11,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:11,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884542142] [2025-03-03 14:16:11,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:11,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:11,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:11,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:11,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:11,390 INFO L87 Difference]: Start difference. First operand 6013 states and 10181 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:12,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:12,767 INFO L93 Difference]: Finished difference Result 19736 states and 34460 transitions. [2025-03-03 14:16:12,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:12,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 149 [2025-03-03 14:16:12,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:12,849 INFO L225 Difference]: With dead ends: 19736 [2025-03-03 14:16:12,849 INFO L226 Difference]: Without dead ends: 13768 [2025-03-03 14:16:12,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:12,880 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 1849 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1923 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:12,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1923 Valid, 873 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 14:16:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2025-03-03 14:16:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13274. [2025-03-03 14:16:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13274 states, 9866 states have (on average 1.6364281370362863) internal successors, (16145), 10404 states have internal predecessors, (16145), 2758 states have call successors, (2758), 477 states have call predecessors, (2758), 649 states have return successors, (4182), 2774 states have call predecessors, (4182), 2753 states have call successors, (4182) [2025-03-03 14:16:13,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13274 states to 13274 states and 23085 transitions. [2025-03-03 14:16:13,593 INFO L78 Accepts]: Start accepts. Automaton has 13274 states and 23085 transitions. Word has length 149 [2025-03-03 14:16:13,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:13,593 INFO L471 AbstractCegarLoop]: Abstraction has 13274 states and 23085 transitions. [2025-03-03 14:16:13,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 13274 states and 23085 transitions. [2025-03-03 14:16:13,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 14:16:13,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:13,597 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:13,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:13,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 14:16:13,799 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:13,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:13,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1560861134, now seen corresponding path program 1 times [2025-03-03 14:16:13,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:13,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016811334] [2025-03-03 14:16:13,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:13,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:13,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:16:13,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:16:13,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:13,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:13,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:13,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016811334] [2025-03-03 14:16:13,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016811334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:13,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486482291] [2025-03-03 14:16:13,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:13,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:13,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:13,991 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:13,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 14:16:14,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:16:14,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:16:14,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:14,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:14,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 1510 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:16:14,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:14,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:14,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486482291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:14,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:14,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:14,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311801180] [2025-03-03 14:16:14,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:14,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:14,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:14,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:14,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:14,319 INFO L87 Difference]: Start difference. First operand 13274 states and 23085 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:16,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:16,694 INFO L93 Difference]: Finished difference Result 44337 states and 81067 transitions. [2025-03-03 14:16:16,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:16,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 150 [2025-03-03 14:16:16,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:16,978 INFO L225 Difference]: With dead ends: 44337 [2025-03-03 14:16:16,978 INFO L226 Difference]: Without dead ends: 31108 [2025-03-03 14:16:17,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:17,071 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 1837 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1910 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:17,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1910 Valid, 867 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 14:16:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31108 states. [2025-03-03 14:16:18,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31108 to 30159. [2025-03-03 14:16:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30159 states, 21891 states have (on average 1.6241834543876479) internal successors, (35555), 23211 states have internal predecessors, (35555), 6886 states have call successors, (6886), 949 states have call predecessors, (6886), 1381 states have return successors, (12056), 6978 states have call predecessors, (12056), 6881 states have call successors, (12056) [2025-03-03 14:16:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30159 states to 30159 states and 54497 transitions. [2025-03-03 14:16:18,910 INFO L78 Accepts]: Start accepts. Automaton has 30159 states and 54497 transitions. Word has length 150 [2025-03-03 14:16:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:18,911 INFO L471 AbstractCegarLoop]: Abstraction has 30159 states and 54497 transitions. [2025-03-03 14:16:18,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 30159 states and 54497 transitions. [2025-03-03 14:16:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 14:16:18,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:18,915 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:18,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 14:16:19,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 14:16:19,116 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:19,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1142244167, now seen corresponding path program 1 times [2025-03-03 14:16:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:19,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435844924] [2025-03-03 14:16:19,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:19,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:16:19,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:16:19,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:19,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:16:19,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:19,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435844924] [2025-03-03 14:16:19,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435844924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:19,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841911255] [2025-03-03 14:16:19,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:19,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:19,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:19,299 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:19,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 14:16:19,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:16:19,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:16:19,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:19,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:19,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 1512 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:16:19,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:16:19,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:19,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841911255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:19,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:19,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:19,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483757144] [2025-03-03 14:16:19,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:19,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:19,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:19,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:19,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:19,630 INFO L87 Difference]: Start difference. First operand 30159 states and 54497 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:25,101 INFO L93 Difference]: Finished difference Result 102221 states and 201031 transitions. [2025-03-03 14:16:25,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:25,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 151 [2025-03-03 14:16:25,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:25,736 INFO L225 Difference]: With dead ends: 102221 [2025-03-03 14:16:25,736 INFO L226 Difference]: Without dead ends: 72097 [2025-03-03 14:16:26,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:26,079 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 1811 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1883 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:26,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1883 Valid, 966 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:16:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72097 states. [2025-03-03 14:16:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72097 to 70484. [2025-03-03 14:16:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70484 states, 49900 states have (on average 1.6097595190380762) internal successors, (80327), 53194 states have internal predecessors, (80327), 17602 states have call successors, (17602), 1890 states have call predecessors, (17602), 2981 states have return successors, (36665), 17953 states have call predecessors, (36665), 17597 states have call successors, (36665) [2025-03-03 14:16:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70484 states to 70484 states and 134594 transitions. [2025-03-03 14:16:31,088 INFO L78 Accepts]: Start accepts. Automaton has 70484 states and 134594 transitions. Word has length 151 [2025-03-03 14:16:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:31,089 INFO L471 AbstractCegarLoop]: Abstraction has 70484 states and 134594 transitions. [2025-03-03 14:16:31,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:16:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 70484 states and 134594 transitions. [2025-03-03 14:16:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-03 14:16:31,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:31,114 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:31,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 14:16:31,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:31,314 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:31,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash -397875928, now seen corresponding path program 1 times [2025-03-03 14:16:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:31,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74577341] [2025-03-03 14:16:31,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:31,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-03 14:16:31,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-03 14:16:31,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:31,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 14:16:31,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:31,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74577341] [2025-03-03 14:16:31,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74577341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:31,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177463412] [2025-03-03 14:16:31,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:31,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:31,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:31,946 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:31,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 14:16:32,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-03 14:16:32,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-03 14:16:32,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:32,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:32,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 1895 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:16:32,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:16:32,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:32,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177463412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:32,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:32,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:32,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614519518] [2025-03-03 14:16:32,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:32,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:32,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:32,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:32,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:32,283 INFO L87 Difference]: Start difference. First operand 70484 states and 134594 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:16:36,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:36,801 INFO L93 Difference]: Finished difference Result 143802 states and 284462 transitions. [2025-03-03 14:16:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:36,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 199 [2025-03-03 14:16:36,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:37,594 INFO L225 Difference]: With dead ends: 143802 [2025-03-03 14:16:37,594 INFO L226 Difference]: Without dead ends: 73364 [2025-03-03 14:16:37,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:37,962 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 144 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:37,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2314 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:38,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73364 states. [2025-03-03 14:16:42,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73364 to 72980. [2025-03-03 14:16:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72980 states, 52332 states have (on average 1.624226094932355) internal successors, (84999), 55626 states have internal predecessors, (84999), 17602 states have call successors, (17602), 1954 states have call predecessors, (17602), 3045 states have return successors, (36665), 17953 states have call predecessors, (36665), 17597 states have call successors, (36665) [2025-03-03 14:16:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72980 states to 72980 states and 139266 transitions. [2025-03-03 14:16:43,345 INFO L78 Accepts]: Start accepts. Automaton has 72980 states and 139266 transitions. Word has length 199 [2025-03-03 14:16:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:43,345 INFO L471 AbstractCegarLoop]: Abstraction has 72980 states and 139266 transitions. [2025-03-03 14:16:43,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:16:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 72980 states and 139266 transitions. [2025-03-03 14:16:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 14:16:43,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:43,366 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:43,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-03 14:16:43,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 14:16:43,567 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:43,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:43,567 INFO L85 PathProgramCache]: Analyzing trace with hash 580128704, now seen corresponding path program 1 times [2025-03-03 14:16:43,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:43,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280600744] [2025-03-03 14:16:43,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:43,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:43,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 14:16:43,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 14:16:43,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:43,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-03 14:16:43,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:43,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280600744] [2025-03-03 14:16:43,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280600744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:16:43,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128000487] [2025-03-03 14:16:43,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:43,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:16:43,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:43,857 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:16:43,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 14:16:43,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 14:16:44,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 14:16:44,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:44,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:44,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 1900 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:16:44,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:16:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 14:16:44,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:16:44,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128000487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:44,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:16:44,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:16:44,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073740842] [2025-03-03 14:16:44,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:44,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:44,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:44,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:44,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:44,158 INFO L87 Difference]: Start difference. First operand 72980 states and 139266 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:16:49,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:49,470 INFO L93 Difference]: Finished difference Result 148794 states and 293998 transitions. [2025-03-03 14:16:49,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:49,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 204 [2025-03-03 14:16:49,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:50,092 INFO L225 Difference]: With dead ends: 148794 [2025-03-03 14:16:50,092 INFO L226 Difference]: Without dead ends: 75860 [2025-03-03 14:16:50,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:16:50,521 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 140 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:50,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 2314 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75860 states.