./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 bf5a3f22f9d7a0aaa2c9864b464fdc1b701547a697c01ddf6ee0cf69e3554ef9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:48:13,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:48:13,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:48:13,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:48:13,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:48:13,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:48:13,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:48:13,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:48:13,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:48:13,856 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:48:13,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:48:13,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:48:13,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:48:13,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:48:13,857 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:48:13,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:48:13,857 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:48:13,857 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:48:13,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:48:13,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:48:13,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:48:13,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:48:13,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:48:13,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:48:13,857 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:48:13,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:48:13,857 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:48:13,858 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:13,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:13,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:48:13,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:48:13,859 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-jdk21/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 -> bf5a3f22f9d7a0aaa2c9864b464fdc1b701547a697c01ddf6ee0cf69e3554ef9 [2025-01-09 03:48:14,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:48:14,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:48:14,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:48:14,084 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:48:14,084 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:48:14,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c [2025-01-09 03:48:15,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c059f2428/12f5c572c222410b8a21660ea358212d/FLAG9e37abd36 [2025-01-09 03:48:15,613 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:48:15,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c [2025-01-09 03:48:15,635 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c059f2428/12f5c572c222410b8a21660ea358212d/FLAG9e37abd36 [2025-01-09 03:48:15,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c059f2428/12f5c572c222410b8a21660ea358212d [2025-01-09 03:48:15,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:48:15,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:48:15,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:48:15,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:48:15,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:48:15,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:15" (1/1) ... [2025-01-09 03:48:15,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@721343d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:15, skipping insertion in model container [2025-01-09 03:48:15,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:15" (1/1) ... [2025-01-09 03:48:15,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:48:15,806 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c[1700,1713] [2025-01-09 03:48:16,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:48:16,105 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:48:16,111 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-01-09 03:48:16,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [62] [2025-01-09 03:48:16,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [71] [2025-01-09 03:48:16,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [235] [2025-01-09 03:48:16,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [903] [2025-01-09 03:48:16,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1263] [2025-01-09 03:48:16,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1355] [2025-01-09 03:48:16,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1390] [2025-01-09 03:48:16,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1756] [2025-01-09 03:48:16,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3289] [2025-01-09 03:48:16,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c[1700,1713] [2025-01-09 03:48:16,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:48:16,251 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:48:16,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16 WrapperNode [2025-01-09 03:48:16,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:48:16,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:48:16,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:48:16,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:48:16,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,309 INFO L138 Inliner]: procedures = 93, calls = 338, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 860 [2025-01-09 03:48:16,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:48:16,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:48:16,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:48:16,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:48:16,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,359 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-01-09 03:48:16,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,382 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,388 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:48:16,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:48:16,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:48:16,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:48:16,434 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (1/1) ... [2025-01-09 03:48:16,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:16,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:16,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:48:16,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:48:16,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:48:16,484 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:48:16,484 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:48:16,484 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-01-09 03:48:16,484 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-01-09 03:48:16,484 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:48:16,484 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:48:16,484 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:48:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:48:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:48:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:48:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-01-09 03:48:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-01-09 03:48:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:48:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:48:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:48:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:48:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:48:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:48:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:48:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:48:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:48:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:48:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:48:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:48:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-01-09 03:48:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-01-09 03:48:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:48:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:48:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:48:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:48:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:48:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:48:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:48:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:48:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:48:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:48:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-01-09 03:48:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-01-09 03:48:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-01-09 03:48:16,486 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:48:16,486 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:48:16,486 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:48:16,486 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:48:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:48:16,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:48:16,489 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:48:16,489 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:48:16,658 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:48:16,660 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:48:17,595 INFO L? ?]: Removed 454 outVars from TransFormulas that were not future-live. [2025-01-09 03:48:17,596 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:48:17,609 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:48:17,610 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:48:17,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:17 BoogieIcfgContainer [2025-01-09 03:48:17,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:48:17,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:48:17,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:48:17,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:48:17,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:48:15" (1/3) ... [2025-01-09 03:48:17,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8617232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:17, skipping insertion in model container [2025-01-09 03:48:17,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:16" (2/3) ... [2025-01-09 03:48:17,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8617232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:17, skipping insertion in model container [2025-01-09 03:48:17,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:17" (3/3) ... [2025-01-09 03:48:17,618 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product29.cil.c [2025-01-09 03:48:17,628 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:48:17,631 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product29.cil.c that has 25 procedures, 562 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:48:17,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:48:17,695 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;@e0d2bda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:48:17,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:48:17,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 562 states, 444 states have (on average 1.6981981981981982) internal successors, (754), 465 states have internal predecessors, (754), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 03:48:17,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 03:48:17,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:17,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:17,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:17,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:17,721 INFO L85 PathProgramCache]: Analyzing trace with hash 794432453, now seen corresponding path program 1 times [2025-01-09 03:48:17,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:17,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756466441] [2025-01-09 03:48:17,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:17,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:17,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 03:48:17,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 03:48:17,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:17,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:18,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:18,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756466441] [2025-01-09 03:48:18,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756466441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:18,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:18,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:18,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989765483] [2025-01-09 03:48:18,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:18,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:18,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:18,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:18,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:18,265 INFO L87 Difference]: Start difference. First operand has 562 states, 444 states have (on average 1.6981981981981982) internal successors, (754), 465 states have internal predecessors, (754), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:18,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:18,388 INFO L93 Difference]: Finished difference Result 1104 states and 1851 transitions. [2025-01-09 03:48:18,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:18,390 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2025-01-09 03:48:18,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:18,402 INFO L225 Difference]: With dead ends: 1104 [2025-01-09 03:48:18,403 INFO L226 Difference]: Without dead ends: 554 [2025-01-09 03:48:18,408 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-01-09 03:48:18,410 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 5 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2750 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-01-09 03:48:18,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2750 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-01-09 03:48:18,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-01-09 03:48:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 438 states have (on average 1.6963470319634704) internal successors, (743), 457 states have internal predecessors, (743), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 03:48:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 922 transitions. [2025-01-09 03:48:18,482 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 922 transitions. Word has length 90 [2025-01-09 03:48:18,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:18,482 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 922 transitions. [2025-01-09 03:48:18,483 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 922 transitions. [2025-01-09 03:48:18,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 03:48:18,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:18,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:18,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:48:18,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:18,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:18,494 INFO L85 PathProgramCache]: Analyzing trace with hash -239560524, now seen corresponding path program 1 times [2025-01-09 03:48:18,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:18,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929153928] [2025-01-09 03:48:18,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:18,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:18,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:48:18,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:48:18,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:18,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:18,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:18,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929153928] [2025-01-09 03:48:18,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929153928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:18,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:18,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:18,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707264834] [2025-01-09 03:48:18,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:18,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:18,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:18,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:18,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:18,737 INFO L87 Difference]: Start difference. First operand 554 states and 922 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:18,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:18,808 INFO L93 Difference]: Finished difference Result 1090 states and 1821 transitions. [2025-01-09 03:48:18,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:18,809 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2025-01-09 03:48:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:18,815 INFO L225 Difference]: With dead ends: 1090 [2025-01-09 03:48:18,816 INFO L226 Difference]: Without dead ends: 554 [2025-01-09 03:48:18,819 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-01-09 03:48:18,820 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 4 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2729 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-01-09 03:48:18,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2729 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:18,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-01-09 03:48:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-01-09 03:48:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 438 states have (on average 1.6940639269406392) internal successors, (742), 457 states have internal predecessors, (742), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 03:48:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 921 transitions. [2025-01-09 03:48:18,867 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 921 transitions. Word has length 92 [2025-01-09 03:48:18,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:18,867 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 921 transitions. [2025-01-09 03:48:18,868 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:18,868 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 921 transitions. [2025-01-09 03:48:18,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 03:48:18,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:18,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:18,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:48:18,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:18,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:18,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1361022729, now seen corresponding path program 1 times [2025-01-09 03:48:18,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:18,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515191214] [2025-01-09 03:48:18,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:18,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:18,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 03:48:18,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 03:48:18,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:18,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:19,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:19,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515191214] [2025-01-09 03:48:19,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515191214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:19,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:19,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:19,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481197288] [2025-01-09 03:48:19,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:19,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:19,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:19,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:19,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:19,041 INFO L87 Difference]: Start difference. First operand 554 states and 921 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:19,107 INFO L93 Difference]: Finished difference Result 1090 states and 1820 transitions. [2025-01-09 03:48:19,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:19,108 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2025-01-09 03:48:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:19,116 INFO L225 Difference]: With dead ends: 1090 [2025-01-09 03:48:19,116 INFO L226 Difference]: Without dead ends: 554 [2025-01-09 03:48:19,119 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-01-09 03:48:19,122 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 3 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2729 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-01-09 03:48:19,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2729 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-01-09 03:48:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-01-09 03:48:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 438 states have (on average 1.6917808219178083) internal successors, (741), 457 states have internal predecessors, (741), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 03:48:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 920 transitions. [2025-01-09 03:48:19,153 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 920 transitions. Word has length 93 [2025-01-09 03:48:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:19,154 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 920 transitions. [2025-01-09 03:48:19,154 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 920 transitions. [2025-01-09 03:48:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 03:48:19,159 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:19,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:19,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:48:19,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:19,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash -80024488, now seen corresponding path program 1 times [2025-01-09 03:48:19,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:19,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679537244] [2025-01-09 03:48:19,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:19,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 03:48:19,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 03:48:19,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:19,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:19,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:19,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679537244] [2025-01-09 03:48:19,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679537244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:19,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:19,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:19,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648400575] [2025-01-09 03:48:19,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:19,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:19,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:19,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:19,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:19,338 INFO L87 Difference]: Start difference. First operand 554 states and 920 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:19,384 INFO L93 Difference]: Finished difference Result 1090 states and 1819 transitions. [2025-01-09 03:48:19,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:19,385 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2025-01-09 03:48:19,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:19,391 INFO L225 Difference]: With dead ends: 1090 [2025-01-09 03:48:19,395 INFO L226 Difference]: Without dead ends: 554 [2025-01-09 03:48:19,397 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-01-09 03:48:19,398 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 2 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2729 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-01-09 03:48:19,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2729 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-01-09 03:48:19,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-01-09 03:48:19,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 438 states have (on average 1.6894977168949772) internal successors, (740), 457 states have internal predecessors, (740), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 03:48:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 919 transitions. [2025-01-09 03:48:19,428 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 919 transitions. Word has length 94 [2025-01-09 03:48:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:19,428 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 919 transitions. [2025-01-09 03:48:19,429 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 919 transitions. [2025-01-09 03:48:19,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 03:48:19,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:19,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:19,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:48:19,434 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:19,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1322335763, now seen corresponding path program 1 times [2025-01-09 03:48:19,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:19,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522572056] [2025-01-09 03:48:19,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:19,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:19,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 03:48:19,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 03:48:19,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:19,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:19,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:19,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522572056] [2025-01-09 03:48:19,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522572056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:19,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:19,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:19,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893450609] [2025-01-09 03:48:19,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:19,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:19,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:19,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:19,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:19,575 INFO L87 Difference]: Start difference. First operand 554 states and 919 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:19,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:19,613 INFO L93 Difference]: Finished difference Result 1090 states and 1818 transitions. [2025-01-09 03:48:19,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:19,614 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 95 [2025-01-09 03:48:19,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:19,619 INFO L225 Difference]: With dead ends: 1090 [2025-01-09 03:48:19,620 INFO L226 Difference]: Without dead ends: 554 [2025-01-09 03:48:19,622 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-01-09 03:48:19,624 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 1 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2729 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-01-09 03:48:19,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2729 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-01-09 03:48:19,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-01-09 03:48:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 438 states have (on average 1.687214611872146) internal successors, (739), 457 states have internal predecessors, (739), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 03:48:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 918 transitions. [2025-01-09 03:48:19,649 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 918 transitions. Word has length 95 [2025-01-09 03:48:19,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:19,650 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 918 transitions. [2025-01-09 03:48:19,650 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 918 transitions. [2025-01-09 03:48:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 03:48:19,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:19,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:19,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:48:19,654 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:19,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:19,654 INFO L85 PathProgramCache]: Analyzing trace with hash -698800132, now seen corresponding path program 1 times [2025-01-09 03:48:19,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:19,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520665143] [2025-01-09 03:48:19,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:19,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:19,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 03:48:19,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 03:48:19,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:19,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:19,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:19,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:19,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520665143] [2025-01-09 03:48:19,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520665143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:19,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:19,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:19,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282254764] [2025-01-09 03:48:19,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:19,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:19,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:19,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:19,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:19,836 INFO L87 Difference]: Start difference. First operand 554 states and 918 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:48:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:19,953 INFO L93 Difference]: Finished difference Result 1056 states and 1750 transitions. [2025-01-09 03:48:19,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:19,958 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2025-01-09 03:48:19,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:19,963 INFO L225 Difference]: With dead ends: 1056 [2025-01-09 03:48:19,963 INFO L226 Difference]: Without dead ends: 569 [2025-01-09 03:48:19,965 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-01-09 03:48:19,966 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 91 mSDsluCounter, 4459 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5367 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:19,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5367 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:19,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-01-09 03:48:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 567. [2025-01-09 03:48:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 448 states have (on average 1.6830357142857142) internal successors, (754), 469 states have internal predecessors, (754), 93 states have call successors, (93), 24 states have call predecessors, (93), 25 states have return successors, (90), 86 states have call predecessors, (90), 88 states have call successors, (90) [2025-01-09 03:48:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 937 transitions. [2025-01-09 03:48:19,988 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 937 transitions. Word has length 96 [2025-01-09 03:48:19,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:19,989 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 937 transitions. [2025-01-09 03:48:19,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:48:19,989 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 937 transitions. [2025-01-09 03:48:19,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 03:48:19,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:19,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:19,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:48:19,993 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:19,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash -578680259, now seen corresponding path program 1 times [2025-01-09 03:48:19,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:19,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313700409] [2025-01-09 03:48:19,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:19,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:20,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 03:48:20,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 03:48:20,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:20,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:20,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:20,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313700409] [2025-01-09 03:48:20,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313700409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:20,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:20,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:20,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198059769] [2025-01-09 03:48:20,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:20,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:20,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:20,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:20,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:20,085 INFO L87 Difference]: Start difference. First operand 567 states and 937 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:20,116 INFO L93 Difference]: Finished difference Result 1108 states and 1844 transitions. [2025-01-09 03:48:20,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:20,116 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2025-01-09 03:48:20,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:20,120 INFO L225 Difference]: With dead ends: 1108 [2025-01-09 03:48:20,120 INFO L226 Difference]: Without dead ends: 548 [2025-01-09 03:48:20,122 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-01-09 03:48:20,123 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 0 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2731 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-01-09 03:48:20,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2731 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:20,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-01-09 03:48:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-01-09 03:48:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 432 states have (on average 1.6782407407407407) internal successors, (725), 451 states have internal predecessors, (725), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 03:48:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 904 transitions. [2025-01-09 03:48:20,139 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 904 transitions. Word has length 96 [2025-01-09 03:48:20,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:20,139 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 904 transitions. [2025-01-09 03:48:20,140 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:20,140 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 904 transitions. [2025-01-09 03:48:20,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 03:48:20,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:20,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:20,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:48:20,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:20,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:20,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1970421136, now seen corresponding path program 1 times [2025-01-09 03:48:20,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:20,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335348397] [2025-01-09 03:48:20,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:20,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:20,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 03:48:20,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 03:48:20,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:20,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:20,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:20,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335348397] [2025-01-09 03:48:20,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335348397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:20,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:20,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:20,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231398366] [2025-01-09 03:48:20,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:20,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:20,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:20,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:20,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:20,258 INFO L87 Difference]: Start difference. First operand 548 states and 904 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:20,420 INFO L93 Difference]: Finished difference Result 1053 states and 1742 transitions. [2025-01-09 03:48:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:20,421 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2025-01-09 03:48:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:20,424 INFO L225 Difference]: With dead ends: 1053 [2025-01-09 03:48:20,425 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 03:48:20,426 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-01-09 03:48:20,427 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 55 mSDsluCounter, 3415 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4276 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-01-09 03:48:20,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4276 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:20,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 03:48:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 548. [2025-01-09 03:48:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 432 states have (on average 1.6689814814814814) internal successors, (721), 451 states have internal predecessors, (721), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 03:48:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 900 transitions. [2025-01-09 03:48:20,447 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 900 transitions. Word has length 97 [2025-01-09 03:48:20,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:20,447 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 900 transitions. [2025-01-09 03:48:20,447 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 900 transitions. [2025-01-09 03:48:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:48:20,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:20,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:48:20,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:48:20,467 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:20,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:20,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1041216327, now seen corresponding path program 1 times [2025-01-09 03:48:20,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:20,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836976948] [2025-01-09 03:48:20,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:20,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:20,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:48:20,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:48:20,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:20,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:20,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:20,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836976948] [2025-01-09 03:48:20,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836976948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:20,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:20,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:20,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592763253] [2025-01-09 03:48:20,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:20,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:20,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:20,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:20,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:20,591 INFO L87 Difference]: Start difference. First operand 548 states and 900 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:20,736 INFO L93 Difference]: Finished difference Result 1053 states and 1738 transitions. [2025-01-09 03:48:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:20,737 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-01-09 03:48:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:20,740 INFO L225 Difference]: With dead ends: 1053 [2025-01-09 03:48:20,740 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 03:48:20,742 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-01-09 03:48:20,743 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 54 mSDsluCounter, 3415 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4276 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-01-09 03:48:20,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4276 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:20,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 03:48:20,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 548. [2025-01-09 03:48:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 432 states have (on average 1.6597222222222223) internal successors, (717), 451 states have internal predecessors, (717), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 03:48:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 896 transitions. [2025-01-09 03:48:20,758 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 896 transitions. Word has length 98 [2025-01-09 03:48:20,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:20,758 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 896 transitions. [2025-01-09 03:48:20,759 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:20,759 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 896 transitions. [2025-01-09 03:48:20,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 03:48:20,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:20,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:48:20,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:48:20,761 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:20,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:20,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1867928821, now seen corresponding path program 1 times [2025-01-09 03:48:20,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:20,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900587337] [2025-01-09 03:48:20,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:20,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:20,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:48:20,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:48:20,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:20,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:20,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:20,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900587337] [2025-01-09 03:48:20,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900587337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:20,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:20,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:20,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173944114] [2025-01-09 03:48:20,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:20,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:20,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:20,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:20,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:20,871 INFO L87 Difference]: Start difference. First operand 548 states and 896 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:20,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:20,997 INFO L93 Difference]: Finished difference Result 1053 states and 1734 transitions. [2025-01-09 03:48:20,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:20,997 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-01-09 03:48:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:21,015 INFO L225 Difference]: With dead ends: 1053 [2025-01-09 03:48:21,015 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 03:48:21,016 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-01-09 03:48:21,017 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 53 mSDsluCounter, 3398 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4258 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-01-09 03:48:21,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4258 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:21,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 03:48:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 548. [2025-01-09 03:48:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 432 states have (on average 1.650462962962963) internal successors, (713), 451 states have internal predecessors, (713), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 03:48:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 892 transitions. [2025-01-09 03:48:21,032 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 892 transitions. Word has length 99 [2025-01-09 03:48:21,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:21,033 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 892 transitions. [2025-01-09 03:48:21,033 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 892 transitions. [2025-01-09 03:48:21,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 03:48:21,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:21,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:48:21,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:48:21,035 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:21,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:21,036 INFO L85 PathProgramCache]: Analyzing trace with hash -652173685, now seen corresponding path program 1 times [2025-01-09 03:48:21,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:21,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047008784] [2025-01-09 03:48:21,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:21,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:21,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:48:21,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:48:21,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:21,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:21,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:21,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047008784] [2025-01-09 03:48:21,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047008784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:21,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:21,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:21,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481177512] [2025-01-09 03:48:21,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:21,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:21,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:21,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:21,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:21,169 INFO L87 Difference]: Start difference. First operand 548 states and 892 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:48:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:21,227 INFO L93 Difference]: Finished difference Result 1044 states and 1716 transitions. [2025-01-09 03:48:21,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:21,228 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 99 [2025-01-09 03:48:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:21,232 INFO L225 Difference]: With dead ends: 1044 [2025-01-09 03:48:21,232 INFO L226 Difference]: Without dead ends: 527 [2025-01-09 03:48:21,234 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-01-09 03:48:21,234 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 84 mSDsluCounter, 4332 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5213 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-01-09 03:48:21,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5213 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:21,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-01-09 03:48:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2025-01-09 03:48:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 411 states have (on average 1.6520681265206814) internal successors, (679), 430 states have internal predecessors, (679), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 03:48:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 858 transitions. [2025-01-09 03:48:21,250 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 858 transitions. Word has length 99 [2025-01-09 03:48:21,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:21,250 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 858 transitions. [2025-01-09 03:48:21,250 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:48:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 858 transitions. [2025-01-09 03:48:21,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 03:48:21,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:21,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:48:21,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:48:21,253 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:21,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:21,253 INFO L85 PathProgramCache]: Analyzing trace with hash 613523284, now seen corresponding path program 1 times [2025-01-09 03:48:21,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:21,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756059519] [2025-01-09 03:48:21,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:21,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:21,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 03:48:21,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:48:21,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:21,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:21,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:21,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756059519] [2025-01-09 03:48:21,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756059519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:21,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:21,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:21,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851647878] [2025-01-09 03:48:21,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:21,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:21,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:21,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:21,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:21,352 INFO L87 Difference]: Start difference. First operand 527 states and 858 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:21,412 INFO L93 Difference]: Finished difference Result 1023 states and 1682 transitions. [2025-01-09 03:48:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:21,412 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2025-01-09 03:48:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:21,416 INFO L225 Difference]: With dead ends: 1023 [2025-01-09 03:48:21,416 INFO L226 Difference]: Without dead ends: 527 [2025-01-09 03:48:21,418 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-01-09 03:48:21,419 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 17 mSDsluCounter, 3355 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4196 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-01-09 03:48:21,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4196 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:21,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-01-09 03:48:21,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2025-01-09 03:48:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 411 states have (on average 1.6496350364963503) internal successors, (678), 430 states have internal predecessors, (678), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 03:48:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 857 transitions. [2025-01-09 03:48:21,433 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 857 transitions. Word has length 100 [2025-01-09 03:48:21,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:21,434 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 857 transitions. [2025-01-09 03:48:21,434 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:21,434 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 857 transitions. [2025-01-09 03:48:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:48:21,436 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:21,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:48:21,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:48:21,436 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:21,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:21,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1726104442, now seen corresponding path program 1 times [2025-01-09 03:48:21,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:21,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486644583] [2025-01-09 03:48:21,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:21,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:21,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:48:21,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:48:21,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:21,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:21,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:21,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486644583] [2025-01-09 03:48:21,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486644583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:21,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:21,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:21,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072680941] [2025-01-09 03:48:21,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:21,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:21,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:21,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:21,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:21,556 INFO L87 Difference]: Start difference. First operand 527 states and 857 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:21,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:21,612 INFO L93 Difference]: Finished difference Result 1023 states and 1681 transitions. [2025-01-09 03:48:21,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:21,613 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2025-01-09 03:48:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:21,617 INFO L225 Difference]: With dead ends: 1023 [2025-01-09 03:48:21,617 INFO L226 Difference]: Without dead ends: 527 [2025-01-09 03:48:21,619 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-01-09 03:48:21,619 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 16 mSDsluCounter, 3355 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4196 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-01-09 03:48:21,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4196 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:21,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-01-09 03:48:21,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2025-01-09 03:48:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 411 states have (on average 1.6472019464720196) internal successors, (677), 430 states have internal predecessors, (677), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 03:48:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 856 transitions. [2025-01-09 03:48:21,634 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 856 transitions. Word has length 101 [2025-01-09 03:48:21,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:21,635 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 856 transitions. [2025-01-09 03:48:21,635 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, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 856 transitions. [2025-01-09 03:48:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:48:21,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:21,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:48:21,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:48:21,637 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:21,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:21,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1099615727, now seen corresponding path program 1 times [2025-01-09 03:48:21,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:21,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217579685] [2025-01-09 03:48:21,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:21,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:21,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:48:21,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:48:21,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:21,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:21,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:21,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217579685] [2025-01-09 03:48:21,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217579685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:21,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:21,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:48:21,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877552160] [2025-01-09 03:48:21,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:21,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:48:21,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:21,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:48:21,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:48:21,716 INFO L87 Difference]: Start difference. First operand 527 states and 856 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:21,750 INFO L93 Difference]: Finished difference Result 1017 states and 1669 transitions. [2025-01-09 03:48:21,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:48:21,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2025-01-09 03:48:21,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:21,755 INFO L225 Difference]: With dead ends: 1017 [2025-01-09 03:48:21,755 INFO L226 Difference]: Without dead ends: 527 [2025-01-09 03:48:21,757 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-01-09 03:48:21,757 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 5 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:21,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2522 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:21,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-01-09 03:48:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2025-01-09 03:48:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 411 states have (on average 1.6447688564476886) internal successors, (676), 430 states have internal predecessors, (676), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 03:48:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 855 transitions. [2025-01-09 03:48:21,775 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 855 transitions. Word has length 102 [2025-01-09 03:48:21,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:21,776 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 855 transitions. [2025-01-09 03:48:21,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:48:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 855 transitions. [2025-01-09 03:48:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 03:48:21,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:21,778 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:48:21,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:48:21,779 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:21,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:21,779 INFO L85 PathProgramCache]: Analyzing trace with hash 745783089, now seen corresponding path program 1 times [2025-01-09 03:48:21,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:21,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380403016] [2025-01-09 03:48:21,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:21,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:21,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:48:21,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:48:21,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:21,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:21,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:21,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380403016] [2025-01-09 03:48:21,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380403016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:21,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:21,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:48:21,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679960958] [2025-01-09 03:48:21,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:21,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:48:21,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:21,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:48:21,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:21,996 INFO L87 Difference]: Start difference. First operand 527 states and 855 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 03:48:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:23,519 INFO L93 Difference]: Finished difference Result 1013 states and 1681 transitions. [2025-01-09 03:48:23,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:48:23,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 103 [2025-01-09 03:48:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:23,524 INFO L225 Difference]: With dead ends: 1013 [2025-01-09 03:48:23,525 INFO L226 Difference]: Without dead ends: 531 [2025-01-09 03:48:23,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:48:23,528 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 1317 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 2774 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 3152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 2774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:23,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 1519 Invalid, 3152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 2774 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 03:48:23,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-01-09 03:48:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-01-09 03:48:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 414 states have (on average 1.6400966183574879) internal successors, (679), 433 states have internal predecessors, (679), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (103), 86 states have call predecessors, (103), 87 states have call successors, (103) [2025-01-09 03:48:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 874 transitions. [2025-01-09 03:48:23,551 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 874 transitions. Word has length 103 [2025-01-09 03:48:23,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:23,552 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 874 transitions. [2025-01-09 03:48:23,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 03:48:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 874 transitions. [2025-01-09 03:48:23,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 03:48:23,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:23,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:48:23,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:48:23,555 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:23,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:23,555 INFO L85 PathProgramCache]: Analyzing trace with hash -170526522, now seen corresponding path program 1 times [2025-01-09 03:48:23,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:23,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479750046] [2025-01-09 03:48:23,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:23,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:23,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 03:48:23,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 03:48:23,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:23,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:48:23,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:23,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479750046] [2025-01-09 03:48:23,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479750046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:23,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:23,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:23,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51576420] [2025-01-09 03:48:23,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:23,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:23,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:23,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:23,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:23,717 INFO L87 Difference]: Start difference. First operand 531 states and 874 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 03:48:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:26,568 INFO L93 Difference]: Finished difference Result 1888 states and 3215 transitions. [2025-01-09 03:48:26,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 03:48:26,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 104 [2025-01-09 03:48:26,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:26,578 INFO L225 Difference]: With dead ends: 1888 [2025-01-09 03:48:26,578 INFO L226 Difference]: Without dead ends: 1402 [2025-01-09 03:48:26,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-01-09 03:48:26,583 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 2417 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 4976 mSolverCounterSat, 603 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2489 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 5579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 603 IncrementalHoareTripleChecker+Valid, 4976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:26,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 2290 Invalid, 5579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [603 Valid, 4976 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 03:48:26,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-01-09 03:48:26,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1342. [2025-01-09 03:48:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1042 states have (on average 1.6497120921305182) internal successors, (1719), 1090 states have internal predecessors, (1719), 236 states have call successors, (236), 63 states have call predecessors, (236), 63 states have return successors, (257), 225 states have call predecessors, (257), 231 states have call successors, (257) [2025-01-09 03:48:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 2212 transitions. [2025-01-09 03:48:26,648 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 2212 transitions. Word has length 104 [2025-01-09 03:48:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:26,649 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 2212 transitions. [2025-01-09 03:48:26,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 03:48:26,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 2212 transitions. [2025-01-09 03:48:26,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:48:26,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:26,652 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:48:26,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:48:26,652 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:26,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1460720489, now seen corresponding path program 1 times [2025-01-09 03:48:26,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:26,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398801554] [2025-01-09 03:48:26,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:26,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:26,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:48:26,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:48:26,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:26,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:26,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:48:26,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:26,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398801554] [2025-01-09 03:48:26,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398801554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:26,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:26,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:26,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141549022] [2025-01-09 03:48:26,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:26,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:26,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:26,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:26,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:26,781 INFO L87 Difference]: Start difference. First operand 1342 states and 2212 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 03:48:29,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:29,144 INFO L93 Difference]: Finished difference Result 4699 states and 7970 transitions. [2025-01-09 03:48:29,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:29,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 106 [2025-01-09 03:48:29,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:29,166 INFO L225 Difference]: With dead ends: 4699 [2025-01-09 03:48:29,166 INFO L226 Difference]: Without dead ends: 3403 [2025-01-09 03:48:29,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:48:29,175 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 3372 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 3434 mSolverCounterSat, 986 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3406 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 4420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 986 IncrementalHoareTripleChecker+Valid, 3434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:29,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3406 Valid, 2005 Invalid, 4420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [986 Valid, 3434 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 03:48:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2025-01-09 03:48:29,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3076. [2025-01-09 03:48:29,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3076 states, 2273 states have (on average 1.6352837659480863) internal successors, (3717), 2419 states have internal predecessors, (3717), 670 states have call successors, (670), 121 states have call predecessors, (670), 132 states have return successors, (771), 657 states have call predecessors, (771), 665 states have call successors, (771) [2025-01-09 03:48:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 5158 transitions. [2025-01-09 03:48:29,355 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 5158 transitions. Word has length 106 [2025-01-09 03:48:29,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:29,355 INFO L471 AbstractCegarLoop]: Abstraction has 3076 states and 5158 transitions. [2025-01-09 03:48:29,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 03:48:29,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 5158 transitions. [2025-01-09 03:48:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:48:29,358 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:29,358 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:48:29,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:48:29,358 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:29,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:29,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1676096259, now seen corresponding path program 1 times [2025-01-09 03:48:29,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:29,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003052205] [2025-01-09 03:48:29,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:29,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:29,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:48:29,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:48:29,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:29,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:48:29,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:29,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003052205] [2025-01-09 03:48:29,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003052205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:29,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:29,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:29,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719520758] [2025-01-09 03:48:29,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:29,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:29,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:29,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:29,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:29,476 INFO L87 Difference]: Start difference. First operand 3076 states and 5158 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 03:48:31,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:31,757 INFO L93 Difference]: Finished difference Result 11645 states and 20153 transitions. [2025-01-09 03:48:31,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:31,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 107 [2025-01-09 03:48:31,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:31,821 INFO L225 Difference]: With dead ends: 11645 [2025-01-09 03:48:31,821 INFO L226 Difference]: Without dead ends: 8616 [2025-01-09 03:48:31,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:48:31,839 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 3385 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 3397 mSolverCounterSat, 1009 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3420 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 4406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1009 IncrementalHoareTripleChecker+Valid, 3397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:31,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3420 Valid, 2018 Invalid, 4406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1009 Valid, 3397 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 03:48:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8616 states. [2025-01-09 03:48:32,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8616 to 7695. [2025-01-09 03:48:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7695 states, 5362 states have (on average 1.6143230138008207) internal successors, (8656), 5794 states have internal predecessors, (8656), 2047 states have call successors, (2047), 237 states have call predecessors, (2047), 285 states have return successors, (2483), 2042 states have call predecessors, (2483), 2042 states have call successors, (2483) [2025-01-09 03:48:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7695 states to 7695 states and 13186 transitions. [2025-01-09 03:48:32,360 INFO L78 Accepts]: Start accepts. Automaton has 7695 states and 13186 transitions. Word has length 107 [2025-01-09 03:48:32,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:32,360 INFO L471 AbstractCegarLoop]: Abstraction has 7695 states and 13186 transitions. [2025-01-09 03:48:32,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 03:48:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 7695 states and 13186 transitions. [2025-01-09 03:48:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:48:32,364 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:32,364 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:48:32,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:48:32,364 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:32,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:32,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1754936828, now seen corresponding path program 1 times [2025-01-09 03:48:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:32,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377446918] [2025-01-09 03:48:32,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:32,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:32,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:48:32,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:48:32,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:32,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:48:32,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:32,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377446918] [2025-01-09 03:48:32,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377446918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:32,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:32,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:32,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187862950] [2025-01-09 03:48:32,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:32,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:32,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:32,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:32,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:32,472 INFO L87 Difference]: Start difference. First operand 7695 states and 13186 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 03:48:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:35,406 INFO L93 Difference]: Finished difference Result 31698 states and 56200 transitions. [2025-01-09 03:48:35,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:35,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 108 [2025-01-09 03:48:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:35,582 INFO L225 Difference]: With dead ends: 31698 [2025-01-09 03:48:35,582 INFO L226 Difference]: Without dead ends: 24052 [2025-01-09 03:48:35,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:48:35,630 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 3397 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 3402 mSolverCounterSat, 1013 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3433 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 4415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1013 IncrementalHoareTripleChecker+Valid, 3402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:35,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3433 Valid, 2039 Invalid, 4415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1013 Valid, 3402 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 03:48:35,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24052 states. [2025-01-09 03:48:36,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24052 to 21180. [2025-01-09 03:48:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21180 states, 13898 states have (on average 1.59217153547273) internal successors, (22128), 15217 states have internal predecessors, (22128), 6636 states have call successors, (6636), 469 states have call predecessors, (6636), 645 states have return successors, (8547), 6695 states have call predecessors, (8547), 6631 states have call successors, (8547) [2025-01-09 03:48:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21180 states to 21180 states and 37311 transitions. [2025-01-09 03:48:37,183 INFO L78 Accepts]: Start accepts. Automaton has 21180 states and 37311 transitions. Word has length 108 [2025-01-09 03:48:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:37,183 INFO L471 AbstractCegarLoop]: Abstraction has 21180 states and 37311 transitions. [2025-01-09 03:48:37,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 03:48:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 21180 states and 37311 transitions. [2025-01-09 03:48:37,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:48:37,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:37,187 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:48:37,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:48:37,187 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:37,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:37,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1525796360, now seen corresponding path program 1 times [2025-01-09 03:48:37,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:37,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855814801] [2025-01-09 03:48:37,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:37,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:37,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:48:37,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:48:37,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:37,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:37,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:48:37,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:37,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855814801] [2025-01-09 03:48:37,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855814801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:37,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:37,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:37,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727358643] [2025-01-09 03:48:37,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:37,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:37,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:37,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:37,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:37,318 INFO L87 Difference]: Start difference. First operand 21180 states and 37311 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 03:48:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:43,884 INFO L93 Difference]: Finished difference Result 94327 states and 171784 transitions. [2025-01-09 03:48:43,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:43,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 109 [2025-01-09 03:48:43,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:44,680 INFO L225 Difference]: With dead ends: 94327 [2025-01-09 03:48:44,680 INFO L226 Difference]: Without dead ends: 73200 [2025-01-09 03:48:44,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:48:44,786 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 3409 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 3411 mSolverCounterSat, 1015 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3446 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 4426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1015 IncrementalHoareTripleChecker+Valid, 3411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:44,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3446 Valid, 2060 Invalid, 4426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1015 Valid, 3411 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 03:48:44,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73200 states. [2025-01-09 03:48:49,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73200 to 63809. [2025-01-09 03:48:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63809 states, 39886 states have (on average 1.574086145514717) internal successors, (62784), 44068 states have internal predecessors, (62784), 22353 states have call successors, (22353), 933 states have call predecessors, (22353), 1569 states have return successors, (30701), 22732 states have call predecessors, (30701), 22348 states have call successors, (30701) [2025-01-09 03:48:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63809 states to 63809 states and 115838 transitions. [2025-01-09 03:48:50,057 INFO L78 Accepts]: Start accepts. Automaton has 63809 states and 115838 transitions. Word has length 109 [2025-01-09 03:48:50,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:50,057 INFO L471 AbstractCegarLoop]: Abstraction has 63809 states and 115838 transitions. [2025-01-09 03:48:50,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 03:48:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 63809 states and 115838 transitions. [2025-01-09 03:48:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:48:50,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:50,064 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 03:48:50,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:48:50,064 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:50,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:50,065 INFO L85 PathProgramCache]: Analyzing trace with hash -339178337, now seen corresponding path program 1 times [2025-01-09 03:48:50,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:50,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647572793] [2025-01-09 03:48:50,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:50,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:50,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:48:50,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:48:50,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:50,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:48:50,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:50,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647572793] [2025-01-09 03:48:50,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647572793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:50,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:50,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:48:50,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835881587] [2025-01-09 03:48:50,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:50,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:48:50,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:50,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:48:50,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:50,216 INFO L87 Difference]: Start difference. First operand 63809 states and 115838 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12)