./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_spec9_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 2156ba1e79a86c856553f139302f2b9940a34efa4e31eb139d6bea893c29b00d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:28:36,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:28:36,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:28:36,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:28:36,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:28:36,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:28:36,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:28:36,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:28:36,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:28:36,459 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:28:36,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:28:36,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:28:36,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:28:36,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:28:36,460 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:28:36,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:28:36,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:28:36,461 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:28:36,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:28:36,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:28:36,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:28:36,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:28:36,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:28:36,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:28:36,461 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:28:36,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:28:36,461 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:28:36,461 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:28:36,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:28:36,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:28:36,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:28:36,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:28:36,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:28:36,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:28:36,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:28:36,462 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:28:36,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:28:36,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:28:36,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:28:36,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:28:36,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:28:36,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:28:36,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:28:36,463 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 -> 2156ba1e79a86c856553f139302f2b9940a34efa4e31eb139d6bea893c29b00d [2025-03-08 05:28:36,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:28:36,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:28:36,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:28:36,757 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:28:36,757 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:28:36,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product11.cil.c [2025-03-08 05:28:37,883 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f57be09f/e5267e8891044aa59e326c7ac1c9c9a7/FLAG47482d635 [2025-03-08 05:28:38,268 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:28:38,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product11.cil.c [2025-03-08 05:28:38,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f57be09f/e5267e8891044aa59e326c7ac1c9c9a7/FLAG47482d635 [2025-03-08 05:28:38,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f57be09f/e5267e8891044aa59e326c7ac1c9c9a7 [2025-03-08 05:28:38,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:28:38,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:28:38,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:28:38,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:28:38,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:28:38,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:28:38" (1/1) ... [2025-03-08 05:28:38,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df3a61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:38, skipping insertion in model container [2025-03-08 05:28:38,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:28:38" (1/1) ... [2025-03-08 05:28:38,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:28:38,729 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_spec9_product11.cil.c[71954,71967] [2025-03-08 05:28:38,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:28:38,750 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:28:38,756 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2025-03-08 05:28:38,757 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [148] [2025-03-08 05:28:38,758 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [505] [2025-03-08 05:28:38,758 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [871] [2025-03-08 05:28:38,758 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1034] [2025-03-08 05:28:38,758 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1069] [2025-03-08 05:28:38,758 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1189] [2025-03-08 05:28:38,758 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1201] [2025-03-08 05:28:38,758 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2729] [2025-03-08 05:28:38,758 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3390] [2025-03-08 05:28:38,857 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_spec9_product11.cil.c[71954,71967] [2025-03-08 05:28:38,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:28:38,886 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:28:38,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:38 WrapperNode [2025-03-08 05:28:38,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:28:38,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:28:38,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:28:38,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:28:38,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:38" (1/1) ... [2025-03-08 05:28:38,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:38" (1/1) ... [2025-03-08 05:28:38,973 INFO L138 Inliner]: procedures = 93, calls = 335, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 1084 [2025-03-08 05:28:38,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:28:38,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:28:38,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:28:38,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:28:38,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:38" (1/1) ... [2025-03-08 05:28:38,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:38" (1/1) ... [2025-03-08 05:28:38,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:38" (1/1) ... [2025-03-08 05:28:39,034 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-08 05:28:39,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:38" (1/1) ... [2025-03-08 05:28:39,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:38" (1/1) ... [2025-03-08 05:28:39,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:38" (1/1) ... [2025-03-08 05:28:39,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:38" (1/1) ... [2025-03-08 05:28:39,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:38" (1/1) ... [2025-03-08 05:28:39,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:38" (1/1) ... [2025-03-08 05:28:39,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:28:39,083 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:28:39,083 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:28:39,083 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:28:39,084 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:38" (1/1) ... [2025-03-08 05:28:39,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:28:39,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:39,112 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-08 05:28:39,124 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-08 05:28:39,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:28:39,149 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:28:39,149 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:28:39,150 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:28:39,150 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:28:39,150 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-08 05:28:39,150 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-08 05:28:39,150 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:28:39,150 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:28:39,151 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:28:39,151 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:28:39,151 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:28:39,151 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:28:39,151 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:28:39,151 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:28:39,152 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:28:39,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:28:39,152 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:28:39,152 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:28:39,152 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:28:39,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:28:39,153 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:28:39,153 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:28:39,153 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-08 05:28:39,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-08 05:28:39,153 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:28:39,154 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:28:39,154 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-03-08 05:28:39,154 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-03-08 05:28:39,154 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:28:39,154 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:28:39,154 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:28:39,154 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:28:39,154 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:28:39,154 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:28:39,154 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:28:39,155 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-03-08 05:28:39,155 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:28:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:28:39,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:28:39,157 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:28:39,157 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:28:39,157 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:28:39,157 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:28:39,157 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:28:39,157 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:28:39,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:28:39,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:28:39,157 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:28:39,157 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:28:39,328 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:28:39,331 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:28:39,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1186: #res := ~retValue_acc~9; [2025-03-08 05:28:39,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1280: #res := ~retValue_acc~10; [2025-03-08 05:28:39,395 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1433: #res := ~retValue_acc~11; [2025-03-08 05:28:39,461 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2089: #res#1 := ~retValue_acc~21#1; [2025-03-08 05:28:39,461 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1476-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~13#1; [2025-03-08 05:28:39,467 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2717: #res := ~retValue_acc~25; [2025-03-08 05:28:39,789 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1970-1: stopRequestedInDirection__wrappee__empty_#res#1 := stopRequestedInDirection__wrappee__empty_~retValue_acc~18#1; [2025-03-08 05:28:39,789 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1999: #res#1 := ~retValue_acc~19#1; [2025-03-08 05:28:39,847 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2134: #res := ~retValue_acc~23; [2025-03-08 05:28:39,864 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1147: #res := ~retValue_acc~8; [2025-03-08 05:28:39,896 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1525: #res := ~retValue_acc~15; [2025-03-08 05:28:39,966 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1605-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~16#1; [2025-03-08 05:28:39,966 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1618-1: isIdle_#res#1 := isIdle_~retValue_acc~17#1; [2025-03-08 05:28:40,068 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1442-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2025-03-08 05:28:40,069 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2120-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~22#1; [2025-03-08 05:28:40,126 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3076: #res := ~retValue_acc~28; [2025-03-08 05:28:40,183 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L502-1: main_#res#1 := main_~retValue_acc~1#1; [2025-03-08 05:28:40,183 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1066-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2025-03-08 05:28:40,191 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840: #res := ~retValue_acc~27; [2025-03-08 05:28:40,195 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3387: #res := ~retValue_acc~29; [2025-03-08 05:28:40,339 INFO L? ?]: Removed 437 outVars from TransFormulas that were not future-live. [2025-03-08 05:28:40,339 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:28:40,360 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:28:40,365 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:28:40,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:28:40 BoogieIcfgContainer [2025-03-08 05:28:40,365 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:28:40,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:28:40,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:28:40,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:28:40,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:28:38" (1/3) ... [2025-03-08 05:28:40,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5d0312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:28:40, skipping insertion in model container [2025-03-08 05:28:40,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:38" (2/3) ... [2025-03-08 05:28:40,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5d0312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:28:40, skipping insertion in model container [2025-03-08 05:28:40,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:28:40" (3/3) ... [2025-03-08 05:28:40,379 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product11.cil.c [2025-03-08 05:28:40,401 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:28:40,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product11.cil.c that has 24 procedures, 543 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:28:40,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:28:40,478 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;@3c97d62b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:28:40,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:28:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 543 states, 427 states have (on average 1.7002341920374706) internal successors, (726), 448 states have internal predecessors, (726), 91 states have call successors, (91), 23 states have call predecessors, (91), 23 states have return successors, (91), 85 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 05:28:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:28:40,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:40,503 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] [2025-03-08 05:28:40,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:40,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:40,507 INFO L85 PathProgramCache]: Analyzing trace with hash 120320770, now seen corresponding path program 1 times [2025-03-08 05:28:40,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:40,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642143691] [2025-03-08 05:28:40,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:40,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:28:40,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:28:40,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:40,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:41,053 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-08 05:28:41,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:41,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642143691] [2025-03-08 05:28:41,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642143691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:41,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:41,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814925021] [2025-03-08 05:28:41,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:41,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:41,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:41,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:41,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:41,075 INFO L87 Difference]: Start difference. First operand has 543 states, 427 states have (on average 1.7002341920374706) internal successors, (726), 448 states have internal predecessors, (726), 91 states have call successors, (91), 23 states have call predecessors, (91), 23 states have return successors, (91), 85 states have call predecessors, (91), 91 states have call successors, (91) 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, (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-08 05:28:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:41,192 INFO L93 Difference]: Finished difference Result 1066 states and 1791 transitions. [2025-03-08 05:28:41,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:41,194 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, (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 104 [2025-03-08 05:28:41,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:41,210 INFO L225 Difference]: With dead ends: 1066 [2025-03-08 05:28:41,211 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 05:28:41,223 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-08 05:28:41,225 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 5 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2660 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-08 05:28:41,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2660 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:41,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 05:28:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-08 05:28:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 421 states have (on average 1.6983372921615203) internal successors, (715), 440 states have internal predecessors, (715), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:28:41,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 892 transitions. [2025-03-08 05:28:41,286 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 892 transitions. Word has length 104 [2025-03-08 05:28:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:41,286 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 892 transitions. [2025-03-08 05:28:41,286 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, (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-08 05:28:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 892 transitions. [2025-03-08 05:28:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 05:28:41,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:41,294 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-08 05:28:41,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:28:41,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:41,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash -183519132, now seen corresponding path program 1 times [2025-03-08 05:28:41,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:41,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171100914] [2025-03-08 05:28:41,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:41,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:41,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 05:28:41,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:28:41,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:41,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:41,509 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-08 05:28:41,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:41,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171100914] [2025-03-08 05:28:41,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171100914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:41,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:41,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:41,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331729757] [2025-03-08 05:28:41,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:41,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:41,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:41,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:41,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:41,515 INFO L87 Difference]: Start difference. First operand 535 states and 892 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-08 05:28:41,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:41,594 INFO L93 Difference]: Finished difference Result 1052 states and 1761 transitions. [2025-03-08 05:28:41,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:41,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 106 [2025-03-08 05:28:41,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:41,603 INFO L225 Difference]: With dead ends: 1052 [2025-03-08 05:28:41,604 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 05:28:41,608 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-08 05:28:41,608 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 4 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2639 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-08 05:28:41,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2639 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 05:28:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-08 05:28:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 421 states have (on average 1.6959619952494063) internal successors, (714), 440 states have internal predecessors, (714), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:28:41,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 891 transitions. [2025-03-08 05:28:41,644 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 891 transitions. Word has length 106 [2025-03-08 05:28:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:41,645 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 891 transitions. [2025-03-08 05:28:41,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-08 05:28:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 891 transitions. [2025-03-08 05:28:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:28:41,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:41,649 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-08 05:28:41,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:28:41,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:41,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:41,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1365224750, now seen corresponding path program 1 times [2025-03-08 05:28:41,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:41,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578141918] [2025-03-08 05:28:41,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:41,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:41,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 05:28:41,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:28:41,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:41,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:41,802 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-08 05:28:41,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:41,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578141918] [2025-03-08 05:28:41,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578141918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:41,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:41,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:41,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731318590] [2025-03-08 05:28:41,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:41,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:41,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:41,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:41,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:41,804 INFO L87 Difference]: Start difference. First operand 535 states and 891 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, (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-08 05:28:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:41,865 INFO L93 Difference]: Finished difference Result 1052 states and 1760 transitions. [2025-03-08 05:28:41,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:41,866 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, (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 107 [2025-03-08 05:28:41,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:41,873 INFO L225 Difference]: With dead ends: 1052 [2025-03-08 05:28:41,873 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 05:28:41,876 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-08 05:28:41,878 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 3 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2639 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-08 05:28:41,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2639 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:41,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 05:28:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-08 05:28:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 421 states have (on average 1.6935866983372923) internal successors, (713), 440 states have internal predecessors, (713), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:28:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 890 transitions. [2025-03-08 05:28:41,912 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 890 transitions. Word has length 107 [2025-03-08 05:28:41,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:41,912 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 890 transitions. [2025-03-08 05:28:41,912 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, (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-08 05:28:41,912 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 890 transitions. [2025-03-08 05:28:41,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:28:41,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:41,916 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-08 05:28:41,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:28:41,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:41,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:41,917 INFO L85 PathProgramCache]: Analyzing trace with hash -986102041, now seen corresponding path program 1 times [2025-03-08 05:28:41,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:41,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699809653] [2025-03-08 05:28:41,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:41,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:41,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:28:41,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:28:41,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:41,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:42,083 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-08 05:28:42,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:42,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699809653] [2025-03-08 05:28:42,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699809653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:42,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:42,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:42,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875539691] [2025-03-08 05:28:42,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:42,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:42,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:42,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:42,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:42,087 INFO L87 Difference]: Start difference. First operand 535 states and 890 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, (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-08 05:28:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:42,125 INFO L93 Difference]: Finished difference Result 1052 states and 1759 transitions. [2025-03-08 05:28:42,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:42,126 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, (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 108 [2025-03-08 05:28:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:42,131 INFO L225 Difference]: With dead ends: 1052 [2025-03-08 05:28:42,131 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 05:28:42,133 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-08 05:28:42,134 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 2 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2639 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-08 05:28:42,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2639 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 05:28:42,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-08 05:28:42,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 421 states have (on average 1.6912114014251782) internal successors, (712), 440 states have internal predecessors, (712), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:28:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 889 transitions. [2025-03-08 05:28:42,160 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 889 transitions. Word has length 108 [2025-03-08 05:28:42,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:42,160 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 889 transitions. [2025-03-08 05:28:42,160 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, (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-08 05:28:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 889 transitions. [2025-03-08 05:28:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:28:42,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:42,164 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-08 05:28:42,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:28:42,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:42,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:42,165 INFO L85 PathProgramCache]: Analyzing trace with hash 314431889, now seen corresponding path program 1 times [2025-03-08 05:28:42,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:42,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570207353] [2025-03-08 05:28:42,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:42,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:42,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:28:42,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:28:42,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:42,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:42,291 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-08 05:28:42,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:42,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570207353] [2025-03-08 05:28:42,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570207353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:42,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:42,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:42,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241569717] [2025-03-08 05:28:42,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:42,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:42,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:42,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:42,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:42,292 INFO L87 Difference]: Start difference. First operand 535 states and 889 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, (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-08 05:28:42,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:42,330 INFO L93 Difference]: Finished difference Result 1052 states and 1758 transitions. [2025-03-08 05:28:42,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:42,330 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, (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 109 [2025-03-08 05:28:42,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:42,335 INFO L225 Difference]: With dead ends: 1052 [2025-03-08 05:28:42,335 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 05:28:42,337 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-08 05:28:42,337 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 1 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2639 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-08 05:28:42,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2639 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 05:28:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-08 05:28:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 421 states have (on average 1.6888361045130642) internal successors, (711), 440 states have internal predecessors, (711), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:28:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 888 transitions. [2025-03-08 05:28:42,361 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 888 transitions. Word has length 109 [2025-03-08 05:28:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:42,362 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 888 transitions. [2025-03-08 05:28:42,362 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, (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-08 05:28:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 888 transitions. [2025-03-08 05:28:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:28:42,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:42,364 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-08 05:28:42,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:28:42,364 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:42,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:42,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1141468822, now seen corresponding path program 1 times [2025-03-08 05:28:42,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:42,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595237958] [2025-03-08 05:28:42,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:42,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:42,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:28:42,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:28:42,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:42,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:42,606 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-08 05:28:42,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:42,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595237958] [2025-03-08 05:28:42,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595237958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:42,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:42,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:28:42,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355731489] [2025-03-08 05:28:42,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:42,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:28:42,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:42,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:28:42,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:42,608 INFO L87 Difference]: Start difference. First operand 535 states and 888 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:28:42,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:42,719 INFO L93 Difference]: Finished difference Result 1018 states and 1690 transitions. [2025-03-08 05:28:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:28:42,720 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-03-08 05:28:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:42,724 INFO L225 Difference]: With dead ends: 1018 [2025-03-08 05:28:42,724 INFO L226 Difference]: Without dead ends: 550 [2025-03-08 05:28:42,726 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-08 05:28:42,727 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 91 mSDsluCounter, 6049 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6925 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:42,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6925 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-08 05:28:42,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2025-03-08 05:28:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 431 states have (on average 1.6844547563805103) internal successors, (726), 452 states have internal predecessors, (726), 92 states have call successors, (92), 23 states have call predecessors, (92), 24 states have return successors, (89), 85 states have call predecessors, (89), 87 states have call successors, (89) [2025-03-08 05:28:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 907 transitions. [2025-03-08 05:28:42,752 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 907 transitions. Word has length 110 [2025-03-08 05:28:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:42,752 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 907 transitions. [2025-03-08 05:28:42,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:28:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 907 transitions. [2025-03-08 05:28:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:28:42,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:42,759 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-08 05:28:42,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:28:42,760 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:42,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:42,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1583223317, now seen corresponding path program 1 times [2025-03-08 05:28:42,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:42,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043168741] [2025-03-08 05:28:42,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:42,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:42,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:28:42,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:28:42,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:42,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:42,868 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-08 05:28:42,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:42,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043168741] [2025-03-08 05:28:42,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043168741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:42,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:42,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:42,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136044156] [2025-03-08 05:28:42,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:42,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:42,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:42,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:42,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:42,870 INFO L87 Difference]: Start difference. First operand 548 states and 907 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, (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-08 05:28:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:42,933 INFO L93 Difference]: Finished difference Result 1070 states and 1784 transitions. [2025-03-08 05:28:42,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:42,933 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, (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 110 [2025-03-08 05:28:42,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:42,939 INFO L225 Difference]: With dead ends: 1070 [2025-03-08 05:28:42,939 INFO L226 Difference]: Without dead ends: 529 [2025-03-08 05:28:42,942 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-08 05:28:42,943 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 0 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2641 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-08 05:28:42,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2641 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:42,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-08 05:28:42,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-03-08 05:28:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 415 states have (on average 1.6795180722891567) internal successors, (697), 434 states have internal predecessors, (697), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:28:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 874 transitions. [2025-03-08 05:28:42,969 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 874 transitions. Word has length 110 [2025-03-08 05:28:42,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:42,970 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 874 transitions. [2025-03-08 05:28:42,970 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, (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-08 05:28:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 874 transitions. [2025-03-08 05:28:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 05:28:42,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:42,974 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-08 05:28:42,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:28:42,974 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:42,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:42,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1516361245, now seen corresponding path program 1 times [2025-03-08 05:28:42,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:42,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426946178] [2025-03-08 05:28:42,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:42,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:42,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 05:28:43,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 05:28:43,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:43,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:43,153 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-08 05:28:43,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:43,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426946178] [2025-03-08 05:28:43,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426946178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:43,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:43,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:43,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911650469] [2025-03-08 05:28:43,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:43,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:43,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:43,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:43,154 INFO L87 Difference]: Start difference. First operand 529 states and 874 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:28:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:43,307 INFO L93 Difference]: Finished difference Result 1015 states and 1682 transitions. [2025-03-08 05:28:43,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:43,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2025-03-08 05:28:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:43,311 INFO L225 Difference]: With dead ends: 1015 [2025-03-08 05:28:43,311 INFO L226 Difference]: Without dead ends: 538 [2025-03-08 05:28:43,313 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-08 05:28:43,313 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 55 mSDsluCounter, 3295 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4126 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-08 05:28:43,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4126 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:43,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-08 05:28:43,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 529. [2025-03-08 05:28:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 415 states have (on average 1.6698795180722892) internal successors, (693), 434 states have internal predecessors, (693), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:28:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 870 transitions. [2025-03-08 05:28:43,329 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 870 transitions. Word has length 111 [2025-03-08 05:28:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:43,329 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 870 transitions. [2025-03-08 05:28:43,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:28:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 870 transitions. [2025-03-08 05:28:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:28:43,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:43,332 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-08 05:28:43,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:28:43,332 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:43,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1381982573, now seen corresponding path program 1 times [2025-03-08 05:28:43,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:43,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53882700] [2025-03-08 05:28:43,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:43,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:28:43,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:28:43,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:43,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:43,460 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-08 05:28:43,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:43,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53882700] [2025-03-08 05:28:43,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53882700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:43,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:43,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:43,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816120650] [2025-03-08 05:28:43,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:43,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:43,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:43,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:43,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:43,462 INFO L87 Difference]: Start difference. First operand 529 states and 870 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:28:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:43,604 INFO L93 Difference]: Finished difference Result 1015 states and 1678 transitions. [2025-03-08 05:28:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:43,605 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 112 [2025-03-08 05:28:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:43,610 INFO L225 Difference]: With dead ends: 1015 [2025-03-08 05:28:43,610 INFO L226 Difference]: Without dead ends: 538 [2025-03-08 05:28:43,612 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-08 05:28:43,615 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 54 mSDsluCounter, 3295 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4126 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-08 05:28:43,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4126 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:43,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-08 05:28:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 529. [2025-03-08 05:28:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 415 states have (on average 1.6602409638554216) internal successors, (689), 434 states have internal predecessors, (689), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:28:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 866 transitions. [2025-03-08 05:28:43,641 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 866 transitions. Word has length 112 [2025-03-08 05:28:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:43,641 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 866 transitions. [2025-03-08 05:28:43,641 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:28:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 866 transitions. [2025-03-08 05:28:43,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:28:43,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:43,645 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-08 05:28:43,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:28:43,645 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:43,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:43,646 INFO L85 PathProgramCache]: Analyzing trace with hash 718144762, now seen corresponding path program 1 times [2025-03-08 05:28:43,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:43,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782150775] [2025-03-08 05:28:43,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:43,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:43,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:28:43,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:28:43,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:43,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:43,816 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-08 05:28:43,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:43,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782150775] [2025-03-08 05:28:43,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782150775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:43,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:43,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:43,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466775016] [2025-03-08 05:28:43,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:43,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:43,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:43,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:43,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:43,819 INFO L87 Difference]: Start difference. First operand 529 states and 866 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:28:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:43,992 INFO L93 Difference]: Finished difference Result 1015 states and 1674 transitions. [2025-03-08 05:28:43,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:43,996 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2025-03-08 05:28:43,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:44,003 INFO L225 Difference]: With dead ends: 1015 [2025-03-08 05:28:44,004 INFO L226 Difference]: Without dead ends: 538 [2025-03-08 05:28:44,008 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-08 05:28:44,008 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 53 mSDsluCounter, 3278 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4108 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-08 05:28:44,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4108 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:44,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-08 05:28:44,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 529. [2025-03-08 05:28:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 415 states have (on average 1.6506024096385543) internal successors, (685), 434 states have internal predecessors, (685), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:28:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 862 transitions. [2025-03-08 05:28:44,035 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 862 transitions. Word has length 113 [2025-03-08 05:28:44,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:44,036 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 862 transitions. [2025-03-08 05:28:44,036 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:28:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 862 transitions. [2025-03-08 05:28:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:28:44,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:44,040 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-08 05:28:44,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:28:44,040 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:44,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:44,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1291548373, now seen corresponding path program 1 times [2025-03-08 05:28:44,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:44,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453221046] [2025-03-08 05:28:44,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:44,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:28:44,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:28:44,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:44,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:44,176 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-08 05:28:44,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:44,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453221046] [2025-03-08 05:28:44,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453221046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:44,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:44,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:28:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026020109] [2025-03-08 05:28:44,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:44,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:28:44,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:44,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:28:44,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:44,177 INFO L87 Difference]: Start difference. First operand 529 states and 862 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:28:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:44,231 INFO L93 Difference]: Finished difference Result 1006 states and 1656 transitions. [2025-03-08 05:28:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:28:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2025-03-08 05:28:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:44,236 INFO L225 Difference]: With dead ends: 1006 [2025-03-08 05:28:44,236 INFO L226 Difference]: Without dead ends: 508 [2025-03-08 05:28:44,238 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-08 05:28:44,238 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 84 mSDsluCounter, 4182 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5033 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-08 05:28:44,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5033 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:44,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-08 05:28:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-03-08 05:28:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 394 states have (on average 1.6522842639593909) internal successors, (651), 413 states have internal predecessors, (651), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:28:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 828 transitions. [2025-03-08 05:28:44,253 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 828 transitions. Word has length 113 [2025-03-08 05:28:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:44,254 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 828 transitions. [2025-03-08 05:28:44,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:28:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 828 transitions. [2025-03-08 05:28:44,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:28:44,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:44,256 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-08 05:28:44,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:28:44,256 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:44,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:44,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1142912112, now seen corresponding path program 1 times [2025-03-08 05:28:44,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:44,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599588581] [2025-03-08 05:28:44,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:44,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:44,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:28:44,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:28:44,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:44,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:44,379 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-08 05:28:44,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:44,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599588581] [2025-03-08 05:28:44,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599588581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:44,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:44,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:44,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612030938] [2025-03-08 05:28:44,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:44,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:44,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:44,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:44,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:44,381 INFO L87 Difference]: Start difference. First operand 508 states and 828 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:28:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:44,443 INFO L93 Difference]: Finished difference Result 985 states and 1622 transitions. [2025-03-08 05:28:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:44,444 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2025-03-08 05:28:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:44,447 INFO L225 Difference]: With dead ends: 985 [2025-03-08 05:28:44,448 INFO L226 Difference]: Without dead ends: 508 [2025-03-08 05:28:44,449 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-08 05:28:44,450 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 17 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4046 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-08 05:28:44,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4046 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:44,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-08 05:28:44,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-03-08 05:28:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 394 states have (on average 1.649746192893401) internal successors, (650), 413 states have internal predecessors, (650), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:28:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 827 transitions. [2025-03-08 05:28:44,465 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 827 transitions. Word has length 114 [2025-03-08 05:28:44,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:44,466 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 827 transitions. [2025-03-08 05:28:44,466 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:28:44,466 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 827 transitions. [2025-03-08 05:28:44,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:28:44,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:44,468 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-08 05:28:44,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:28:44,469 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:44,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:44,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1246627881, now seen corresponding path program 1 times [2025-03-08 05:28:44,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:44,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791300757] [2025-03-08 05:28:44,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:44,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:44,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:28:44,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:28:44,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:44,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:44,576 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-08 05:28:44,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:44,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791300757] [2025-03-08 05:28:44,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791300757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:44,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:44,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:44,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24204053] [2025-03-08 05:28:44,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:44,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:44,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:44,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:44,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:44,578 INFO L87 Difference]: Start difference. First operand 508 states and 827 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:28:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:44,634 INFO L93 Difference]: Finished difference Result 985 states and 1621 transitions. [2025-03-08 05:28:44,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:44,635 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2025-03-08 05:28:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:44,638 INFO L225 Difference]: With dead ends: 985 [2025-03-08 05:28:44,638 INFO L226 Difference]: Without dead ends: 508 [2025-03-08 05:28:44,640 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-08 05:28:44,641 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 16 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4046 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-08 05:28:44,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4046 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:44,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-08 05:28:44,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-03-08 05:28:44,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 394 states have (on average 1.6472081218274113) internal successors, (649), 413 states have internal predecessors, (649), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:28:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 826 transitions. [2025-03-08 05:28:44,655 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 826 transitions. Word has length 115 [2025-03-08 05:28:44,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:44,655 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 826 transitions. [2025-03-08 05:28:44,655 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:28:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 826 transitions. [2025-03-08 05:28:44,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:28:44,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:44,657 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-08 05:28:44,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:28:44,658 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:44,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:44,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1587623053, now seen corresponding path program 1 times [2025-03-08 05:28:44,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:44,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682580599] [2025-03-08 05:28:44,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:44,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:44,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:28:44,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:28:44,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:44,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:44,850 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-08 05:28:44,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:44,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682580599] [2025-03-08 05:28:44,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682580599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:44,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:44,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:28:44,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887182256] [2025-03-08 05:28:44,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:44,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:28:44,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:44,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:28:44,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:28:44,851 INFO L87 Difference]: Start difference. First operand 508 states and 826 transitions. Second operand has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:28:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:44,939 INFO L93 Difference]: Finished difference Result 979 states and 1609 transitions. [2025-03-08 05:28:44,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:28:44,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2025-03-08 05:28:44,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:44,943 INFO L225 Difference]: With dead ends: 979 [2025-03-08 05:28:44,943 INFO L226 Difference]: Without dead ends: 508 [2025-03-08 05:28:44,945 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-08 05:28:44,945 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 6 mSDsluCounter, 6458 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7268 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-08 05:28:44,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7268 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:44,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-08 05:28:44,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-03-08 05:28:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 394 states have (on average 1.6446700507614214) internal successors, (648), 413 states have internal predecessors, (648), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:28:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 825 transitions. [2025-03-08 05:28:44,961 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 825 transitions. Word has length 116 [2025-03-08 05:28:44,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:44,961 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 825 transitions. [2025-03-08 05:28:44,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:28:44,961 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 825 transitions. [2025-03-08 05:28:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:28:44,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:44,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:44,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:28:44,964 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:44,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:44,964 INFO L85 PathProgramCache]: Analyzing trace with hash 851483780, now seen corresponding path program 1 times [2025-03-08 05:28:44,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:44,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686189362] [2025-03-08 05:28:44,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:44,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:44,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:28:44,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:28:44,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:44,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:45,066 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-08 05:28:45,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:45,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686189362] [2025-03-08 05:28:45,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686189362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:28:45,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636308056] [2025-03-08 05:28:45,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:45,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:28:45,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:45,069 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-08 05:28:45,070 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-08 05:28:45,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:28:45,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:28:45,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:45,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:45,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:28:45,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:28:45,385 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-08 05:28:45,385 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:28:45,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636308056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:45,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:28:45,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:28:45,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695874267] [2025-03-08 05:28:45,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:45,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:28:45,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:45,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:28:45,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:45,387 INFO L87 Difference]: Start difference. First operand 508 states and 825 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:28:45,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:45,449 INFO L93 Difference]: Finished difference Result 1425 states and 2372 transitions. [2025-03-08 05:28:45,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:28:45,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 117 [2025-03-08 05:28:45,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:45,476 INFO L225 Difference]: With dead ends: 1425 [2025-03-08 05:28:45,476 INFO L226 Difference]: Without dead ends: 962 [2025-03-08 05:28:45,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:45,478 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 810 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:45,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1704 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:45,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-03-08 05:28:45,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 960. [2025-03-08 05:28:45,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 746 states have (on average 1.6675603217158177) internal successors, (1244), 779 states have internal predecessors, (1244), 172 states have call successors, (172), 41 states have call predecessors, (172), 41 states have return successors, (177), 165 states have call predecessors, (177), 167 states have call successors, (177) [2025-03-08 05:28:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1593 transitions. [2025-03-08 05:28:45,512 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1593 transitions. Word has length 117 [2025-03-08 05:28:45,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:45,512 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1593 transitions. [2025-03-08 05:28:45,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:28:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1593 transitions. [2025-03-08 05:28:45,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:28:45,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:45,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:45,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:28:45,716 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-08 05:28:45,716 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:45,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:45,716 INFO L85 PathProgramCache]: Analyzing trace with hash 626023921, now seen corresponding path program 1 times [2025-03-08 05:28:45,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:45,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653247519] [2025-03-08 05:28:45,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:45,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:45,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:28:45,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:28:45,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:45,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:45,820 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-08 05:28:45,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:45,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653247519] [2025-03-08 05:28:45,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653247519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:28:45,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148218399] [2025-03-08 05:28:45,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:45,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:28:45,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:45,823 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-08 05:28:45,824 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-08 05:28:45,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:28:46,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:28:46,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:46,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:46,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:28:46,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:28:46,136 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-08 05:28:46,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:28:46,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148218399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:46,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:28:46,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:28:46,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186016663] [2025-03-08 05:28:46,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:46,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:28:46,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:46,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:28:46,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:46,137 INFO L87 Difference]: Start difference. First operand 960 states and 1593 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:28:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:46,204 INFO L93 Difference]: Finished difference Result 2783 states and 4694 transitions. [2025-03-08 05:28:46,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:28:46,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 118 [2025-03-08 05:28:46,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:46,217 INFO L225 Difference]: With dead ends: 2783 [2025-03-08 05:28:46,217 INFO L226 Difference]: Without dead ends: 1868 [2025-03-08 05:28:46,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:46,222 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 809 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:46,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1664 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2025-03-08 05:28:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1865. [2025-03-08 05:28:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1451 states have (on average 1.6795313576843556) internal successors, (2437), 1512 states have internal predecessors, (2437), 334 states have call successors, (334), 77 states have call predecessors, (334), 79 states have return successors, (371), 327 states have call predecessors, (371), 329 states have call successors, (371) [2025-03-08 05:28:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 3142 transitions. [2025-03-08 05:28:46,296 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 3142 transitions. Word has length 118 [2025-03-08 05:28:46,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:46,297 INFO L471 AbstractCegarLoop]: Abstraction has 1865 states and 3142 transitions. [2025-03-08 05:28:46,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:28:46,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 3142 transitions. [2025-03-08 05:28:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:28:46,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:46,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:46,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:28:46,501 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-08 05:28:46,502 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:46,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2068268194, now seen corresponding path program 1 times [2025-03-08 05:28:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:46,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553226233] [2025-03-08 05:28:46,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:46,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:46,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:28:46,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:28:46,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:46,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:46,635 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-08 05:28:46,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:46,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553226233] [2025-03-08 05:28:46,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553226233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:28:46,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596831802] [2025-03-08 05:28:46,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:46,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:28:46,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:46,638 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-08 05:28:46,641 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-08 05:28:46,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:28:46,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:28:46,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:46,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:46,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:28:46,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:28:46,964 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-08 05:28:46,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:28:46,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596831802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:46,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:28:46,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:28:46,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453715651] [2025-03-08 05:28:46,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:46,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:28:46,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:46,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:28:46,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:46,966 INFO L87 Difference]: Start difference. First operand 1865 states and 3142 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:28:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:47,087 INFO L93 Difference]: Finished difference Result 5500 states and 9392 transitions. [2025-03-08 05:28:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:28:47,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 119 [2025-03-08 05:28:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:47,118 INFO L225 Difference]: With dead ends: 5500 [2025-03-08 05:28:47,119 INFO L226 Difference]: Without dead ends: 3680 [2025-03-08 05:28:47,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:47,131 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 807 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:47,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1659 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:47,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2025-03-08 05:28:47,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3676. [2025-03-08 05:28:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3676 states, 2862 states have (on average 1.6851851851851851) internal successors, (4823), 2979 states have internal predecessors, (4823), 658 states have call successors, (658), 149 states have call predecessors, (658), 155 states have return successors, (795), 651 states have call predecessors, (795), 653 states have call successors, (795) [2025-03-08 05:28:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 3676 states and 6276 transitions. [2025-03-08 05:28:47,306 INFO L78 Accepts]: Start accepts. Automaton has 3676 states and 6276 transitions. Word has length 119 [2025-03-08 05:28:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:47,306 INFO L471 AbstractCegarLoop]: Abstraction has 3676 states and 6276 transitions. [2025-03-08 05:28:47,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:28:47,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3676 states and 6276 transitions. [2025-03-08 05:28:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:28:47,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:47,310 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:47,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:28:47,510 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-08 05:28:47,511 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:47,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:47,512 INFO L85 PathProgramCache]: Analyzing trace with hash 308018379, now seen corresponding path program 1 times [2025-03-08 05:28:47,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:47,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422301179] [2025-03-08 05:28:47,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:47,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:47,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:28:47,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:28:47,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:47,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:47,628 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-08 05:28:47,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:47,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422301179] [2025-03-08 05:28:47,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422301179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:28:47,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147808039] [2025-03-08 05:28:47,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:47,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:28:47,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:47,631 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-08 05:28:47,633 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-08 05:28:47,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:28:47,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:28:47,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:47,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:47,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 1460 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:28:47,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:28:47,933 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-08 05:28:47,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:28:47,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147808039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:47,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:28:47,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:28:47,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640603519] [2025-03-08 05:28:47,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:47,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:28:47,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:47,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:28:47,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:47,935 INFO L87 Difference]: Start difference. First operand 3676 states and 6276 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:28:48,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:48,134 INFO L93 Difference]: Finished difference Result 10935 states and 18965 transitions. [2025-03-08 05:28:48,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:28:48,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 120 [2025-03-08 05:28:48,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:48,193 INFO L225 Difference]: With dead ends: 10935 [2025-03-08 05:28:48,193 INFO L226 Difference]: Without dead ends: 7304 [2025-03-08 05:28:48,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:48,216 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 806 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:48,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1690 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:48,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7304 states. [2025-03-08 05:28:48,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7304 to 7299. [2025-03-08 05:28:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7299 states, 5685 states have (on average 1.6874230430958663) internal successors, (9593), 5914 states have internal predecessors, (9593), 1306 states have call successors, (1306), 293 states have call predecessors, (1306), 307 states have return successors, (1763), 1299 states have call predecessors, (1763), 1301 states have call successors, (1763) [2025-03-08 05:28:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7299 states to 7299 states and 12662 transitions. [2025-03-08 05:28:48,571 INFO L78 Accepts]: Start accepts. Automaton has 7299 states and 12662 transitions. Word has length 120 [2025-03-08 05:28:48,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:48,571 INFO L471 AbstractCegarLoop]: Abstraction has 7299 states and 12662 transitions. [2025-03-08 05:28:48,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:28:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 7299 states and 12662 transitions. [2025-03-08 05:28:48,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:28:48,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:48,576 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:48,584 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-08 05:28:48,776 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-08 05:28:48,777 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:48,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:48,777 INFO L85 PathProgramCache]: Analyzing trace with hash 958454328, now seen corresponding path program 1 times [2025-03-08 05:28:48,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:48,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976784894] [2025-03-08 05:28:48,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:48,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:48,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:28:48,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:28:48,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:48,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:48,882 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-08 05:28:48,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:48,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976784894] [2025-03-08 05:28:48,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976784894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:28:48,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528642234] [2025-03-08 05:28:48,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:48,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:28:48,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:48,885 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-08 05:28:48,886 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-08 05:28:49,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:28:49,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:28:49,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:49,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:49,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:28:49,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:28:49,183 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-08 05:28:49,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:28:49,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528642234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:49,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:28:49,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:28:49,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860551296] [2025-03-08 05:28:49,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:49,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:28:49,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:49,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:28:49,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:49,185 INFO L87 Difference]: Start difference. First operand 7299 states and 12662 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:28:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:49,634 INFO L93 Difference]: Finished difference Result 21806 states and 38749 transitions. [2025-03-08 05:28:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:28:49,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 121 [2025-03-08 05:28:49,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:49,752 INFO L225 Difference]: With dead ends: 21806 [2025-03-08 05:28:49,752 INFO L226 Difference]: Without dead ends: 14544 [2025-03-08 05:28:49,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:49,796 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 805 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:49,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1707 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14544 states. [2025-03-08 05:28:50,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14544 to 14538. [2025-03-08 05:28:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14538 states, 11325 states have (on average 1.687682119205298) internal successors, (19113), 11778 states have internal predecessors, (19113), 2602 states have call successors, (2602), 581 states have call predecessors, (2602), 610 states have return successors, (4130), 2594 states have call predecessors, (4130), 2597 states have call successors, (4130) [2025-03-08 05:28:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14538 states to 14538 states and 25845 transitions. [2025-03-08 05:28:50,461 INFO L78 Accepts]: Start accepts. Automaton has 14538 states and 25845 transitions. Word has length 121 [2025-03-08 05:28:50,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:50,462 INFO L471 AbstractCegarLoop]: Abstraction has 14538 states and 25845 transitions. [2025-03-08 05:28:50,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:28:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 14538 states and 25845 transitions. [2025-03-08 05:28:50,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:28:50,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:50,485 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2025-03-08 05:28:50,495 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-08 05:28:50,686 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-08 05:28:50,686 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:50,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:50,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1045788503, now seen corresponding path program 1 times [2025-03-08 05:28:50,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:50,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550368154] [2025-03-08 05:28:50,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:50,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:50,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:28:50,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:28:50,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:50,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 05:28:50,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:50,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550368154] [2025-03-08 05:28:50,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550368154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:50,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:50,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:50,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364006308] [2025-03-08 05:28:50,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:50,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:50,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:50,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:50,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:50,813 INFO L87 Difference]: Start difference. First operand 14538 states and 25845 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:28:51,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:51,811 INFO L93 Difference]: Finished difference Result 29159 states and 53464 transitions. [2025-03-08 05:28:51,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:51,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) Word has length 182 [2025-03-08 05:28:51,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:51,909 INFO L225 Difference]: With dead ends: 29159 [2025-03-08 05:28:51,909 INFO L226 Difference]: Without dead ends: 14666 [2025-03-08 05:28:51,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:51,988 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 819 mSDsluCounter, 2212 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:51,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 3019 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:28:52,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14666 states. [2025-03-08 05:28:52,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14666 to 14666. [2025-03-08 05:28:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14666 states, 11421 states have (on average 1.6819017599159443) internal successors, (19209), 11874 states have internal predecessors, (19209), 2602 states have call successors, (2602), 613 states have call predecessors, (2602), 642 states have return successors, (4162), 2594 states have call predecessors, (4162), 2597 states have call successors, (4162) [2025-03-08 05:28:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14666 states to 14666 states and 25973 transitions. [2025-03-08 05:28:52,714 INFO L78 Accepts]: Start accepts. Automaton has 14666 states and 25973 transitions. Word has length 182 [2025-03-08 05:28:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:52,714 INFO L471 AbstractCegarLoop]: Abstraction has 14666 states and 25973 transitions. [2025-03-08 05:28:52,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:28:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 14666 states and 25973 transitions. [2025-03-08 05:28:52,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 05:28:52,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:52,746 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2025-03-08 05:28:52,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:28:52,747 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:52,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:52,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2049612900, now seen corresponding path program 1 times [2025-03-08 05:28:52,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:52,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506657451] [2025-03-08 05:28:52,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:52,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:52,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 05:28:52,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 05:28:52,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:52,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 05:28:52,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:52,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506657451] [2025-03-08 05:28:52,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506657451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:52,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:52,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:52,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119889927] [2025-03-08 05:28:52,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:52,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:52,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:52,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:52,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:52,931 INFO L87 Difference]: Start difference. First operand 14666 states and 25973 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:28:53,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:53,866 INFO L93 Difference]: Finished difference Result 29447 states and 53688 transitions. [2025-03-08 05:28:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:53,867 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) Word has length 183 [2025-03-08 05:28:53,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:54,117 INFO L225 Difference]: With dead ends: 29447 [2025-03-08 05:28:54,117 INFO L226 Difference]: Without dead ends: 14826 [2025-03-08 05:28:54,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:54,170 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 818 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:54,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 3025 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:28:54,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14826 states. [2025-03-08 05:28:54,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14826 to 14826. [2025-03-08 05:28:54,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14826 states, 11549 states have (on average 1.6743440990561953) internal successors, (19337), 12002 states have internal predecessors, (19337), 2602 states have call successors, (2602), 645 states have call predecessors, (2602), 674 states have return successors, (4194), 2594 states have call predecessors, (4194), 2597 states have call successors, (4194) [2025-03-08 05:28:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14826 states to 14826 states and 26133 transitions. [2025-03-08 05:28:54,612 INFO L78 Accepts]: Start accepts. Automaton has 14826 states and 26133 transitions. Word has length 183 [2025-03-08 05:28:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:54,613 INFO L471 AbstractCegarLoop]: Abstraction has 14826 states and 26133 transitions. [2025-03-08 05:28:54,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:28:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 14826 states and 26133 transitions. [2025-03-08 05:28:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-08 05:28:54,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:54,630 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2025-03-08 05:28:54,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:28:54,630 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:54,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:54,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1088704134, now seen corresponding path program 1 times [2025-03-08 05:28:54,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:54,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601155156] [2025-03-08 05:28:54,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:54,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:54,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 05:28:54,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 05:28:54,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:54,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 05:28:54,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:54,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601155156] [2025-03-08 05:28:54,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601155156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:54,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:54,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:54,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213223471] [2025-03-08 05:28:54,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:54,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:54,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:54,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:54,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:54,832 INFO L87 Difference]: Start difference. First operand 14826 states and 26133 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:28:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:55,477 INFO L93 Difference]: Finished difference Result 29799 states and 53976 transitions. [2025-03-08 05:28:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:55,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) Word has length 184 [2025-03-08 05:28:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:55,600 INFO L225 Difference]: With dead ends: 29799 [2025-03-08 05:28:55,601 INFO L226 Difference]: Without dead ends: 15018 [2025-03-08 05:28:55,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:55,684 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 818 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:55,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 3025 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:28:55,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15018 states. [2025-03-08 05:28:56,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15018 to 15018. [2025-03-08 05:28:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15018 states, 11709 states have (on average 1.6651293876505253) internal successors, (19497), 12162 states have internal predecessors, (19497), 2602 states have call successors, (2602), 677 states have call predecessors, (2602), 706 states have return successors, (4226), 2594 states have call predecessors, (4226), 2597 states have call successors, (4226) [2025-03-08 05:28:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15018 states to 15018 states and 26325 transitions. [2025-03-08 05:28:56,230 INFO L78 Accepts]: Start accepts. Automaton has 15018 states and 26325 transitions. Word has length 184 [2025-03-08 05:28:56,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:56,231 INFO L471 AbstractCegarLoop]: Abstraction has 15018 states and 26325 transitions. [2025-03-08 05:28:56,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:28:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 15018 states and 26325 transitions. [2025-03-08 05:28:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 05:28:56,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:56,247 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2025-03-08 05:28:56,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:28:56,247 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:56,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:56,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1063768287, now seen corresponding path program 1 times [2025-03-08 05:28:56,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:56,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632609369] [2025-03-08 05:28:56,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:56,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:56,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 05:28:56,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 05:28:56,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:56,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 05:28:56,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:56,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632609369] [2025-03-08 05:28:56,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632609369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:56,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:56,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:56,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265236845] [2025-03-08 05:28:56,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:56,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:56,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:56,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:56,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:56,363 INFO L87 Difference]: Start difference. First operand 15018 states and 26325 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:28:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:57,206 INFO L93 Difference]: Finished difference Result 30215 states and 54328 transitions. [2025-03-08 05:28:57,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:57,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) Word has length 185 [2025-03-08 05:28:57,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:57,346 INFO L225 Difference]: With dead ends: 30215 [2025-03-08 05:28:57,346 INFO L226 Difference]: Without dead ends: 15242 [2025-03-08 05:28:57,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:57,444 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 818 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:57,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 3025 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:28:57,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2025-03-08 05:28:58,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 15242. [2025-03-08 05:28:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15242 states, 11901 states have (on average 1.6543987900176456) internal successors, (19689), 12354 states have internal predecessors, (19689), 2602 states have call successors, (2602), 709 states have call predecessors, (2602), 738 states have return successors, (4258), 2594 states have call predecessors, (4258), 2597 states have call successors, (4258) [2025-03-08 05:28:58,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15242 states to 15242 states and 26549 transitions. [2025-03-08 05:28:58,151 INFO L78 Accepts]: Start accepts. Automaton has 15242 states and 26549 transitions. Word has length 185 [2025-03-08 05:28:58,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:58,152 INFO L471 AbstractCegarLoop]: Abstraction has 15242 states and 26549 transitions. [2025-03-08 05:28:58,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:28:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 15242 states and 26549 transitions. [2025-03-08 05:28:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 05:28:58,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:58,166 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2025-03-08 05:28:58,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:28:58,167 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:58,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:58,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1500008349, now seen corresponding path program 1 times [2025-03-08 05:28:58,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:58,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681202890] [2025-03-08 05:28:58,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:58,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:58,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 05:28:58,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 05:28:58,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:58,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 05:28:58,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:58,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681202890] [2025-03-08 05:28:58,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681202890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:58,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:58,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:28:58,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891235049] [2025-03-08 05:28:58,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:58,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:28:58,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:58,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:28:58,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:28:58,495 INFO L87 Difference]: Start difference. First operand 15242 states and 26549 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 8 states have internal predecessors, (116), 5 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-08 05:29:04,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:04,292 INFO L93 Difference]: Finished difference Result 68070 states and 130690 transitions. [2025-03-08 05:29:04,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 05:29:04,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 8 states have internal predecessors, (116), 5 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22) Word has length 186 [2025-03-08 05:29:04,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:04,828 INFO L225 Difference]: With dead ends: 68070 [2025-03-08 05:29:04,828 INFO L226 Difference]: Without dead ends: 52873 [2025-03-08 05:29:04,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:29:04,979 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 2497 mSDsluCounter, 4406 mSDsCounter, 0 mSdLazyCounter, 10052 mSolverCounterSat, 616 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2605 SdHoareTripleChecker+Valid, 5279 SdHoareTripleChecker+Invalid, 10668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 616 IncrementalHoareTripleChecker+Valid, 10052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:04,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2605 Valid, 5279 Invalid, 10668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [616 Valid, 10052 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-08 05:29:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52873 states. [2025-03-08 05:29:07,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52873 to 51600. [2025-03-08 05:29:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51600 states, 39168 states have (on average 1.6365145016339868) internal successors, (64099), 40901 states have internal predecessors, (64099), 9932 states have call successors, (9932), 2118 states have call predecessors, (9932), 2499 states have return successors, (23042), 10148 states have call predecessors, (23042), 9927 states have call successors, (23042) [2025-03-08 05:29:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51600 states to 51600 states and 97073 transitions. [2025-03-08 05:29:08,141 INFO L78 Accepts]: Start accepts. Automaton has 51600 states and 97073 transitions. Word has length 186 [2025-03-08 05:29:08,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:08,142 INFO L471 AbstractCegarLoop]: Abstraction has 51600 states and 97073 transitions. [2025-03-08 05:29:08,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 8 states have internal predecessors, (116), 5 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-08 05:29:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 51600 states and 97073 transitions. [2025-03-08 05:29:08,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 05:29:08,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:08,215 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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-08 05:29:08,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:29:08,216 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:08,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:08,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1138257716, now seen corresponding path program 1 times [2025-03-08 05:29:08,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:08,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498251496] [2025-03-08 05:29:08,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:08,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:08,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 05:29:08,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 05:29:08,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:08,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 05:29:08,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:08,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498251496] [2025-03-08 05:29:08,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498251496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:08,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:08,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:29:08,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189458589] [2025-03-08 05:29:08,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:08,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:29:08,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:08,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:29:08,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:08,364 INFO L87 Difference]: Start difference. First operand 51600 states and 97073 transitions. Second operand has 8 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:29:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:09,656 INFO L93 Difference]: Finished difference Result 66645 states and 123292 transitions. [2025-03-08 05:29:09,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:29:09,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 193 [2025-03-08 05:29:09,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:09,753 INFO L225 Difference]: With dead ends: 66645 [2025-03-08 05:29:09,753 INFO L226 Difference]: Without dead ends: 15079 [2025-03-08 05:29:09,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:29:09,947 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 8 mSDsluCounter, 4807 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 5612 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:09,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 5612 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15079 states. [2025-03-08 05:29:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15079 to 15079. [2025-03-08 05:29:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15079 states, 11802 states have (on average 1.6541264192509744) internal successors, (19522), 12255 states have internal predecessors, (19522), 2538 states have call successors, (2538), 709 states have call predecessors, (2538), 738 states have return successors, (4194), 2530 states have call predecessors, (4194), 2533 states have call successors, (4194) [2025-03-08 05:29:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15079 states to 15079 states and 26254 transitions. [2025-03-08 05:29:10,625 INFO L78 Accepts]: Start accepts. Automaton has 15079 states and 26254 transitions. Word has length 193 [2025-03-08 05:29:10,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:10,625 INFO L471 AbstractCegarLoop]: Abstraction has 15079 states and 26254 transitions. [2025-03-08 05:29:10,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-08 05:29:10,625 INFO L276 IsEmpty]: Start isEmpty. Operand 15079 states and 26254 transitions. [2025-03-08 05:29:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 05:29:10,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:10,636 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2025-03-08 05:29:10,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 05:29:10,636 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:10,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:10,637 INFO L85 PathProgramCache]: Analyzing trace with hash -357433880, now seen corresponding path program 1 times [2025-03-08 05:29:10,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:10,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91386204] [2025-03-08 05:29:10,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:10,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:10,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 05:29:10,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 05:29:10,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:10,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 05:29:10,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:10,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91386204] [2025-03-08 05:29:10,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91386204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:10,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:10,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:29:10,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889128044] [2025-03-08 05:29:10,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:10,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:29:10,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:10,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:29:10,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:29:10,841 INFO L87 Difference]: Start difference. First operand 15079 states and 26254 transitions. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 8 states have internal predecessors, (121), 5 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:29:12,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:12,448 INFO L93 Difference]: Finished difference Result 30244 states and 53809 transitions. [2025-03-08 05:29:12,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:29:12,449 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 8 states have internal predecessors, (121), 5 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23) Word has length 192 [2025-03-08 05:29:12,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:12,563 INFO L225 Difference]: With dead ends: 30244 [2025-03-08 05:29:12,564 INFO L226 Difference]: Without dead ends: 15207 [2025-03-08 05:29:12,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:29:12,629 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1236 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 3177 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 3512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 3177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:12,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 1719 Invalid, 3512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 3177 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 05:29:12,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15207 states. [2025-03-08 05:29:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15207 to 15207. [2025-03-08 05:29:13,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15207 states, 11898 states have (on average 1.6488485459741133) internal successors, (19618), 12351 states have internal predecessors, (19618), 2538 states have call successors, (2538), 709 states have call predecessors, (2538), 770 states have return successors, (4354), 2562 states have call predecessors, (4354), 2533 states have call successors, (4354) [2025-03-08 05:29:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15207 states to 15207 states and 26510 transitions. [2025-03-08 05:29:13,496 INFO L78 Accepts]: Start accepts. Automaton has 15207 states and 26510 transitions. Word has length 192 [2025-03-08 05:29:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:13,496 INFO L471 AbstractCegarLoop]: Abstraction has 15207 states and 26510 transitions. [2025-03-08 05:29:13,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 8 states have internal predecessors, (121), 5 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:29:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 15207 states and 26510 transitions. [2025-03-08 05:29:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 05:29:13,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:13,509 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2025-03-08 05:29:13,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 05:29:13,510 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:13,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1596452973, now seen corresponding path program 1 times [2025-03-08 05:29:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:13,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068898485] [2025-03-08 05:29:13,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:13,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:13,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 05:29:13,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 05:29:13,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:13,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-08 05:29:13,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:13,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068898485] [2025-03-08 05:29:13,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068898485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:13,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:13,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:29:13,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530421494] [2025-03-08 05:29:13,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:13,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:29:13,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:13,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:29:13,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:13,703 INFO L87 Difference]: Start difference. First operand 15207 states and 26510 transitions. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 5 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:29:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:17,587 INFO L93 Difference]: Finished difference Result 59775 states and 108603 transitions. [2025-03-08 05:29:17,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 05:29:17,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 5 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23) Word has length 193 [2025-03-08 05:29:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:17,980 INFO L225 Difference]: With dead ends: 59775 [2025-03-08 05:29:17,980 INFO L226 Difference]: Without dead ends: 44610 [2025-03-08 05:29:18,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:29:18,102 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 3301 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 4791 mSolverCounterSat, 891 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3371 SdHoareTripleChecker+Valid, 2190 SdHoareTripleChecker+Invalid, 5682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 891 IncrementalHoareTripleChecker+Valid, 4791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:18,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3371 Valid, 2190 Invalid, 5682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [891 Valid, 4791 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 05:29:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44610 states. [2025-03-08 05:29:19,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44610 to 44206. [2025-03-08 05:29:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44206 states, 34500 states have (on average 1.617913043478261) internal successors, (55818), 35848 states have internal predecessors, (55818), 7400 states have call successors, (7400), 2213 states have call predecessors, (7400), 2305 states have return successors, (14944), 7297 states have call predecessors, (14944), 7395 states have call successors, (14944) [2025-03-08 05:29:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44206 states to 44206 states and 78162 transitions. [2025-03-08 05:29:20,286 INFO L78 Accepts]: Start accepts. Automaton has 44206 states and 78162 transitions. Word has length 193 [2025-03-08 05:29:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:20,286 INFO L471 AbstractCegarLoop]: Abstraction has 44206 states and 78162 transitions. [2025-03-08 05:29:20,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 5 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:29:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 44206 states and 78162 transitions. [2025-03-08 05:29:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 05:29:20,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:20,296 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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-08 05:29:20,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 05:29:20,296 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:20,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:20,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1603484098, now seen corresponding path program 1 times [2025-03-08 05:29:20,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:20,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732431031] [2025-03-08 05:29:20,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:20,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:20,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 05:29:20,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 05:29:20,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:20,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-03-08 05:29:20,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:20,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732431031] [2025-03-08 05:29:20,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732431031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:20,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:20,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:29:20,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610107683] [2025-03-08 05:29:20,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:20,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:29:20,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:20,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:29:20,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:20,437 INFO L87 Difference]: Start difference. First operand 44206 states and 78162 transitions. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 5 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 05:29:29,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:29,824 INFO L93 Difference]: Finished difference Result 160339 states and 339919 transitions. [2025-03-08 05:29:29,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:29:29,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 5 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) Word has length 195 [2025-03-08 05:29:29,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted.