./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product25.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_product25.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 68864d90c2581c7e2b9a72172352bcf9279d03107788434bd4ac5af6cc5db51a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:47:47,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:47:47,318 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:47:47,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:47:47,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:47:47,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:47:47,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:47:47,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:47:47,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:47:47,338 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:47:47,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:47:47,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:47:47,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:47:47,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:47:47,338 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:47:47,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:47:47,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:47:47,338 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:47:47,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:47:47,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:47:47,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:47:47,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:47:47,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:47:47,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:47:47,339 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:47:47,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:47:47,339 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:47:47,339 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:47:47,339 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:47:47,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:47:47,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:47:47,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:47:47,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:47:47,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:47:47,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:47:47,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:47:47,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:47:47,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:47:47,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:47:47,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:47:47,340 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:47:47,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:47:47,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:47:47,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:47:47,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:47:47,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:47:47,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:47:47,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:47:47,340 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 -> 68864d90c2581c7e2b9a72172352bcf9279d03107788434bd4ac5af6cc5db51a [2025-01-09 03:47:47,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:47:47,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:47:47,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:47:47,584 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:47:47,584 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:47:47,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c [2025-01-09 03:47:48,779 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1d532518/2287c6d294954685939c6d815109a728/FLAG67b123d96 [2025-01-09 03:47:49,141 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:47:49,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c [2025-01-09 03:47:49,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1d532518/2287c6d294954685939c6d815109a728/FLAG67b123d96 [2025-01-09 03:47:49,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1d532518/2287c6d294954685939c6d815109a728 [2025-01-09 03:47:49,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:47:49,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:47:49,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:47:49,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:47:49,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:47:49,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:47:49" (1/1) ... [2025-01-09 03:47:49,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b328b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:49, skipping insertion in model container [2025-01-09 03:47:49,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:47:49" (1/1) ... [2025-01-09 03:47:49,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:47:49,696 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_product25.cil.c[23488,23501] [2025-01-09 03:47:49,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:47:49,811 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:47:49,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [48] [2025-01-09 03:47:49,819 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [213] [2025-01-09 03:47:49,819 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [334] [2025-01-09 03:47:49,819 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [432] [2025-01-09 03:47:49,819 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [446] [2025-01-09 03:47:49,820 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [812] [2025-01-09 03:47:49,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1166] [2025-01-09 03:47:49,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1175] [2025-01-09 03:47:49,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1842] [2025-01-09 03:47:49,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1877] [2025-01-09 03:47:49,850 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_product25.cil.c[23488,23501] [2025-01-09 03:47:49,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:47:49,907 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:47:49,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:49 WrapperNode [2025-01-09 03:47:49,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:47:49,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:47:49,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:47:49,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:47:49,914 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:47:49" (1/1) ... [2025-01-09 03:47:49,942 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:47:49" (1/1) ... [2025-01-09 03:47:49,982 INFO L138 Inliner]: procedures = 91, calls = 331, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 801 [2025-01-09 03:47:49,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:47:49,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:47:49,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:47:49,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:47:49,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:49" (1/1) ... [2025-01-09 03:47:49,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:49" (1/1) ... [2025-01-09 03:47:49,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:49" (1/1) ... [2025-01-09 03:47:50,034 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-01-09 03:47:50,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:49" (1/1) ... [2025-01-09 03:47:50,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:49" (1/1) ... [2025-01-09 03:47:50,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:49" (1/1) ... [2025-01-09 03:47:50,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:49" (1/1) ... [2025-01-09 03:47:50,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:49" (1/1) ... [2025-01-09 03:47:50,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:49" (1/1) ... [2025-01-09 03:47:50,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:49" (1/1) ... [2025-01-09 03:47:50,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:47:50,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:47:50,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:47:50,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:47:50,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:49" (1/1) ... [2025-01-09 03:47:50,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:47:50,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:47:50,118 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:47:50,121 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:47:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:47:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:47:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:47:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-01-09 03:47:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-01-09 03:47:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:47:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:47:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:47:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:47:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:47:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:47:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:47:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:47:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:47:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:47:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:47:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:47:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:47:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:47:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:47:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:47:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:47:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:47:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:47:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-01-09 03:47:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:47:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:47:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:47:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:47:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:47:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:47:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:47:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:47:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:47:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:47:50,144 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:47:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:47:50,144 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:47:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:47:50,144 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:47:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:47:50,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:47:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:47:50,144 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:47:50,306 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:47:50,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:47:51,261 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2025-01-09 03:47:51,262 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:47:51,275 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:47:51,279 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:47:51,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:47:51 BoogieIcfgContainer [2025-01-09 03:47:51,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:47:51,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:47:51,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:47:51,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:47:51,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:47:49" (1/3) ... [2025-01-09 03:47:51,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44992776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:47:51, skipping insertion in model container [2025-01-09 03:47:51,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:49" (2/3) ... [2025-01-09 03:47:51,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44992776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:47:51, skipping insertion in model container [2025-01-09 03:47:51,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:47:51" (3/3) ... [2025-01-09 03:47:51,295 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product25.cil.c [2025-01-09 03:47:51,311 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:47:51,313 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product25.cil.c that has 22 procedures, 531 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:47:51,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:47:51,400 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;@7d1b5231, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:47:51,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:47:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 531 states, 423 states have (on average 1.7139479905437351) internal successors, (725), 444 states have internal predecessors, (725), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) [2025-01-09 03:47:51,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 03:47:51,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:51,417 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] [2025-01-09 03:47:51,418 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:51,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:51,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1298965636, now seen corresponding path program 1 times [2025-01-09 03:47:51,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:51,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143769470] [2025-01-09 03:47:51,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:51,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:51,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 03:47:51,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 03:47:51,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:51,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:51,897 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:47:51,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:51,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143769470] [2025-01-09 03:47:51,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143769470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:51,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:51,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:51,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860792500] [2025-01-09 03:47:51,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:51,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:51,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:51,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:51,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:51,934 INFO L87 Difference]: Start difference. First operand has 531 states, 423 states have (on average 1.7139479905437351) internal successors, (725), 444 states have internal predecessors, (725), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:52,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:52,141 INFO L93 Difference]: Finished difference Result 1042 states and 1765 transitions. [2025-01-09 03:47:52,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:52,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2025-01-09 03:47:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:52,162 INFO L225 Difference]: With dead ends: 1042 [2025-01-09 03:47:52,162 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 03:47:52,169 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:47:52,176 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 5 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2621 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:52,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2621 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:47:52,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 03:47:52,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-01-09 03:47:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 417 states have (on average 1.7122302158273381) internal successors, (714), 436 states have internal predecessors, (714), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 03:47:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 879 transitions. [2025-01-09 03:47:52,262 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 879 transitions. Word has length 76 [2025-01-09 03:47:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:52,263 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 879 transitions. [2025-01-09 03:47:52,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 879 transitions. [2025-01-09 03:47:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 03:47:52,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:52,271 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] [2025-01-09 03:47:52,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:47:52,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:52,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:52,274 INFO L85 PathProgramCache]: Analyzing trace with hash -591806319, now seen corresponding path program 1 times [2025-01-09 03:47:52,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:52,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198384877] [2025-01-09 03:47:52,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:52,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:52,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 03:47:52,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 03:47:52,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:52,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:52,476 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:47:52,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:52,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198384877] [2025-01-09 03:47:52,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198384877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:52,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:52,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:52,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4422743] [2025-01-09 03:47:52,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:52,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:52,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:52,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:52,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:52,479 INFO L87 Difference]: Start difference. First operand 523 states and 879 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:52,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:52,542 INFO L93 Difference]: Finished difference Result 1028 states and 1735 transitions. [2025-01-09 03:47:52,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:52,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 78 [2025-01-09 03:47:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:52,551 INFO L225 Difference]: With dead ends: 1028 [2025-01-09 03:47:52,551 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 03:47:52,553 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:47:52,554 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 4 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2600 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:47:52,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2600 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:52,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 03:47:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-01-09 03:47:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 417 states have (on average 1.709832134292566) internal successors, (713), 436 states have internal predecessors, (713), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 03:47:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 878 transitions. [2025-01-09 03:47:52,585 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 878 transitions. Word has length 78 [2025-01-09 03:47:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:52,585 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 878 transitions. [2025-01-09 03:47:52,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 878 transitions. [2025-01-09 03:47:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 03:47:52,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:52,590 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] [2025-01-09 03:47:52,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:47:52,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:52,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:52,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1419877383, now seen corresponding path program 1 times [2025-01-09 03:47:52,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:52,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302590975] [2025-01-09 03:47:52,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:52,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:52,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 03:47:52,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 03:47:52,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:52,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:52,762 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:47:52,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:52,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302590975] [2025-01-09 03:47:52,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302590975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:52,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:52,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:52,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374566261] [2025-01-09 03:47:52,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:52,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:52,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:52,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:52,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:52,763 INFO L87 Difference]: Start difference. First operand 523 states and 878 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:52,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:52,814 INFO L93 Difference]: Finished difference Result 1028 states and 1734 transitions. [2025-01-09 03:47:52,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:52,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2025-01-09 03:47:52,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:52,818 INFO L225 Difference]: With dead ends: 1028 [2025-01-09 03:47:52,818 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 03:47:52,821 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:47:52,823 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 3 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2600 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:47:52,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2600 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 03:47:52,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-01-09 03:47:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 417 states have (on average 1.7074340527577938) internal successors, (712), 436 states have internal predecessors, (712), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 03:47:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 877 transitions. [2025-01-09 03:47:52,844 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 877 transitions. Word has length 79 [2025-01-09 03:47:52,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:52,845 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 877 transitions. [2025-01-09 03:47:52,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:52,846 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 877 transitions. [2025-01-09 03:47:52,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 03:47:52,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:52,847 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] [2025-01-09 03:47:52,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:47:52,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:52,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:52,848 INFO L85 PathProgramCache]: Analyzing trace with hash -397668971, now seen corresponding path program 1 times [2025-01-09 03:47:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:52,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119770046] [2025-01-09 03:47:52,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:52,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:52,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 03:47:52,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 03:47:52,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:52,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:52,976 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:47:52,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:52,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119770046] [2025-01-09 03:47:52,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119770046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:52,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:52,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:52,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633299724] [2025-01-09 03:47:52,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:52,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:52,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:52,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:52,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:52,981 INFO L87 Difference]: Start difference. First operand 523 states and 877 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:53,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:53,027 INFO L93 Difference]: Finished difference Result 1028 states and 1733 transitions. [2025-01-09 03:47:53,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:53,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2025-01-09 03:47:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:53,037 INFO L225 Difference]: With dead ends: 1028 [2025-01-09 03:47:53,037 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 03:47:53,039 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:47:53,040 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 2 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2600 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:47:53,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2600 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:53,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 03:47:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-01-09 03:47:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 417 states have (on average 1.7050359712230216) internal successors, (711), 436 states have internal predecessors, (711), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 03:47:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 876 transitions. [2025-01-09 03:47:53,079 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 876 transitions. Word has length 80 [2025-01-09 03:47:53,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:53,080 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 876 transitions. [2025-01-09 03:47:53,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 876 transitions. [2025-01-09 03:47:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 03:47:53,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:53,084 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] [2025-01-09 03:47:53,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:47:53,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:53,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:53,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2146338947, now seen corresponding path program 1 times [2025-01-09 03:47:53,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:53,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34047508] [2025-01-09 03:47:53,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:53,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:53,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 03:47:53,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 03:47:53,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:53,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:53,220 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:47:53,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:53,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34047508] [2025-01-09 03:47:53,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34047508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:53,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:53,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130422811] [2025-01-09 03:47:53,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:53,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:53,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:53,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:53,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:53,222 INFO L87 Difference]: Start difference. First operand 523 states and 876 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:53,259 INFO L93 Difference]: Finished difference Result 1028 states and 1732 transitions. [2025-01-09 03:47:53,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:53,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2025-01-09 03:47:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:53,263 INFO L225 Difference]: With dead ends: 1028 [2025-01-09 03:47:53,263 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 03:47:53,265 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:47:53,267 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 1 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2600 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:47:53,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2600 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 03:47:53,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-01-09 03:47:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 417 states have (on average 1.7026378896882495) internal successors, (710), 436 states have internal predecessors, (710), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 03:47:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 875 transitions. [2025-01-09 03:47:53,289 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 875 transitions. Word has length 81 [2025-01-09 03:47:53,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:53,289 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 875 transitions. [2025-01-09 03:47:53,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:53,289 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 875 transitions. [2025-01-09 03:47:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 03:47:53,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:53,291 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] [2025-01-09 03:47:53,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:47:53,291 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:53,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:53,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1706467994, now seen corresponding path program 1 times [2025-01-09 03:47:53,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:53,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597688801] [2025-01-09 03:47:53,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:53,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:53,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 03:47:53,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 03:47:53,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:53,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:53,380 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:47:53,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:53,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597688801] [2025-01-09 03:47:53,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597688801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:53,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:53,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:53,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801452817] [2025-01-09 03:47:53,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:53,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:53,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:53,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:53,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:53,382 INFO L87 Difference]: Start difference. First operand 523 states and 875 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:53,434 INFO L93 Difference]: Finished difference Result 1028 states and 1731 transitions. [2025-01-09 03:47:53,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:53,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 82 [2025-01-09 03:47:53,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:53,442 INFO L225 Difference]: With dead ends: 1028 [2025-01-09 03:47:53,445 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 03:47:53,448 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:47:53,448 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 0 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2600 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:47:53,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2600 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:53,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 03:47:53,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-01-09 03:47:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 417 states have (on average 1.7002398081534773) internal successors, (709), 436 states have internal predecessors, (709), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 03:47:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 874 transitions. [2025-01-09 03:47:53,485 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 874 transitions. Word has length 82 [2025-01-09 03:47:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:53,486 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 874 transitions. [2025-01-09 03:47:53,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 874 transitions. [2025-01-09 03:47:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 03:47:53,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:53,488 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] [2025-01-09 03:47:53,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:47:53,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:53,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:53,489 INFO L85 PathProgramCache]: Analyzing trace with hash 402074265, now seen corresponding path program 1 times [2025-01-09 03:47:53,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:53,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289469119] [2025-01-09 03:47:53,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:53,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:53,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 03:47:53,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 03:47:53,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:53,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:53,634 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:47:53,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:53,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289469119] [2025-01-09 03:47:53,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289469119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:53,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:53,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:53,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515381468] [2025-01-09 03:47:53,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:53,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:53,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:53,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:53,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:53,638 INFO L87 Difference]: Start difference. First operand 523 states and 874 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:47:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:53,710 INFO L93 Difference]: Finished difference Result 988 states and 1655 transitions. [2025-01-09 03:47:53,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:53,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 82 [2025-01-09 03:47:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:53,715 INFO L225 Difference]: With dead ends: 988 [2025-01-09 03:47:53,715 INFO L226 Difference]: Without dead ends: 517 [2025-01-09 03:47:53,717 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:47:53,718 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 91 mSDsluCounter, 4228 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5090 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:53,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5090 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:53,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-01-09 03:47:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-01-09 03:47:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.6934306569343065) internal successors, (696), 430 states have internal predecessors, (696), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 03:47:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 861 transitions. [2025-01-09 03:47:53,738 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 861 transitions. Word has length 82 [2025-01-09 03:47:53,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:53,739 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 861 transitions. [2025-01-09 03:47:53,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:47:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 861 transitions. [2025-01-09 03:47:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 03:47:53,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:53,742 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] [2025-01-09 03:47:53,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:47:53,742 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:53,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:53,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1527727921, now seen corresponding path program 1 times [2025-01-09 03:47:53,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:53,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735197112] [2025-01-09 03:47:53,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:53,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:53,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 03:47:53,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 03:47:53,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:53,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:53,902 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:47:53,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:53,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735197112] [2025-01-09 03:47:53,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735197112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:53,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:53,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:53,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322622068] [2025-01-09 03:47:53,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:53,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:53,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:53,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:53,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:53,904 INFO L87 Difference]: Start difference. First operand 517 states and 861 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:54,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:54,060 INFO L93 Difference]: Finished difference Result 991 states and 1656 transitions. [2025-01-09 03:47:54,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:47:54,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2025-01-09 03:47:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:54,068 INFO L225 Difference]: With dead ends: 991 [2025-01-09 03:47:54,068 INFO L226 Difference]: Without dead ends: 526 [2025-01-09 03:47:54,075 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:47:54,075 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 55 mSDsluCounter, 3243 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4061 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:47:54,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4061 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:47:54,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-01-09 03:47:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 517. [2025-01-09 03:47:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.683698296836983) internal successors, (692), 430 states have internal predecessors, (692), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 03:47:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 857 transitions. [2025-01-09 03:47:54,092 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 857 transitions. Word has length 83 [2025-01-09 03:47:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:54,092 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 857 transitions. [2025-01-09 03:47:54,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 857 transitions. [2025-01-09 03:47:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 03:47:54,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:54,094 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] [2025-01-09 03:47:54,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:47:54,094 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:54,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:54,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1421254058, now seen corresponding path program 1 times [2025-01-09 03:47:54,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:54,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935559809] [2025-01-09 03:47:54,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:54,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:54,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 03:47:54,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 03:47:54,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:54,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:54,250 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:47:54,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:54,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935559809] [2025-01-09 03:47:54,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935559809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:54,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:54,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:54,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434222943] [2025-01-09 03:47:54,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:54,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:54,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:54,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:54,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:54,252 INFO L87 Difference]: Start difference. First operand 517 states and 857 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:54,392 INFO L93 Difference]: Finished difference Result 991 states and 1652 transitions. [2025-01-09 03:47:54,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:47:54,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-01-09 03:47:54,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:54,397 INFO L225 Difference]: With dead ends: 991 [2025-01-09 03:47:54,397 INFO L226 Difference]: Without dead ends: 526 [2025-01-09 03:47:54,399 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:47:54,399 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 54 mSDsluCounter, 3243 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4061 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:47:54,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4061 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:47:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-01-09 03:47:54,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 517. [2025-01-09 03:47:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.6739659367396593) internal successors, (688), 430 states have internal predecessors, (688), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 03:47:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 853 transitions. [2025-01-09 03:47:54,417 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 853 transitions. Word has length 84 [2025-01-09 03:47:54,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:54,418 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 853 transitions. [2025-01-09 03:47:54,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:54,418 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 853 transitions. [2025-01-09 03:47:54,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 03:47:54,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:54,420 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] [2025-01-09 03:47:54,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:47:54,420 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:54,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:54,421 INFO L85 PathProgramCache]: Analyzing trace with hash 816274762, now seen corresponding path program 1 times [2025-01-09 03:47:54,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:54,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18944480] [2025-01-09 03:47:54,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:54,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:54,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 03:47:54,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 03:47:54,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:54,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:54,538 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:47:54,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:54,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18944480] [2025-01-09 03:47:54,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18944480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:54,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:54,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:54,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544078553] [2025-01-09 03:47:54,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:54,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:54,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:54,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:54,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:54,540 INFO L87 Difference]: Start difference. First operand 517 states and 853 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:54,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:54,670 INFO L93 Difference]: Finished difference Result 991 states and 1648 transitions. [2025-01-09 03:47:54,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:47:54,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2025-01-09 03:47:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:54,682 INFO L225 Difference]: With dead ends: 991 [2025-01-09 03:47:54,682 INFO L226 Difference]: Without dead ends: 526 [2025-01-09 03:47:54,688 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:47:54,689 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 53 mSDsluCounter, 3226 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4043 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:47:54,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4043 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:47:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-01-09 03:47:54,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 517. [2025-01-09 03:47:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.6642335766423357) internal successors, (684), 430 states have internal predecessors, (684), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 03:47:54,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 849 transitions. [2025-01-09 03:47:54,713 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 849 transitions. Word has length 85 [2025-01-09 03:47:54,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:54,714 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 849 transitions. [2025-01-09 03:47:54,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:54,714 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 849 transitions. [2025-01-09 03:47:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 03:47:54,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:54,718 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] [2025-01-09 03:47:54,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:47:54,718 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:54,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:54,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1690726602, now seen corresponding path program 1 times [2025-01-09 03:47:54,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:54,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963248584] [2025-01-09 03:47:54,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:54,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:54,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 03:47:54,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 03:47:54,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:54,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:54,872 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:47:54,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:54,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963248584] [2025-01-09 03:47:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963248584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:54,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:54,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:54,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545146350] [2025-01-09 03:47:54,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:54,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:54,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:54,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:54,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:54,874 INFO L87 Difference]: Start difference. First operand 517 states and 849 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:47:54,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:54,996 INFO L93 Difference]: Finished difference Result 982 states and 1630 transitions. [2025-01-09 03:47:54,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:47:54,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 85 [2025-01-09 03:47:54,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:55,001 INFO L225 Difference]: With dead ends: 982 [2025-01-09 03:47:55,002 INFO L226 Difference]: Without dead ends: 496 [2025-01-09 03:47:55,004 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:47:55,005 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 84 mSDsluCounter, 4117 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 4955 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:47:55,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 4955 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-09 03:47:55,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-01-09 03:47:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 390 states have (on average 1.6666666666666667) internal successors, (650), 409 states have internal predecessors, (650), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 03:47:55,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 815 transitions. [2025-01-09 03:47:55,021 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 815 transitions. Word has length 85 [2025-01-09 03:47:55,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:55,021 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 815 transitions. [2025-01-09 03:47:55,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:47:55,021 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 815 transitions. [2025-01-09 03:47:55,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 03:47:55,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:55,025 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] [2025-01-09 03:47:55,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:47:55,025 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:55,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:55,025 INFO L85 PathProgramCache]: Analyzing trace with hash 397030513, now seen corresponding path program 1 times [2025-01-09 03:47:55,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:55,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565140318] [2025-01-09 03:47:55,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:55,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:55,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 03:47:55,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 03:47:55,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:55,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:55,140 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:47:55,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:55,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565140318] [2025-01-09 03:47:55,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565140318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:55,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:55,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:55,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484311879] [2025-01-09 03:47:55,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:55,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:55,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:55,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:55,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:55,141 INFO L87 Difference]: Start difference. First operand 496 states and 815 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:55,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:55,222 INFO L93 Difference]: Finished difference Result 961 states and 1596 transitions. [2025-01-09 03:47:55,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:47:55,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2025-01-09 03:47:55,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:55,226 INFO L225 Difference]: With dead ends: 961 [2025-01-09 03:47:55,226 INFO L226 Difference]: Without dead ends: 496 [2025-01-09 03:47:55,227 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:47:55,228 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 17 mSDsluCounter, 3183 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3981 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:55,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3981 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:47:55,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-09 03:47:55,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-01-09 03:47:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 390 states have (on average 1.6641025641025642) internal successors, (649), 409 states have internal predecessors, (649), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 03:47:55,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 814 transitions. [2025-01-09 03:47:55,242 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 814 transitions. Word has length 86 [2025-01-09 03:47:55,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:55,242 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 814 transitions. [2025-01-09 03:47:55,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 814 transitions. [2025-01-09 03:47:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 03:47:55,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:55,244 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] [2025-01-09 03:47:55,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:47:55,244 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:55,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:55,244 INFO L85 PathProgramCache]: Analyzing trace with hash -777800251, now seen corresponding path program 1 times [2025-01-09 03:47:55,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:55,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539747998] [2025-01-09 03:47:55,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:55,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 03:47:55,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 03:47:55,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:55,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:55,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:47:55,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:55,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539747998] [2025-01-09 03:47:55,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539747998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:55,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:55,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:47:55,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750834643] [2025-01-09 03:47:55,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:55,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:47:55,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:55,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:47:55,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:47:55,352 INFO L87 Difference]: Start difference. First operand 496 states and 814 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:55,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:55,411 INFO L93 Difference]: Finished difference Result 961 states and 1595 transitions. [2025-01-09 03:47:55,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:47:55,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 87 [2025-01-09 03:47:55,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:55,414 INFO L225 Difference]: With dead ends: 961 [2025-01-09 03:47:55,414 INFO L226 Difference]: Without dead ends: 496 [2025-01-09 03:47:55,416 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:47:55,416 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 16 mSDsluCounter, 3183 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3981 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:47:55,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3981 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:55,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-09 03:47:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-01-09 03:47:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 390 states have (on average 1.6615384615384616) internal successors, (648), 409 states have internal predecessors, (648), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 03:47:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 813 transitions. [2025-01-09 03:47:55,453 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 813 transitions. Word has length 87 [2025-01-09 03:47:55,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:55,453 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 813 transitions. [2025-01-09 03:47:55,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 813 transitions. [2025-01-09 03:47:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 03:47:55,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:55,456 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] [2025-01-09 03:47:55,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:47:55,456 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:55,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:55,456 INFO L85 PathProgramCache]: Analyzing trace with hash 827719882, now seen corresponding path program 1 times [2025-01-09 03:47:55,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:55,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767547194] [2025-01-09 03:47:55,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:55,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:55,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 03:47:55,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 03:47:55,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:55,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:55,523 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:47:55,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:55,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767547194] [2025-01-09 03:47:55,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767547194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:55,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:55,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:55,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918876581] [2025-01-09 03:47:55,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:55,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:55,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:55,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:55,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:55,525 INFO L87 Difference]: Start difference. First operand 496 states and 813 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:55,552 INFO L93 Difference]: Finished difference Result 961 states and 1594 transitions. [2025-01-09 03:47:55,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:55,552 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2025-01-09 03:47:55,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:55,555 INFO L225 Difference]: With dead ends: 961 [2025-01-09 03:47:55,555 INFO L226 Difference]: Without dead ends: 496 [2025-01-09 03:47:55,557 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:47:55,557 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 9 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2412 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:47:55,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2412 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:55,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-09 03:47:55,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-01-09 03:47:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 390 states have (on average 1.658974358974359) internal successors, (647), 409 states have internal predecessors, (647), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 03:47:55,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 812 transitions. [2025-01-09 03:47:55,571 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 812 transitions. Word has length 88 [2025-01-09 03:47:55,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:55,572 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 812 transitions. [2025-01-09 03:47:55,572 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:55,572 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 812 transitions. [2025-01-09 03:47:55,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 03:47:55,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:55,573 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] [2025-01-09 03:47:55,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:47:55,574 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:55,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:55,574 INFO L85 PathProgramCache]: Analyzing trace with hash 393990796, now seen corresponding path program 1 times [2025-01-09 03:47:55,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:55,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505612779] [2025-01-09 03:47:55,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:55,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:55,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 03:47:55,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 03:47:55,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:55,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:55,640 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:47:55,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:55,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505612779] [2025-01-09 03:47:55,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505612779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:55,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:55,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:47:55,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275130762] [2025-01-09 03:47:55,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:55,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:47:55,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:55,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:47:55,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:47:55,641 INFO L87 Difference]: Start difference. First operand 496 states and 812 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:55,677 INFO L93 Difference]: Finished difference Result 955 states and 1582 transitions. [2025-01-09 03:47:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:47:55,678 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2025-01-09 03:47:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:55,682 INFO L225 Difference]: With dead ends: 955 [2025-01-09 03:47:55,682 INFO L226 Difference]: Without dead ends: 496 [2025-01-09 03:47:55,684 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:47:55,684 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 4 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2391 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:47:55,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2391 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:47:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-09 03:47:55,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-01-09 03:47:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 390 states have (on average 1.6564102564102565) internal successors, (646), 409 states have internal predecessors, (646), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 03:47:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 811 transitions. [2025-01-09 03:47:55,700 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 811 transitions. Word has length 88 [2025-01-09 03:47:55,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:55,700 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 811 transitions. [2025-01-09 03:47:55,700 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:47:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 811 transitions. [2025-01-09 03:47:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 03:47:55,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:55,702 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] [2025-01-09 03:47:55,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:47:55,702 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:55,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:55,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2075190128, now seen corresponding path program 1 times [2025-01-09 03:47:55,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:55,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866591958] [2025-01-09 03:47:55,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:55,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:55,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 03:47:55,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 03:47:55,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:55,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:55,899 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:47:55,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:55,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866591958] [2025-01-09 03:47:55,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866591958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:55,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:55,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:47:55,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558412864] [2025-01-09 03:47:55,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:55,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:47:55,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:55,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:47:55,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:47:55,903 INFO L87 Difference]: Start difference. First operand 496 states and 811 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:47:57,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:47:57,566 INFO L93 Difference]: Finished difference Result 951 states and 1594 transitions. [2025-01-09 03:47:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:47:57,567 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 89 [2025-01-09 03:47:57,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:47:57,575 INFO L225 Difference]: With dead ends: 951 [2025-01-09 03:47:57,575 INFO L226 Difference]: Without dead ends: 500 [2025-01-09 03:47:57,578 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:47:57,578 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 1258 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 2538 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 2538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:47:57,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 1535 Invalid, 2888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 2538 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 03:47:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-01-09 03:47:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2025-01-09 03:47:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 393 states have (on average 1.6513994910941476) internal successors, (649), 412 states have internal predecessors, (649), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (96), 79 states have call predecessors, (96), 80 states have call successors, (96) [2025-01-09 03:47:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 830 transitions. [2025-01-09 03:47:57,617 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 830 transitions. Word has length 89 [2025-01-09 03:47:57,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:47:57,617 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 830 transitions. [2025-01-09 03:47:57,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:47:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 830 transitions. [2025-01-09 03:47:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 03:47:57,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:47:57,620 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:47:57,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:47:57,621 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:47:57,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:47:57,622 INFO L85 PathProgramCache]: Analyzing trace with hash -586813272, now seen corresponding path program 1 times [2025-01-09 03:47:57,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:47:57,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934185119] [2025-01-09 03:47:57,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:47:57,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:47:57,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 03:47:57,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 03:47:57,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:47:57,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:47:57,838 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:47:57,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:47:57,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934185119] [2025-01-09 03:47:57,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934185119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:47:57,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:47:57,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:47:57,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197793258] [2025-01-09 03:47:57,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:47:57,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:47:57,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:47:57,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:47:57,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:47:57,840 INFO L87 Difference]: Start difference. First operand 500 states and 830 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:48:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:00,445 INFO L93 Difference]: Finished difference Result 1767 states and 3031 transitions. [2025-01-09 03:48:00,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 03:48:00,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 90 [2025-01-09 03:48:00,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:00,454 INFO L225 Difference]: With dead ends: 1767 [2025-01-09 03:48:00,455 INFO L226 Difference]: Without dead ends: 1312 [2025-01-09 03:48:00,457 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:00,458 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 2264 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 4621 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2325 SdHoareTripleChecker+Valid, 2343 SdHoareTripleChecker+Invalid, 5185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 4621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:00,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2325 Valid, 2343 Invalid, 5185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 4621 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 03:48:00,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2025-01-09 03:48:00,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1253. [2025-01-09 03:48:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 982 states have (on average 1.664969450101833) internal successors, (1635), 1030 states have internal predecessors, (1635), 216 states have call successors, (216), 54 states have call predecessors, (216), 54 states have return successors, (231), 205 states have call predecessors, (231), 211 states have call successors, (231) [2025-01-09 03:48:00,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2082 transitions. [2025-01-09 03:48:00,528 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2082 transitions. Word has length 90 [2025-01-09 03:48:00,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:00,529 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 2082 transitions. [2025-01-09 03:48:00,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:48:00,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2082 transitions. [2025-01-09 03:48:00,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 03:48:00,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:00,531 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:00,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:48:00,531 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:00,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:00,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1264948650, now seen corresponding path program 1 times [2025-01-09 03:48:00,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:00,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257384530] [2025-01-09 03:48:00,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:00,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:00,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:48:00,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:48:00,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:00,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:00,662 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:00,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:00,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257384530] [2025-01-09 03:48:00,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257384530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:00,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:00,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:00,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297628979] [2025-01-09 03:48:00,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:00,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:00,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:00,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:00,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:00,663 INFO L87 Difference]: Start difference. First operand 1253 states and 2082 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:48:04,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:04,083 INFO L93 Difference]: Finished difference Result 5776 states and 9919 transitions. [2025-01-09 03:48:04,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:48:04,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 92 [2025-01-09 03:48:04,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:04,118 INFO L225 Difference]: With dead ends: 5776 [2025-01-09 03:48:04,118 INFO L226 Difference]: Without dead ends: 4568 [2025-01-09 03:48:04,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:48:04,127 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 3007 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 5276 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3126 SdHoareTripleChecker+Valid, 2627 SdHoareTripleChecker+Invalid, 6060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 5276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:04,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3126 Valid, 2627 Invalid, 6060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 5276 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 03:48:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4568 states. [2025-01-09 03:48:04,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4568 to 4089. [2025-01-09 03:48:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4089 states, 3031 states have (on average 1.6598482349059716) internal successors, (5031), 3243 states have internal predecessors, (5031), 895 states have call successors, (895), 146 states have call predecessors, (895), 162 states have return successors, (1089), 873 states have call predecessors, (1089), 890 states have call successors, (1089) [2025-01-09 03:48:04,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 7015 transitions. [2025-01-09 03:48:04,353 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 7015 transitions. Word has length 92 [2025-01-09 03:48:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:04,355 INFO L471 AbstractCegarLoop]: Abstraction has 4089 states and 7015 transitions. [2025-01-09 03:48:04,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:48:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 7015 transitions. [2025-01-09 03:48:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 03:48:04,358 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:04,358 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:04,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:48:04,358 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:04,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:04,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1658211348, now seen corresponding path program 1 times [2025-01-09 03:48:04,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:04,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821299563] [2025-01-09 03:48:04,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:04,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:04,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:48:04,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:48:04,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:04,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:04,474 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:04,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:04,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821299563] [2025-01-09 03:48:04,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821299563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:04,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:04,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:04,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054860959] [2025-01-09 03:48:04,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:04,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:04,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:04,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:04,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:04,476 INFO L87 Difference]: Start difference. First operand 4089 states and 7015 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:48:06,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:06,765 INFO L93 Difference]: Finished difference Result 10798 states and 18653 transitions. [2025-01-09 03:48:06,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 03:48:06,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 92 [2025-01-09 03:48:06,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:06,818 INFO L225 Difference]: With dead ends: 10798 [2025-01-09 03:48:06,818 INFO L226 Difference]: Without dead ends: 7846 [2025-01-09 03:48:06,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:48:06,836 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 2281 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 3489 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 3943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 3489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:06,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2348 Valid, 1560 Invalid, 3943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 3489 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 03:48:06,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7846 states. [2025-01-09 03:48:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7846 to 7547. [2025-01-09 03:48:07,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7547 states, 5632 states have (on average 1.6580255681818181) internal successors, (9338), 6022 states have internal predecessors, (9338), 1587 states have call successors, (1587), 269 states have call predecessors, (1587), 327 states have return successors, (2060), 1546 states have call predecessors, (2060), 1582 states have call successors, (2060) [2025-01-09 03:48:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7547 states to 7547 states and 12985 transitions. [2025-01-09 03:48:07,219 INFO L78 Accepts]: Start accepts. Automaton has 7547 states and 12985 transitions. Word has length 92 [2025-01-09 03:48:07,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:07,219 INFO L471 AbstractCegarLoop]: Abstraction has 7547 states and 12985 transitions. [2025-01-09 03:48:07,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:48:07,219 INFO L276 IsEmpty]: Start isEmpty. Operand 7547 states and 12985 transitions. [2025-01-09 03:48:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 03:48:07,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:07,221 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:07,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:48:07,221 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:07,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:07,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1199869501, now seen corresponding path program 1 times [2025-01-09 03:48:07,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:07,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325050837] [2025-01-09 03:48:07,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:07,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:07,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 03:48:07,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 03:48:07,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:07,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:07,361 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:07,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:07,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325050837] [2025-01-09 03:48:07,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325050837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:07,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:07,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:48:07,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82470539] [2025-01-09 03:48:07,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:07,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:48:07,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:07,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:48:07,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:07,362 INFO L87 Difference]: Start difference. First operand 7547 states and 12985 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:48:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:07,811 INFO L93 Difference]: Finished difference Result 13879 states and 23945 transitions. [2025-01-09 03:48:07,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:48:07,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2025-01-09 03:48:07,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:07,917 INFO L225 Difference]: With dead ends: 13879 [2025-01-09 03:48:07,917 INFO L226 Difference]: Without dead ends: 7634 [2025-01-09 03:48:07,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:07,946 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 0 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3206 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:07,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3206 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7634 states. [2025-01-09 03:48:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7634 to 7620. [2025-01-09 03:48:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7620 states, 5688 states have (on average 1.6510196905766525) internal successors, (9391), 6077 states have internal predecessors, (9391), 1584 states have call successors, (1584), 269 states have call predecessors, (1584), 347 states have return successors, (2123), 1564 states have call predecessors, (2123), 1579 states have call successors, (2123) [2025-01-09 03:48:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7620 states to 7620 states and 13098 transitions. [2025-01-09 03:48:08,413 INFO L78 Accepts]: Start accepts. Automaton has 7620 states and 13098 transitions. Word has length 97 [2025-01-09 03:48:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:08,414 INFO L471 AbstractCegarLoop]: Abstraction has 7620 states and 13098 transitions. [2025-01-09 03:48:08,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:48:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 7620 states and 13098 transitions. [2025-01-09 03:48:08,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 03:48:08,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:08,418 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:08,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:48:08,418 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:08,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:08,419 INFO L85 PathProgramCache]: Analyzing trace with hash -402699568, now seen corresponding path program 1 times [2025-01-09 03:48:08,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:08,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445983624] [2025-01-09 03:48:08,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:08,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:08,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 03:48:08,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 03:48:08,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:08,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:08,545 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:08,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:08,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445983624] [2025-01-09 03:48:08,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445983624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:08,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:08,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:48:08,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341566996] [2025-01-09 03:48:08,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:08,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:48:08,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:08,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:48:08,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:08,546 INFO L87 Difference]: Start difference. First operand 7620 states and 13098 transitions. Second operand has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 03:48:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:09,009 INFO L93 Difference]: Finished difference Result 15105 states and 26418 transitions. [2025-01-09 03:48:09,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:48:09,009 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 104 [2025-01-09 03:48:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:09,062 INFO L225 Difference]: With dead ends: 15105 [2025-01-09 03:48:09,062 INFO L226 Difference]: Without dead ends: 7768 [2025-01-09 03:48:09,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:48:09,094 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 235 mSDsluCounter, 5683 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 6537 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:09,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 6537 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:48:09,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7768 states. [2025-01-09 03:48:09,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7768 to 7644. [2025-01-09 03:48:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7644 states, 5709 states have (on average 1.627605535119986) internal successors, (9292), 6101 states have internal predecessors, (9292), 1584 states have call successors, (1584), 269 states have call predecessors, (1584), 350 states have return successors, (2135), 1564 states have call predecessors, (2135), 1579 states have call successors, (2135) [2025-01-09 03:48:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7644 states to 7644 states and 13011 transitions. [2025-01-09 03:48:09,473 INFO L78 Accepts]: Start accepts. Automaton has 7644 states and 13011 transitions. Word has length 104 [2025-01-09 03:48:09,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:09,474 INFO L471 AbstractCegarLoop]: Abstraction has 7644 states and 13011 transitions. [2025-01-09 03:48:09,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 03:48:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand 7644 states and 13011 transitions. [2025-01-09 03:48:09,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:48:09,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:09,476 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:09,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:48:09,477 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:09,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:09,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1850793288, now seen corresponding path program 1 times [2025-01-09 03:48:09,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:09,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426017737] [2025-01-09 03:48:09,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:09,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:09,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:48:09,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:48:09,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:09,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:48:09,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:09,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426017737] [2025-01-09 03:48:09,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426017737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:09,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:09,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:48:09,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963651898] [2025-01-09 03:48:09,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:09,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:09,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:09,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:09,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:09,599 INFO L87 Difference]: Start difference. First operand 7644 states and 13011 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 03:48:11,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:11,524 INFO L93 Difference]: Finished difference Result 14518 states and 24751 transitions. [2025-01-09 03:48:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:48:11,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 109 [2025-01-09 03:48:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:11,574 INFO L225 Difference]: With dead ends: 14518 [2025-01-09 03:48:11,575 INFO L226 Difference]: Without dead ends: 8192 [2025-01-09 03:48:11,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-01-09 03:48:11,603 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 2006 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 3020 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 3435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 3020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:11,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2075 Valid, 1488 Invalid, 3435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 3020 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 03:48:11,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8192 states. [2025-01-09 03:48:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8192 to 7875. [2025-01-09 03:48:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7875 states, 5882 states have (on average 1.616286977218633) internal successors, (9507), 6292 states have internal predecessors, (9507), 1601 states have call successors, (1601), 295 states have call predecessors, (1601), 391 states have return successors, (2224), 1578 states have call predecessors, (2224), 1596 states have call successors, (2224) [2025-01-09 03:48:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7875 states to 7875 states and 13332 transitions. [2025-01-09 03:48:12,050 INFO L78 Accepts]: Start accepts. Automaton has 7875 states and 13332 transitions. Word has length 109 [2025-01-09 03:48:12,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:12,050 INFO L471 AbstractCegarLoop]: Abstraction has 7875 states and 13332 transitions. [2025-01-09 03:48:12,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 03:48:12,051 INFO L276 IsEmpty]: Start isEmpty. Operand 7875 states and 13332 transitions. [2025-01-09 03:48:12,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:48:12,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:12,053 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:48:12,053 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:12,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:12,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1329887022, now seen corresponding path program 1 times [2025-01-09 03:48:12,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:12,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402763358] [2025-01-09 03:48:12,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:12,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:12,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:48:12,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:48:12,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:12,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:48:12,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:12,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402763358] [2025-01-09 03:48:12,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402763358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:12,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:12,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 03:48:12,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702420781] [2025-01-09 03:48:12,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:12,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:48:12,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:12,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:48:12,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:48:12,311 INFO L87 Difference]: Start difference. First operand 7875 states and 13332 transitions. Second operand has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-01-09 03:48:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:16,236 INFO L93 Difference]: Finished difference Result 16532 states and 27729 transitions. [2025-01-09 03:48:16,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 03:48:16,236 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 116 [2025-01-09 03:48:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:16,313 INFO L225 Difference]: With dead ends: 16532 [2025-01-09 03:48:16,313 INFO L226 Difference]: Without dead ends: 9794 [2025-01-09 03:48:16,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2025-01-09 03:48:16,336 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 2845 mSDsluCounter, 3040 mSDsCounter, 0 mSdLazyCounter, 7246 mSolverCounterSat, 619 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2918 SdHoareTripleChecker+Valid, 3392 SdHoareTripleChecker+Invalid, 7865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 619 IncrementalHoareTripleChecker+Valid, 7246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:16,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2918 Valid, 3392 Invalid, 7865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [619 Valid, 7246 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 03:48:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9794 states. [2025-01-09 03:48:16,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9794 to 9349. [2025-01-09 03:48:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9349 states, 7048 states have (on average 1.5927922814982973) internal successors, (11226), 7517 states have internal predecessors, (11226), 1784 states have call successors, (1784), 382 states have call predecessors, (1784), 516 states have return successors, (2497), 1740 states have call predecessors, (2497), 1779 states have call successors, (2497) [2025-01-09 03:48:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9349 states to 9349 states and 15507 transitions. [2025-01-09 03:48:16,738 INFO L78 Accepts]: Start accepts. Automaton has 9349 states and 15507 transitions. Word has length 116 [2025-01-09 03:48:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:16,739 INFO L471 AbstractCegarLoop]: Abstraction has 9349 states and 15507 transitions. [2025-01-09 03:48:16,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-01-09 03:48:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 9349 states and 15507 transitions. [2025-01-09 03:48:16,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:48:16,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:16,741 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:48:16,742 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:16,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:16,742 INFO L85 PathProgramCache]: Analyzing trace with hash 491622133, now seen corresponding path program 1 times [2025-01-09 03:48:16,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:16,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892677264] [2025-01-09 03:48:16,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:16,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:16,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:48:16,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:48:16,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:16,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:48:16,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:16,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892677264] [2025-01-09 03:48:16,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892677264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:16,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:16,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:48:16,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669978389] [2025-01-09 03:48:16,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:16,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:48:16,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:16,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:48:16,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:16,892 INFO L87 Difference]: Start difference. First operand 9349 states and 15507 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:48:17,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:17,468 INFO L93 Difference]: Finished difference Result 21937 states and 36488 transitions. [2025-01-09 03:48:17,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:48:17,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 114 [2025-01-09 03:48:17,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:17,557 INFO L225 Difference]: With dead ends: 21937 [2025-01-09 03:48:17,558 INFO L226 Difference]: Without dead ends: 13906 [2025-01-09 03:48:17,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:48:17,591 INFO L435 NwaCegarLoop]: 1331 mSDtfsCounter, 761 mSDsluCounter, 7384 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 8715 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:17,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 8715 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:17,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13906 states. [2025-01-09 03:48:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13906 to 12052. [2025-01-09 03:48:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12052 states, 9066 states have (on average 1.6061107434370174) internal successors, (14561), 9668 states have internal predecessors, (14561), 2355 states have call successors, (2355), 471 states have call predecessors, (2355), 630 states have return successors, (3236), 2320 states have call predecessors, (3236), 2350 states have call successors, (3236) [2025-01-09 03:48:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12052 states to 12052 states and 20152 transitions. [2025-01-09 03:48:18,168 INFO L78 Accepts]: Start accepts. Automaton has 12052 states and 20152 transitions. Word has length 114 [2025-01-09 03:48:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:18,169 INFO L471 AbstractCegarLoop]: Abstraction has 12052 states and 20152 transitions. [2025-01-09 03:48:18,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:48:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 12052 states and 20152 transitions. [2025-01-09 03:48:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:48:18,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:18,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 03:48:18,172 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:18,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:18,172 INFO L85 PathProgramCache]: Analyzing trace with hash -504866963, now seen corresponding path program 1 times [2025-01-09 03:48:18,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:18,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530491886] [2025-01-09 03:48:18,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:18,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:18,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:48:18,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:48:18,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:18,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:48:18,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:18,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530491886] [2025-01-09 03:48:18,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530491886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:18,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:18,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 03:48:18,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801020061] [2025-01-09 03:48:18,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:18,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:48:18,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:18,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:48:18,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:48:18,364 INFO L87 Difference]: Start difference. First operand 12052 states and 20152 transitions. Second operand has 12 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:48:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:23,535 INFO L93 Difference]: Finished difference Result 42010 states and 72868 transitions. [2025-01-09 03:48:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:48:23,535 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 116 [2025-01-09 03:48:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:23,766 INFO L225 Difference]: With dead ends: 42010 [2025-01-09 03:48:23,767 INFO L226 Difference]: Without dead ends: 30003 [2025-01-09 03:48:23,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-01-09 03:48:23,842 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 3160 mSDsluCounter, 5517 mSDsCounter, 0 mSdLazyCounter, 8898 mSolverCounterSat, 902 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3196 SdHoareTripleChecker+Valid, 6329 SdHoareTripleChecker+Invalid, 9800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 902 IncrementalHoareTripleChecker+Valid, 8898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:23,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3196 Valid, 6329 Invalid, 9800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [902 Valid, 8898 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 03:48:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30003 states. [2025-01-09 03:48:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30003 to 29802. [2025-01-09 03:48:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29802 states, 21062 states have (on average 1.580524166745798) internal successors, (33289), 22865 states have internal predecessors, (33289), 7395 states have call successors, (7395), 937 states have call predecessors, (7395), 1344 states have return successors, (10462), 7375 states have call predecessors, (10462), 7390 states have call successors, (10462) [2025-01-09 03:48:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29802 states to 29802 states and 51146 transitions. [2025-01-09 03:48:25,476 INFO L78 Accepts]: Start accepts. Automaton has 29802 states and 51146 transitions. Word has length 116 [2025-01-09 03:48:25,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:25,477 INFO L471 AbstractCegarLoop]: Abstraction has 29802 states and 51146 transitions. [2025-01-09 03:48:25,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:48:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 29802 states and 51146 transitions. [2025-01-09 03:48:25,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:48:25,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:25,479 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 03:48:25,480 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:25,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:25,480 INFO L85 PathProgramCache]: Analyzing trace with hash -22202552, now seen corresponding path program 1 times [2025-01-09 03:48:25,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:25,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599089986] [2025-01-09 03:48:25,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:25,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:25,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:48:25,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:48:25,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:25,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:48:25,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:25,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599089986] [2025-01-09 03:48:25,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599089986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:25,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:25,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 03:48:25,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135435194] [2025-01-09 03:48:25,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:25,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:48:25,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:25,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:48:25,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:48:25,832 INFO L87 Difference]: Start difference. First operand 29802 states and 51146 transitions. Second operand has 12 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:48:33,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:33,920 INFO L93 Difference]: Finished difference Result 110919 states and 198605 transitions. [2025-01-09 03:48:33,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:48:33,921 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 117 [2025-01-09 03:48:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:34,609 INFO L225 Difference]: With dead ends: 110919 [2025-01-09 03:48:34,609 INFO L226 Difference]: Without dead ends: 81162 [2025-01-09 03:48:34,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-01-09 03:48:34,792 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 3912 mSDsluCounter, 5199 mSDsCounter, 0 mSdLazyCounter, 8299 mSolverCounterSat, 1163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3948 SdHoareTripleChecker+Valid, 6004 SdHoareTripleChecker+Invalid, 9462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1163 IncrementalHoareTripleChecker+Valid, 8299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:34,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3948 Valid, 6004 Invalid, 9462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1163 Valid, 8299 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 03:48:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81162 states. [2025-01-09 03:48:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81162 to 80777. [2025-01-09 03:48:40,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80777 states, 53174 states have (on average 1.5543874826042803) internal successors, (82653), 58807 states have internal predecessors, (82653), 24678 states have call successors, (24678), 1869 states have call predecessors, (24678), 2924 states have return successors, (36496), 24854 states have call predecessors, (36496), 24673 states have call successors, (36496) [2025-01-09 03:48:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80777 states to 80777 states and 143827 transitions. [2025-01-09 03:48:41,015 INFO L78 Accepts]: Start accepts. Automaton has 80777 states and 143827 transitions. Word has length 117 [2025-01-09 03:48:41,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:41,017 INFO L471 AbstractCegarLoop]: Abstraction has 80777 states and 143827 transitions. [2025-01-09 03:48:41,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:48:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 80777 states and 143827 transitions. [2025-01-09 03:48:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:48:41,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:41,020 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 03:48:41,021 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:41,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:41,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1210849641, now seen corresponding path program 1 times [2025-01-09 03:48:41,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:41,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064967881] [2025-01-09 03:48:41,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:41,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:41,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:48:41,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:48:41,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:41,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:48:41,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:41,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064967881] [2025-01-09 03:48:41,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064967881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:41,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:41,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 03:48:41,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272061426] [2025-01-09 03:48:41,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:41,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:48:41,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:41,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:48:41,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:48:41,179 INFO L87 Difference]: Start difference. First operand 80777 states and 143827 transitions. Second operand has 12 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 6 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12)