./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d9d31939acfea5ee9b43b1f06257671943c7251c27c351c5e445aa6495fd098 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:25:40,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:25:40,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:25:40,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:25:40,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:25:40,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:25:40,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:25:40,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:25:40,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:25:40,521 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:25:40,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:25:40,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:25:40,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:25:40,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:25:40,521 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:25:40,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:25:40,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:25:40,521 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:25:40,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:25:40,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:25:40,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:25:40,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:25:40,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:25:40,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:25:40,522 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:25:40,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:25:40,522 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:25:40,522 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:25:40,522 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:25:40,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:25:40,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:25:40,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:25:40,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:25:40,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:25:40,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:25:40,523 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:25:40,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:25:40,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:25:40,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:25:40,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:25:40,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:25:40,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:25:40,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:25:40,524 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d9d31939acfea5ee9b43b1f06257671943c7251c27c351c5e445aa6495fd098 [2025-03-08 05:25:40,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:25:40,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:25:40,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:25:40,744 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:25:40,744 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:25:40,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c [2025-03-08 05:25:41,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aaac216b/b9147cee727f4f5fa5cba78d2e6a16ce/FLAG2d54ae91f [2025-03-08 05:25:42,306 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:25:42,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c [2025-03-08 05:25:42,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aaac216b/b9147cee727f4f5fa5cba78d2e6a16ce/FLAG2d54ae91f [2025-03-08 05:25:42,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aaac216b/b9147cee727f4f5fa5cba78d2e6a16ce [2025-03-08 05:25:42,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:25:42,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:25:42,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:25:42,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:25:42,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:25:42,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:42" (1/1) ... [2025-03-08 05:25:42,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@122c5c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:42, skipping insertion in model container [2025-03-08 05:25:42,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:42" (1/1) ... [2025-03-08 05:25:42,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:25:42,839 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c[38051,38064] [2025-03-08 05:25:42,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:25:42,927 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:25:42,932 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2025-03-08 05:25:42,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [150] [2025-03-08 05:25:42,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [164] [2025-03-08 05:25:42,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [284] [2025-03-08 05:25:42,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [322] [2025-03-08 05:25:42,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1825] [2025-03-08 05:25:42,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1834] [2025-03-08 05:25:42,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2200] [2025-03-08 05:25:42,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2552] [2025-03-08 05:25:42,935 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2733] [2025-03-08 05:25:42,972 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c[38051,38064] [2025-03-08 05:25:43,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:25:43,025 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:25:43,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:43 WrapperNode [2025-03-08 05:25:43,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:25:43,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:25:43,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:25:43,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:25:43,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:43" (1/1) ... [2025-03-08 05:25:43,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:43" (1/1) ... [2025-03-08 05:25:43,084 INFO L138 Inliner]: procedures = 92, calls = 338, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 813 [2025-03-08 05:25:43,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:25:43,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:25:43,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:25:43,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:25:43,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:43" (1/1) ... [2025-03-08 05:25:43,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:43" (1/1) ... [2025-03-08 05:25:43,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:43" (1/1) ... [2025-03-08 05:25:43,132 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-08 05:25:43,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:43" (1/1) ... [2025-03-08 05:25:43,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:43" (1/1) ... [2025-03-08 05:25:43,154 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:43" (1/1) ... [2025-03-08 05:25:43,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:43" (1/1) ... [2025-03-08 05:25:43,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:43" (1/1) ... [2025-03-08 05:25:43,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:43" (1/1) ... [2025-03-08 05:25:43,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:25:43,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:25:43,185 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:25:43,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:25:43,186 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:43" (1/1) ... [2025-03-08 05:25:43,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:25:43,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:43,213 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:25:43,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:25:43,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:25:43,238 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-08 05:25:43,238 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-08 05:25:43,240 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:25:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:25:43,241 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:25:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:25:43,241 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:25:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:25:43,241 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:25:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:25:43,241 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:25:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:25:43,241 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:25:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:25:43,241 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-08 05:25:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-08 05:25:43,241 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:25:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:25:43,241 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:25:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:25:43,241 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:25:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:25:43,241 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:25:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:25:43,241 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:25:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:25:43,241 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:25:43,241 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:25:43,241 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:25:43,242 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:25:43,242 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:25:43,242 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2025-03-08 05:25:43,242 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2025-03-08 05:25:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:25:43,243 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:25:43,243 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:25:43,243 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:25:43,243 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:25:43,243 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:25:43,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:25:43,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:25:43,243 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:25:43,243 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:25:43,407 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:25:43,409 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:25:43,465 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L281: #res := ~retValue_acc~2; [2025-03-08 05:25:43,490 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: #res := ~retValue_acc~0; [2025-03-08 05:25:43,493 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L403: #res := ~retValue_acc~5; [2025-03-08 05:25:43,807 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1098: #res := ~retValue_acc~13; [2025-03-08 05:25:43,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1202: #res := ~retValue_acc~16; [2025-03-08 05:25:43,876 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: #res := ~retValue_acc~1; [2025-03-08 05:25:43,989 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1188-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~15#1; [2025-03-08 05:25:43,989 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L604-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~8#1; [2025-03-08 05:25:44,073 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~11#1; [2025-03-08 05:25:44,074 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: isIdle_#res#1 := isIdle_~retValue_acc~12#1; [2025-03-08 05:25:44,111 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~6#1; [2025-03-08 05:25:44,151 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080: #res := ~retValue_acc~24; [2025-03-08 05:25:44,211 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L319-1: valid_product_#res#1 := valid_product_~retValue_acc~4#1; [2025-03-08 05:25:44,211 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2549-1: main_#res#1 := main_~retValue_acc~22#1; [2025-03-08 05:25:44,220 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844: #res := ~retValue_acc~23; [2025-03-08 05:25:44,222 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L570: #res := ~retValue_acc~7; [2025-03-08 05:25:44,226 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3391: #res := ~retValue_acc~25; [2025-03-08 05:25:44,348 INFO L? ?]: Removed 429 outVars from TransFormulas that were not future-live. [2025-03-08 05:25:44,348 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:25:44,372 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:25:44,372 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:25:44,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:44 BoogieIcfgContainer [2025-03-08 05:25:44,373 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:25:44,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:25:44,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:25:44,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:25:44,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:25:42" (1/3) ... [2025-03-08 05:25:44,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5255e27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:44, skipping insertion in model container [2025-03-08 05:25:44,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:43" (2/3) ... [2025-03-08 05:25:44,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5255e27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:44, skipping insertion in model container [2025-03-08 05:25:44,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:44" (3/3) ... [2025-03-08 05:25:44,380 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product18.cil.c [2025-03-08 05:25:44,392 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:25:44,393 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product18.cil.c that has 23 procedures, 539 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:25:44,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:25:44,456 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;@42f879d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:25:44,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:25:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 539 states, 424 states have (on average 1.7075471698113207) internal successors, (724), 447 states have internal predecessors, (724), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 05:25:44,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 05:25:44,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:44,472 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] [2025-03-08 05:25:44,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:44,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:44,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1856991961, now seen corresponding path program 1 times [2025-03-08 05:25:44,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:44,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045766240] [2025-03-08 05:25:44,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:44,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:44,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 05:25:44,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 05:25:44,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:44,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:44,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:44,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045766240] [2025-03-08 05:25:44,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045766240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:44,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:44,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:44,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375334441] [2025-03-08 05:25:44,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:44,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:44,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:44,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:44,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:44,960 INFO L87 Difference]: Start difference. First operand has 539 states, 424 states have (on average 1.7075471698113207) internal successors, (724), 447 states have internal predecessors, (724), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:45,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:45,094 INFO L93 Difference]: Finished difference Result 1058 states and 1787 transitions. [2025-03-08 05:25:45,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:45,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2025-03-08 05:25:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:45,116 INFO L225 Difference]: With dead ends: 1058 [2025-03-08 05:25:45,119 INFO L226 Difference]: Without dead ends: 531 [2025-03-08 05:25:45,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:45,133 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 5 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:45,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2654 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:45,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-08 05:25:45,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-03-08 05:25:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 418 states have (on average 1.7057416267942584) internal successors, (713), 439 states have internal predecessors, (713), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:25:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 890 transitions. [2025-03-08 05:25:45,205 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 890 transitions. Word has length 56 [2025-03-08 05:25:45,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:45,205 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 890 transitions. [2025-03-08 05:25:45,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:45,206 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 890 transitions. [2025-03-08 05:25:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 05:25:45,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:45,209 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] [2025-03-08 05:25:45,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:25:45,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:45,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:45,210 INFO L85 PathProgramCache]: Analyzing trace with hash -95955382, now seen corresponding path program 1 times [2025-03-08 05:25:45,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:45,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366435796] [2025-03-08 05:25:45,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:45,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:45,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 05:25:45,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 05:25:45,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:45,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:45,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:45,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366435796] [2025-03-08 05:25:45,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366435796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:45,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:45,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:45,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935166027] [2025-03-08 05:25:45,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:45,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:45,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:45,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:45,392 INFO L87 Difference]: Start difference. First operand 531 states and 890 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:45,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:45,461 INFO L93 Difference]: Finished difference Result 1044 states and 1757 transitions. [2025-03-08 05:25:45,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:45,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2025-03-08 05:25:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:45,469 INFO L225 Difference]: With dead ends: 1044 [2025-03-08 05:25:45,470 INFO L226 Difference]: Without dead ends: 531 [2025-03-08 05:25:45,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:45,475 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 4 mSDsluCounter, 1754 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:45,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2633 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:45,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-08 05:25:45,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-03-08 05:25:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 418 states have (on average 1.7033492822966507) internal successors, (712), 439 states have internal predecessors, (712), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:25:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 889 transitions. [2025-03-08 05:25:45,500 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 889 transitions. Word has length 58 [2025-03-08 05:25:45,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:45,501 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 889 transitions. [2025-03-08 05:25:45,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 889 transitions. [2025-03-08 05:25:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 05:25:45,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:45,506 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] [2025-03-08 05:25:45,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:25:45,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:45,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:45,507 INFO L85 PathProgramCache]: Analyzing trace with hash 195957008, now seen corresponding path program 1 times [2025-03-08 05:25:45,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:45,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507426514] [2025-03-08 05:25:45,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:45,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:45,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 05:25:45,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 05:25:45,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:45,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:45,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:45,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507426514] [2025-03-08 05:25:45,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507426514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:45,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:45,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:45,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159225049] [2025-03-08 05:25:45,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:45,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:45,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:45,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:45,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:45,644 INFO L87 Difference]: Start difference. First operand 531 states and 889 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:45,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:45,687 INFO L93 Difference]: Finished difference Result 1044 states and 1756 transitions. [2025-03-08 05:25:45,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:45,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2025-03-08 05:25:45,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:45,691 INFO L225 Difference]: With dead ends: 1044 [2025-03-08 05:25:45,691 INFO L226 Difference]: Without dead ends: 531 [2025-03-08 05:25:45,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:45,694 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 3 mSDsluCounter, 1754 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:45,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2633 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:45,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-08 05:25:45,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-03-08 05:25:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 418 states have (on average 1.700956937799043) internal successors, (711), 439 states have internal predecessors, (711), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:25:45,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 888 transitions. [2025-03-08 05:25:45,721 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 888 transitions. Word has length 59 [2025-03-08 05:25:45,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:45,721 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 888 transitions. [2025-03-08 05:25:45,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 888 transitions. [2025-03-08 05:25:45,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 05:25:45,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:45,723 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] [2025-03-08 05:25:45,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:25:45,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:45,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:45,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1321260621, now seen corresponding path program 1 times [2025-03-08 05:25:45,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:45,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964332894] [2025-03-08 05:25:45,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:45,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:45,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 05:25:45,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 05:25:45,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:45,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:45,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:45,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:45,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964332894] [2025-03-08 05:25:45,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964332894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:45,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:45,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:45,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969168344] [2025-03-08 05:25:45,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:45,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:45,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:45,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:45,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:45,866 INFO L87 Difference]: Start difference. First operand 531 states and 888 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:45,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:45,912 INFO L93 Difference]: Finished difference Result 1044 states and 1755 transitions. [2025-03-08 05:25:45,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:45,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2025-03-08 05:25:45,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:45,917 INFO L225 Difference]: With dead ends: 1044 [2025-03-08 05:25:45,918 INFO L226 Difference]: Without dead ends: 531 [2025-03-08 05:25:45,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:45,922 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 2 mSDsluCounter, 1754 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:45,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2633 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-08 05:25:45,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-03-08 05:25:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 418 states have (on average 1.6985645933014355) internal successors, (710), 439 states have internal predecessors, (710), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:25:45,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 887 transitions. [2025-03-08 05:25:45,948 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 887 transitions. Word has length 60 [2025-03-08 05:25:45,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:45,949 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 887 transitions. [2025-03-08 05:25:45,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:45,950 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 887 transitions. [2025-03-08 05:25:45,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 05:25:45,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:45,951 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] [2025-03-08 05:25:45,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:25:45,952 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:45,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:45,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1783078925, now seen corresponding path program 1 times [2025-03-08 05:25:45,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:45,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462561019] [2025-03-08 05:25:45,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:45,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:45,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 05:25:45,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 05:25:45,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:45,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:46,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:46,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462561019] [2025-03-08 05:25:46,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462561019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:46,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:46,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:46,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759661975] [2025-03-08 05:25:46,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:46,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:46,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:46,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:46,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:46,097 INFO L87 Difference]: Start difference. First operand 531 states and 887 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:46,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:46,132 INFO L93 Difference]: Finished difference Result 1044 states and 1754 transitions. [2025-03-08 05:25:46,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:46,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2025-03-08 05:25:46,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:46,138 INFO L225 Difference]: With dead ends: 1044 [2025-03-08 05:25:46,138 INFO L226 Difference]: Without dead ends: 531 [2025-03-08 05:25:46,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:46,140 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 1 mSDsluCounter, 1754 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:46,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2633 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-08 05:25:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-03-08 05:25:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 418 states have (on average 1.6961722488038278) internal successors, (709), 439 states have internal predecessors, (709), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:25:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 886 transitions. [2025-03-08 05:25:46,165 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 886 transitions. Word has length 61 [2025-03-08 05:25:46,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:46,165 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 886 transitions. [2025-03-08 05:25:46,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 886 transitions. [2025-03-08 05:25:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 05:25:46,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:46,168 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] [2025-03-08 05:25:46,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:25:46,169 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:46,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:46,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1432597072, now seen corresponding path program 1 times [2025-03-08 05:25:46,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:46,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604855574] [2025-03-08 05:25:46,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:46,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:46,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 05:25:46,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 05:25:46,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:46,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:46,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:46,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604855574] [2025-03-08 05:25:46,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604855574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:46,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:46,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:25:46,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462529413] [2025-03-08 05:25:46,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:46,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:25:46,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:46,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:25:46,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:25:46,431 INFO L87 Difference]: Start difference. First operand 531 states and 886 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:25:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:46,548 INFO L93 Difference]: Finished difference Result 1010 states and 1686 transitions. [2025-03-08 05:25:46,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:25:46,549 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 62 [2025-03-08 05:25:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:46,553 INFO L225 Difference]: With dead ends: 1010 [2025-03-08 05:25:46,554 INFO L226 Difference]: Without dead ends: 546 [2025-03-08 05:25:46,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:25:46,557 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 91 mSDsluCounter, 6035 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6909 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:46,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6909 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-03-08 05:25:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2025-03-08 05:25:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 428 states have (on average 1.691588785046729) internal successors, (724), 451 states have internal predecessors, (724), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2025-03-08 05:25:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 905 transitions. [2025-03-08 05:25:46,580 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 905 transitions. Word has length 62 [2025-03-08 05:25:46,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:46,580 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 905 transitions. [2025-03-08 05:25:46,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:25:46,581 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 905 transitions. [2025-03-08 05:25:46,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 05:25:46,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:46,584 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] [2025-03-08 05:25:46,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:25:46,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:46,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:46,585 INFO L85 PathProgramCache]: Analyzing trace with hash -268143407, now seen corresponding path program 1 times [2025-03-08 05:25:46,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:46,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924436464] [2025-03-08 05:25:46,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:46,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:46,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 05:25:46,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 05:25:46,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:46,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:46,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:46,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924436464] [2025-03-08 05:25:46,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924436464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:46,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:46,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:46,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693021298] [2025-03-08 05:25:46,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:46,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:46,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:46,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:46,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:46,668 INFO L87 Difference]: Start difference. First operand 544 states and 905 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:46,700 INFO L93 Difference]: Finished difference Result 1062 states and 1780 transitions. [2025-03-08 05:25:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:46,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 62 [2025-03-08 05:25:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:46,704 INFO L225 Difference]: With dead ends: 1062 [2025-03-08 05:25:46,704 INFO L226 Difference]: Without dead ends: 525 [2025-03-08 05:25:46,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:46,706 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 0 mSDsluCounter, 1755 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:46,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2635 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:46,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-08 05:25:46,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2025-03-08 05:25:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.6868932038834952) internal successors, (695), 433 states have internal predecessors, (695), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:25:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 872 transitions. [2025-03-08 05:25:46,720 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 872 transitions. Word has length 62 [2025-03-08 05:25:46,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:46,721 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 872 transitions. [2025-03-08 05:25:46,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:46,721 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 872 transitions. [2025-03-08 05:25:46,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 05:25:46,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:46,722 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] [2025-03-08 05:25:46,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:25:46,722 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:46,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:46,723 INFO L85 PathProgramCache]: Analyzing trace with hash -590683726, now seen corresponding path program 1 times [2025-03-08 05:25:46,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:46,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882251564] [2025-03-08 05:25:46,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:46,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:46,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 05:25:46,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 05:25:46,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:46,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:46,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:46,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882251564] [2025-03-08 05:25:46,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882251564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:46,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:46,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:46,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559207617] [2025-03-08 05:25:46,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:46,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:46,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:46,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:46,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:46,846 INFO L87 Difference]: Start difference. First operand 525 states and 872 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:46,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:46,996 INFO L93 Difference]: Finished difference Result 1007 states and 1678 transitions. [2025-03-08 05:25:46,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:46,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 63 [2025-03-08 05:25:46,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:47,000 INFO L225 Difference]: With dead ends: 1007 [2025-03-08 05:25:47,001 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 05:25:47,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:47,003 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 55 mSDsluCounter, 3287 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4116 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:47,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4116 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 05:25:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 525. [2025-03-08 05:25:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.6771844660194175) internal successors, (691), 433 states have internal predecessors, (691), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:25:47,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 868 transitions. [2025-03-08 05:25:47,020 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 868 transitions. Word has length 63 [2025-03-08 05:25:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:47,021 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 868 transitions. [2025-03-08 05:25:47,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 868 transitions. [2025-03-08 05:25:47,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 05:25:47,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:47,022 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] [2025-03-08 05:25:47,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:25:47,022 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:47,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:47,023 INFO L85 PathProgramCache]: Analyzing trace with hash 491334489, now seen corresponding path program 1 times [2025-03-08 05:25:47,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:47,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314126204] [2025-03-08 05:25:47,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:47,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:47,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 05:25:47,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 05:25:47,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:47,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:47,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:47,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314126204] [2025-03-08 05:25:47,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314126204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:47,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:47,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:47,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002337017] [2025-03-08 05:25:47,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:47,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:47,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:47,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:47,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:47,122 INFO L87 Difference]: Start difference. First operand 525 states and 868 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:47,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:47,274 INFO L93 Difference]: Finished difference Result 1007 states and 1674 transitions. [2025-03-08 05:25:47,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:47,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 64 [2025-03-08 05:25:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:47,279 INFO L225 Difference]: With dead ends: 1007 [2025-03-08 05:25:47,279 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 05:25:47,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:47,283 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 54 mSDsluCounter, 3287 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4116 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:47,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4116 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:47,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 05:25:47,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 525. [2025-03-08 05:25:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.6674757281553398) internal successors, (687), 433 states have internal predecessors, (687), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:25:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 864 transitions. [2025-03-08 05:25:47,308 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 864 transitions. Word has length 64 [2025-03-08 05:25:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:47,308 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 864 transitions. [2025-03-08 05:25:47,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 864 transitions. [2025-03-08 05:25:47,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:25:47,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:47,312 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] [2025-03-08 05:25:47,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:25:47,312 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:47,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1142635345, now seen corresponding path program 1 times [2025-03-08 05:25:47,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:47,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005484575] [2025-03-08 05:25:47,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:47,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:47,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 05:25:47,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:25:47,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:47,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:47,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:47,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:47,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005484575] [2025-03-08 05:25:47,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005484575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:47,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:47,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:47,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372288473] [2025-03-08 05:25:47,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:47,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:47,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:47,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:47,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:47,420 INFO L87 Difference]: Start difference. First operand 525 states and 864 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:47,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:47,555 INFO L93 Difference]: Finished difference Result 1007 states and 1670 transitions. [2025-03-08 05:25:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:47,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2025-03-08 05:25:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:47,559 INFO L225 Difference]: With dead ends: 1007 [2025-03-08 05:25:47,559 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 05:25:47,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:47,562 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 53 mSDsluCounter, 3270 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4098 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:47,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4098 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 05:25:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 525. [2025-03-08 05:25:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.6577669902912622) internal successors, (683), 433 states have internal predecessors, (683), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:25:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 860 transitions. [2025-03-08 05:25:47,577 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 860 transitions. Word has length 65 [2025-03-08 05:25:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:47,577 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 860 transitions. [2025-03-08 05:25:47,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 860 transitions. [2025-03-08 05:25:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:25:47,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:47,578 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] [2025-03-08 05:25:47,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:25:47,579 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:47,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:47,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1564422432, now seen corresponding path program 1 times [2025-03-08 05:25:47,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:47,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124526868] [2025-03-08 05:25:47,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:47,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:47,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 05:25:47,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:25:47,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:47,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:47,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:47,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124526868] [2025-03-08 05:25:47,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124526868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:47,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:47,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:47,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281107306] [2025-03-08 05:25:47,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:47,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:47,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:47,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:47,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:47,686 INFO L87 Difference]: Start difference. First operand 525 states and 860 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:25:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:47,746 INFO L93 Difference]: Finished difference Result 998 states and 1652 transitions. [2025-03-08 05:25:47,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:25:47,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2025-03-08 05:25:47,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:47,750 INFO L225 Difference]: With dead ends: 998 [2025-03-08 05:25:47,750 INFO L226 Difference]: Without dead ends: 504 [2025-03-08 05:25:47,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:25:47,754 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 84 mSDsluCounter, 4172 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5021 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:47,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5021 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-08 05:25:47,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2025-03-08 05:25:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 391 states have (on average 1.659846547314578) internal successors, (649), 412 states have internal predecessors, (649), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:25:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 826 transitions. [2025-03-08 05:25:47,768 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 826 transitions. Word has length 65 [2025-03-08 05:25:47,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:47,769 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 826 transitions. [2025-03-08 05:25:47,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:25:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 826 transitions. [2025-03-08 05:25:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 05:25:47,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:47,770 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] [2025-03-08 05:25:47,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:25:47,771 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:47,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:47,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1072888778, now seen corresponding path program 1 times [2025-03-08 05:25:47,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:47,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668618642] [2025-03-08 05:25:47,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:47,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:47,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 05:25:47,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 05:25:47,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:47,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:47,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:47,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668618642] [2025-03-08 05:25:47,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668618642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:47,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:47,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:47,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434883478] [2025-03-08 05:25:47,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:47,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:47,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:47,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:47,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:47,873 INFO L87 Difference]: Start difference. First operand 504 states and 826 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:47,929 INFO L93 Difference]: Finished difference Result 977 states and 1618 transitions. [2025-03-08 05:25:47,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:47,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2025-03-08 05:25:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:47,933 INFO L225 Difference]: With dead ends: 977 [2025-03-08 05:25:47,933 INFO L226 Difference]: Without dead ends: 504 [2025-03-08 05:25:47,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:47,935 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 17 mSDsluCounter, 3227 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4036 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:47,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4036 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-08 05:25:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2025-03-08 05:25:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 391 states have (on average 1.6572890025575449) internal successors, (648), 412 states have internal predecessors, (648), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:25:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 825 transitions. [2025-03-08 05:25:47,948 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 825 transitions. Word has length 66 [2025-03-08 05:25:47,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:47,948 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 825 transitions. [2025-03-08 05:25:47,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:47,949 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 825 transitions. [2025-03-08 05:25:47,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:25:47,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:47,950 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] [2025-03-08 05:25:47,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:25:47,950 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:47,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:47,950 INFO L85 PathProgramCache]: Analyzing trace with hash 272458668, now seen corresponding path program 1 times [2025-03-08 05:25:47,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:47,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818013985] [2025-03-08 05:25:47,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:47,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:47,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:25:47,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:25:47,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:47,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:48,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:48,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818013985] [2025-03-08 05:25:48,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818013985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:48,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:48,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:48,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104194087] [2025-03-08 05:25:48,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:48,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:48,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:48,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:48,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:48,069 INFO L87 Difference]: Start difference. First operand 504 states and 825 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:48,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:48,134 INFO L93 Difference]: Finished difference Result 977 states and 1617 transitions. [2025-03-08 05:25:48,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:48,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2025-03-08 05:25:48,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:48,138 INFO L225 Difference]: With dead ends: 977 [2025-03-08 05:25:48,139 INFO L226 Difference]: Without dead ends: 504 [2025-03-08 05:25:48,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:48,142 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 16 mSDsluCounter, 3227 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4036 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:48,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4036 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:48,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-08 05:25:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2025-03-08 05:25:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 391 states have (on average 1.6547314578005115) internal successors, (647), 412 states have internal predecessors, (647), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:25:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 824 transitions. [2025-03-08 05:25:48,158 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 824 transitions. Word has length 67 [2025-03-08 05:25:48,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:48,159 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 824 transitions. [2025-03-08 05:25:48,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:25:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 824 transitions. [2025-03-08 05:25:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:25:48,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:48,160 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] [2025-03-08 05:25:48,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:25:48,161 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:48,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:48,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1788239597, now seen corresponding path program 1 times [2025-03-08 05:25:48,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:48,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150895871] [2025-03-08 05:25:48,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:48,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:48,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:25:48,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:25:48,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:48,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:48,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:48,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150895871] [2025-03-08 05:25:48,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150895871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:48,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:48,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:25:48,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044428937] [2025-03-08 05:25:48,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:48,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:25:48,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:48,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:25:48,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:25:48,329 INFO L87 Difference]: Start difference. First operand 504 states and 824 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:25:48,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:48,409 INFO L93 Difference]: Finished difference Result 971 states and 1605 transitions. [2025-03-08 05:25:48,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:25:48,409 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 68 [2025-03-08 05:25:48,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:48,413 INFO L225 Difference]: With dead ends: 971 [2025-03-08 05:25:48,413 INFO L226 Difference]: Without dead ends: 504 [2025-03-08 05:25:48,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:25:48,415 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 6 mSDsluCounter, 6442 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7250 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:48,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7250 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:48,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-08 05:25:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2025-03-08 05:25:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 391 states have (on average 1.6521739130434783) internal successors, (646), 412 states have internal predecessors, (646), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:25:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 823 transitions. [2025-03-08 05:25:48,429 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 823 transitions. Word has length 68 [2025-03-08 05:25:48,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:48,429 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 823 transitions. [2025-03-08 05:25:48,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:25:48,429 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 823 transitions. [2025-03-08 05:25:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 05:25:48,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:48,430 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] [2025-03-08 05:25:48,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:25:48,430 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:48,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:48,431 INFO L85 PathProgramCache]: Analyzing trace with hash -477459335, now seen corresponding path program 1 times [2025-03-08 05:25:48,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:48,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534279768] [2025-03-08 05:25:48,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:48,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:48,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:25:48,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:25:48,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:48,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:48,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:48,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534279768] [2025-03-08 05:25:48,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534279768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:48,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:48,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025411088] [2025-03-08 05:25:48,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:48,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:48,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:48,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:48,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:48,610 INFO L87 Difference]: Start difference. First operand 504 states and 823 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 05:25:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:50,349 INFO L93 Difference]: Finished difference Result 1565 states and 2620 transitions. [2025-03-08 05:25:50,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:50,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 69 [2025-03-08 05:25:50,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:50,358 INFO L225 Difference]: With dead ends: 1565 [2025-03-08 05:25:50,358 INFO L226 Difference]: Without dead ends: 1106 [2025-03-08 05:25:50,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:25:50,362 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 1898 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1817 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1958 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 1817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:50,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1958 Valid, 1317 Invalid, 2226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 1817 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 05:25:50,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-03-08 05:25:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 984. [2025-03-08 05:25:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 772 states have (on average 1.6761658031088082) internal successors, (1294), 802 states have internal predecessors, (1294), 174 states have call successors, (174), 36 states have call predecessors, (174), 37 states have return successors, (176), 158 states have call predecessors, (176), 169 states have call successors, (176) [2025-03-08 05:25:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1644 transitions. [2025-03-08 05:25:50,429 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1644 transitions. Word has length 69 [2025-03-08 05:25:50,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:50,429 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1644 transitions. [2025-03-08 05:25:50,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 05:25:50,430 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1644 transitions. [2025-03-08 05:25:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 05:25:50,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:50,433 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-03-08 05:25:50,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:25:50,434 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:50,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:50,436 INFO L85 PathProgramCache]: Analyzing trace with hash 928162609, now seen corresponding path program 1 times [2025-03-08 05:25:50,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:50,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119841061] [2025-03-08 05:25:50,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:50,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:50,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 05:25:50,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 05:25:50,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:50,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:50,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:50,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119841061] [2025-03-08 05:25:50,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119841061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:50,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:50,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 05:25:50,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814076450] [2025-03-08 05:25:50,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:50,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:25:50,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:50,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:25:50,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:25:50,671 INFO L87 Difference]: Start difference. First operand 984 states and 1644 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 05:25:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:54,606 INFO L93 Difference]: Finished difference Result 3564 states and 5991 transitions. [2025-03-08 05:25:54,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 05:25:54,607 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 97 [2025-03-08 05:25:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:54,621 INFO L225 Difference]: With dead ends: 3564 [2025-03-08 05:25:54,621 INFO L226 Difference]: Without dead ends: 2625 [2025-03-08 05:25:54,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:25:54,627 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 2139 mSDsluCounter, 4055 mSDsCounter, 0 mSdLazyCounter, 9190 mSolverCounterSat, 578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 4808 SdHoareTripleChecker+Invalid, 9768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 9190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:54,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 4808 Invalid, 9768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [578 Valid, 9190 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-08 05:25:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2025-03-08 05:25:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2533. [2025-03-08 05:25:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2533 states, 1925 states have (on average 1.6467532467532469) internal successors, (3170), 2001 states have internal predecessors, (3170), 513 states have call successors, (513), 77 states have call predecessors, (513), 94 states have return successors, (546), 487 states have call predecessors, (546), 508 states have call successors, (546) [2025-03-08 05:25:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 4229 transitions. [2025-03-08 05:25:54,728 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 4229 transitions. Word has length 97 [2025-03-08 05:25:54,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:54,728 INFO L471 AbstractCegarLoop]: Abstraction has 2533 states and 4229 transitions. [2025-03-08 05:25:54,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 05:25:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 4229 transitions. [2025-03-08 05:25:54,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 05:25:54,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:54,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:54,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:25:54,731 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:54,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:54,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1322095758, now seen corresponding path program 1 times [2025-03-08 05:25:54,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:54,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375839168] [2025-03-08 05:25:54,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:54,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:54,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:25:54,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:25:54,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:54,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:54,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:54,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375839168] [2025-03-08 05:25:54,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375839168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:54,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:25:54,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366919036] [2025-03-08 05:25:54,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:54,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:25:54,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:54,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:25:54,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:25:54,977 INFO L87 Difference]: Start difference. First operand 2533 states and 4229 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:25:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:56,078 INFO L93 Difference]: Finished difference Result 5049 states and 8578 transitions. [2025-03-08 05:25:56,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:25:56,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 98 [2025-03-08 05:25:56,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:56,091 INFO L225 Difference]: With dead ends: 5049 [2025-03-08 05:25:56,091 INFO L226 Difference]: Without dead ends: 2561 [2025-03-08 05:25:56,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 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-03-08 05:25:56,101 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1254 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 2511 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 2883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 2511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:56,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 1622 Invalid, 2883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 2511 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 05:25:56,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2025-03-08 05:25:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2557. [2025-03-08 05:25:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 1943 states have (on average 1.6407617086978898) internal successors, (3188), 2019 states have internal predecessors, (3188), 513 states have call successors, (513), 77 states have call predecessors, (513), 100 states have return successors, (612), 493 states have call predecessors, (612), 508 states have call successors, (612) [2025-03-08 05:25:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4313 transitions. [2025-03-08 05:25:56,233 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4313 transitions. Word has length 98 [2025-03-08 05:25:56,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:56,234 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 4313 transitions. [2025-03-08 05:25:56,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:25:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4313 transitions. [2025-03-08 05:25:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 05:25:56,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:56,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:56,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:25:56,237 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:56,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:56,237 INFO L85 PathProgramCache]: Analyzing trace with hash 277677477, now seen corresponding path program 1 times [2025-03-08 05:25:56,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:56,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38249138] [2025-03-08 05:25:56,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:56,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:56,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:25:56,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:25:56,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:56,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:56,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:56,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38249138] [2025-03-08 05:25:56,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38249138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:56,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:56,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:56,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156140561] [2025-03-08 05:25:56,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:56,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:56,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:56,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:56,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:56,384 INFO L87 Difference]: Start difference. First operand 2557 states and 4313 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 05:25:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:58,472 INFO L93 Difference]: Finished difference Result 8177 states and 14068 transitions. [2025-03-08 05:25:58,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:25:58,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 99 [2025-03-08 05:25:58,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:58,502 INFO L225 Difference]: With dead ends: 8177 [2025-03-08 05:25:58,502 INFO L226 Difference]: Without dead ends: 5665 [2025-03-08 05:25:58,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:25:58,515 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 2620 mSDsluCounter, 1928 mSDsCounter, 0 mSdLazyCounter, 4155 mSolverCounterSat, 689 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2689 SdHoareTripleChecker+Valid, 2543 SdHoareTripleChecker+Invalid, 4844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 689 IncrementalHoareTripleChecker+Valid, 4155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:58,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2689 Valid, 2543 Invalid, 4844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [689 Valid, 4155 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 05:25:58,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5665 states. [2025-03-08 05:25:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5665 to 5434. [2025-03-08 05:25:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5434 states, 4123 states have (on average 1.6289109871452825) internal successors, (6716), 4304 states have internal predecessors, (6716), 1088 states have call successors, (1088), 190 states have call predecessors, (1088), 222 states have return successors, (1237), 1016 states have call predecessors, (1237), 1083 states have call successors, (1237) [2025-03-08 05:25:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5434 states to 5434 states and 9041 transitions. [2025-03-08 05:25:58,803 INFO L78 Accepts]: Start accepts. Automaton has 5434 states and 9041 transitions. Word has length 99 [2025-03-08 05:25:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:58,803 INFO L471 AbstractCegarLoop]: Abstraction has 5434 states and 9041 transitions. [2025-03-08 05:25:58,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 05:25:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 5434 states and 9041 transitions. [2025-03-08 05:25:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:25:58,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:58,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:58,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:25:58,806 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:58,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:58,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1329997374, now seen corresponding path program 1 times [2025-03-08 05:25:58,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:58,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728684685] [2025-03-08 05:25:58,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:58,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:58,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:25:58,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:25:58,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:58,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:58,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:58,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728684685] [2025-03-08 05:25:58,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728684685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:58,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:58,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:58,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416312784] [2025-03-08 05:25:58,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:58,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:58,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:58,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:58,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:58,957 INFO L87 Difference]: Start difference. First operand 5434 states and 9041 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 05:26:01,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:01,666 INFO L93 Difference]: Finished difference Result 18863 states and 31918 transitions. [2025-03-08 05:26:01,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:26:01,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 101 [2025-03-08 05:26:01,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:01,732 INFO L225 Difference]: With dead ends: 18863 [2025-03-08 05:26:01,732 INFO L226 Difference]: Without dead ends: 13468 [2025-03-08 05:26:01,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:26:01,755 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 2780 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 5153 mSolverCounterSat, 653 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2887 SdHoareTripleChecker+Valid, 2404 SdHoareTripleChecker+Invalid, 5806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 653 IncrementalHoareTripleChecker+Valid, 5153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:01,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2887 Valid, 2404 Invalid, 5806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [653 Valid, 5153 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 05:26:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13468 states. [2025-03-08 05:26:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13468 to 11428. [2025-03-08 05:26:02,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11428 states, 8364 states have (on average 1.6180057388809181) internal successors, (13533), 8846 states have internal predecessors, (13533), 2618 states have call successors, (2618), 362 states have call predecessors, (2618), 445 states have return successors, (3154), 2529 states have call predecessors, (3154), 2613 states have call successors, (3154) [2025-03-08 05:26:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11428 states to 11428 states and 19305 transitions. [2025-03-08 05:26:02,379 INFO L78 Accepts]: Start accepts. Automaton has 11428 states and 19305 transitions. Word has length 101 [2025-03-08 05:26:02,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:02,379 INFO L471 AbstractCegarLoop]: Abstraction has 11428 states and 19305 transitions. [2025-03-08 05:26:02,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 05:26:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 11428 states and 19305 transitions. [2025-03-08 05:26:02,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:26:02,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:02,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:02,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:26:02,382 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:02,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:02,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1593162624, now seen corresponding path program 1 times [2025-03-08 05:26:02,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:02,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006694931] [2025-03-08 05:26:02,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:02,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:02,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:26:02,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:26:02,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:02,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:02,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:02,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006694931] [2025-03-08 05:26:02,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006694931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:02,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:02,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:26:02,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574367025] [2025-03-08 05:26:02,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:02,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:26:02,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:02,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:26:02,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:02,559 INFO L87 Difference]: Start difference. First operand 11428 states and 19305 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 05:26:05,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:05,161 INFO L93 Difference]: Finished difference Result 34268 states and 58760 transitions. [2025-03-08 05:26:05,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:26:05,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 101 [2025-03-08 05:26:05,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:05,320 INFO L225 Difference]: With dead ends: 34268 [2025-03-08 05:26:05,321 INFO L226 Difference]: Without dead ends: 24363 [2025-03-08 05:26:05,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 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-03-08 05:26:05,386 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 2309 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 3491 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2389 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 3993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 3491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:05,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2389 Valid, 1745 Invalid, 3993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 3491 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 05:26:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24363 states. [2025-03-08 05:26:06,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24363 to 23363. [2025-03-08 05:26:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23363 states, 17137 states have (on average 1.6179027834510125) internal successors, (27726), 18162 states have internal predecessors, (27726), 5199 states have call successors, (5199), 716 states have call predecessors, (5199), 1026 states have return successors, (6834), 5059 states have call predecessors, (6834), 5194 states have call successors, (6834) [2025-03-08 05:26:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23363 states to 23363 states and 39759 transitions. [2025-03-08 05:26:06,891 INFO L78 Accepts]: Start accepts. Automaton has 23363 states and 39759 transitions. Word has length 101 [2025-03-08 05:26:06,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:06,891 INFO L471 AbstractCegarLoop]: Abstraction has 23363 states and 39759 transitions. [2025-03-08 05:26:06,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 05:26:06,892 INFO L276 IsEmpty]: Start isEmpty. Operand 23363 states and 39759 transitions. [2025-03-08 05:26:06,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 05:26:06,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:06,894 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, 1, 1] [2025-03-08 05:26:06,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:26:06,895 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:06,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:06,896 INFO L85 PathProgramCache]: Analyzing trace with hash -410191331, now seen corresponding path program 1 times [2025-03-08 05:26:06,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:06,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211927856] [2025-03-08 05:26:06,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:06,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:06,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 05:26:06,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:26:06,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:06,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:07,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:07,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211927856] [2025-03-08 05:26:07,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211927856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:07,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:07,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:26:07,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157703703] [2025-03-08 05:26:07,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:07,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:26:07,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:07,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:26:07,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:26:07,010 INFO L87 Difference]: Start difference. First operand 23363 states and 39759 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:26:08,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:08,177 INFO L93 Difference]: Finished difference Result 45299 states and 77443 transitions. [2025-03-08 05:26:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:08,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2025-03-08 05:26:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:08,294 INFO L225 Difference]: With dead ends: 45299 [2025-03-08 05:26:08,295 INFO L226 Difference]: Without dead ends: 23679 [2025-03-08 05:26:08,359 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-03-08 05:26:08,360 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 0 mSDsluCounter, 2433 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3254 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-03-08 05:26:08,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3254 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:08,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23679 states. [2025-03-08 05:26:09,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23679 to 23619. [2025-03-08 05:26:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23619 states, 17335 states have (on average 1.610152869916354) internal successors, (27912), 18354 states have internal predecessors, (27912), 5187 states have call successors, (5187), 716 states have call predecessors, (5187), 1096 states have return successors, (7055), 5123 states have call predecessors, (7055), 5182 states have call successors, (7055) [2025-03-08 05:26:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23619 states to 23619 states and 40154 transitions. [2025-03-08 05:26:09,498 INFO L78 Accepts]: Start accepts. Automaton has 23619 states and 40154 transitions. Word has length 106 [2025-03-08 05:26:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:09,498 INFO L471 AbstractCegarLoop]: Abstraction has 23619 states and 40154 transitions. [2025-03-08 05:26:09,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:26:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 23619 states and 40154 transitions. [2025-03-08 05:26:09,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:26:09,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:09,501 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:09,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:26:09,502 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:09,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:09,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1519608441, now seen corresponding path program 1 times [2025-03-08 05:26:09,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:09,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674284846] [2025-03-08 05:26:09,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:09,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:09,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:26:09,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:26:09,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:09,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:09,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:09,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674284846] [2025-03-08 05:26:09,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674284846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:09,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:09,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:09,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893794103] [2025-03-08 05:26:09,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:09,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:09,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:09,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:09,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:09,612 INFO L87 Difference]: Start difference. First operand 23619 states and 40154 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:26:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:11,279 INFO L93 Difference]: Finished difference Result 49487 states and 86089 transitions. [2025-03-08 05:26:11,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:26:11,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 113 [2025-03-08 05:26:11,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:11,465 INFO L225 Difference]: With dead ends: 49487 [2025-03-08 05:26:11,466 INFO L226 Difference]: Without dead ends: 24175 [2025-03-08 05:26:11,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:11,617 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 225 mSDsluCounter, 3199 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 4062 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:11,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 4062 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:26:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24175 states. [2025-03-08 05:26:12,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24175 to 23691. [2025-03-08 05:26:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23691 states, 17398 states have (on average 1.5811587538797562) internal successors, (27509), 18426 states have internal predecessors, (27509), 5187 states have call successors, (5187), 716 states have call predecessors, (5187), 1105 states have return successors, (7091), 5123 states have call predecessors, (7091), 5182 states have call successors, (7091) [2025-03-08 05:26:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23691 states to 23691 states and 39787 transitions. [2025-03-08 05:26:13,061 INFO L78 Accepts]: Start accepts. Automaton has 23691 states and 39787 transitions. Word has length 113 [2025-03-08 05:26:13,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:13,062 INFO L471 AbstractCegarLoop]: Abstraction has 23691 states and 39787 transitions. [2025-03-08 05:26:13,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:26:13,062 INFO L276 IsEmpty]: Start isEmpty. Operand 23691 states and 39787 transitions. [2025-03-08 05:26:13,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:26:13,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:13,065 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:13,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:26:13,065 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:13,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:13,065 INFO L85 PathProgramCache]: Analyzing trace with hash -107885613, now seen corresponding path program 1 times [2025-03-08 05:26:13,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:13,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182396954] [2025-03-08 05:26:13,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:13,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:13,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:26:13,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:26:13,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:13,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:26:13,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:13,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182396954] [2025-03-08 05:26:13,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182396954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:13,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:13,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:26:13,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401846502] [2025-03-08 05:26:13,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:13,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:26:13,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:13,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:26:13,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:13,209 INFO L87 Difference]: Start difference. First operand 23691 states and 39787 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:26:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:16,003 INFO L93 Difference]: Finished difference Result 48292 states and 81455 transitions. [2025-03-08 05:26:16,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:26:16,003 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 118 [2025-03-08 05:26:16,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:16,196 INFO L225 Difference]: With dead ends: 48292 [2025-03-08 05:26:16,196 INFO L226 Difference]: Without dead ends: 26365 [2025-03-08 05:26:16,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:26:16,315 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 2027 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 3007 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2103 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 3482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 3007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:16,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2103 Valid, 1695 Invalid, 3482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 3007 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 05:26:16,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26365 states. [2025-03-08 05:26:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26365 to 24859. [2025-03-08 05:26:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24859 states, 18271 states have (on average 1.5684965245470965) internal successors, (28658), 19373 states have internal predecessors, (28658), 5302 states have call successors, (5302), 821 states have call predecessors, (5302), 1285 states have return successors, (7509), 5239 states have call predecessors, (7509), 5297 states have call successors, (7509) [2025-03-08 05:26:17,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24859 states to 24859 states and 41469 transitions. [2025-03-08 05:26:17,835 INFO L78 Accepts]: Start accepts. Automaton has 24859 states and 41469 transitions. Word has length 118 [2025-03-08 05:26:17,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:17,836 INFO L471 AbstractCegarLoop]: Abstraction has 24859 states and 41469 transitions. [2025-03-08 05:26:17,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:26:17,836 INFO L276 IsEmpty]: Start isEmpty. Operand 24859 states and 41469 transitions. [2025-03-08 05:26:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 05:26:17,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:17,840 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, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:17,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:26:17,841 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:17,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:17,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1535191885, now seen corresponding path program 1 times [2025-03-08 05:26:17,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:17,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440262484] [2025-03-08 05:26:17,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:17,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:17,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:26:17,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:26:17,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:17,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:26:17,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:17,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440262484] [2025-03-08 05:26:17,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440262484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:17,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:17,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:26:17,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180344812] [2025-03-08 05:26:17,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:17,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:26:17,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:17,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:26:17,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:26:17,964 INFO L87 Difference]: Start difference. First operand 24859 states and 41469 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:26:20,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:20,311 INFO L93 Difference]: Finished difference Result 59624 states and 100355 transitions. [2025-03-08 05:26:20,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:20,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 123 [2025-03-08 05:26:20,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:20,531 INFO L225 Difference]: With dead ends: 59624 [2025-03-08 05:26:20,531 INFO L226 Difference]: Without dead ends: 36529 [2025-03-08 05:26:20,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-03-08 05:26:20,647 INFO L435 NwaCegarLoop]: 1328 mSDtfsCounter, 755 mSDsluCounter, 3445 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 4773 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:20,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 4773 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:20,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36529 states. [2025-03-08 05:26:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36529 to 33886. [2025-03-08 05:26:22,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33886 states, 24862 states have (on average 1.5761000723996461) internal successors, (39185), 26306 states have internal predecessors, (39185), 7394 states have call successors, (7394), 1047 states have call predecessors, (7394), 1629 states have return successors, (10370), 7372 states have call predecessors, (10370), 7389 states have call successors, (10370) [2025-03-08 05:26:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33886 states to 33886 states and 56949 transitions. [2025-03-08 05:26:22,547 INFO L78 Accepts]: Start accepts. Automaton has 33886 states and 56949 transitions. Word has length 123 [2025-03-08 05:26:22,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:22,547 INFO L471 AbstractCegarLoop]: Abstraction has 33886 states and 56949 transitions. [2025-03-08 05:26:22,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:26:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 33886 states and 56949 transitions. [2025-03-08 05:26:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 05:26:22,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:22,550 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, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:22,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:26:22,550 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:22,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:22,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1602198638, now seen corresponding path program 1 times [2025-03-08 05:26:22,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:22,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356815579] [2025-03-08 05:26:22,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:22,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:22,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:26:22,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:26:22,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:22,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:26:22,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:22,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356815579] [2025-03-08 05:26:22,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356815579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:22,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:22,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:22,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965625872] [2025-03-08 05:26:22,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:22,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:22,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:22,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:22,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:22,682 INFO L87 Difference]: Start difference. First operand 33886 states and 56949 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:26:23,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:23,960 INFO L93 Difference]: Finished difference Result 34051 states and 57250 transitions. [2025-03-08 05:26:23,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:23,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-03-08 05:26:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:24,211 INFO L225 Difference]: With dead ends: 34051 [2025-03-08 05:26:24,211 INFO L226 Difference]: Without dead ends: 34036 [2025-03-08 05:26:24,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:26:24,254 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 881 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:24,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 2275 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:26:24,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34036 states. [2025-03-08 05:26:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34036 to 33896. [2025-03-08 05:26:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33896 states, 24872 states have (on average 1.5758684464458026) internal successors, (39195), 26316 states have internal predecessors, (39195), 7394 states have call successors, (7394), 1047 states have call predecessors, (7394), 1629 states have return successors, (10370), 7372 states have call predecessors, (10370), 7389 states have call successors, (10370) [2025-03-08 05:26:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33896 states to 33896 states and 56959 transitions. [2025-03-08 05:26:26,327 INFO L78 Accepts]: Start accepts. Automaton has 33896 states and 56959 transitions. Word has length 123 [2025-03-08 05:26:26,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:26,328 INFO L471 AbstractCegarLoop]: Abstraction has 33896 states and 56959 transitions. [2025-03-08 05:26:26,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:26:26,328 INFO L276 IsEmpty]: Start isEmpty. Operand 33896 states and 56959 transitions. [2025-03-08 05:26:26,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 05:26:26,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:26,331 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:26,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 05:26:26,331 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:26,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:26,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1383680208, now seen corresponding path program 1 times [2025-03-08 05:26:26,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:26,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275310287] [2025-03-08 05:26:26,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:26,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:26,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 05:26:26,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 05:26:26,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:26,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:26:26,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:26,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275310287] [2025-03-08 05:26:26,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275310287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:26,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:26,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:26:26,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974036699] [2025-03-08 05:26:26,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:26,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:26:26,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:26,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:26:26,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:26:26,545 INFO L87 Difference]: Start difference. First operand 33896 states and 56959 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:26:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:28,917 INFO L93 Difference]: Finished difference Result 34732 states and 58317 transitions. [2025-03-08 05:26:28,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:26:28,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2025-03-08 05:26:28,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:29,152 INFO L225 Difference]: With dead ends: 34732 [2025-03-08 05:26:29,152 INFO L226 Difference]: Without dead ends: 34669 [2025-03-08 05:26:29,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:26:29,191 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 794 mSDsluCounter, 3989 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 4797 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:29,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 4797 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:26:29,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34669 states. [2025-03-08 05:26:30,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34669 to 34600. [2025-03-08 05:26:30,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34600 states, 25407 states have (on average 1.5712992482386743) internal successors, (39922), 26851 states have internal predecessors, (39922), 7498 states have call successors, (7498), 1114 states have call predecessors, (7498), 1694 states have return successors, (10679), 7470 states have call predecessors, (10679), 7493 states have call successors, (10679) [2025-03-08 05:26:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34600 states to 34600 states and 58099 transitions. [2025-03-08 05:26:31,051 INFO L78 Accepts]: Start accepts. Automaton has 34600 states and 58099 transitions. Word has length 129 [2025-03-08 05:26:31,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:31,052 INFO L471 AbstractCegarLoop]: Abstraction has 34600 states and 58099 transitions. [2025-03-08 05:26:31,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:26:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 34600 states and 58099 transitions. [2025-03-08 05:26:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:26:31,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:31,055 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:31,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 05:26:31,055 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:31,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:31,055 INFO L85 PathProgramCache]: Analyzing trace with hash 925600456, now seen corresponding path program 1 times [2025-03-08 05:26:31,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:31,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636078835] [2025-03-08 05:26:31,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:31,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:31,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:26:31,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:26:31,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:31,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 05:26:31,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:31,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636078835] [2025-03-08 05:26:31,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636078835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:31,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:31,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:26:31,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679803900] [2025-03-08 05:26:31,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:31,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:26:31,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:31,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:26:31,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:26:31,253 INFO L87 Difference]: Start difference. First operand 34600 states and 58099 transitions. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:26:33,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:33,738 INFO L93 Difference]: Finished difference Result 69322 states and 116799 transitions. [2025-03-08 05:26:33,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:26:33,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) Word has length 139 [2025-03-08 05:26:33,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:33,988 INFO L225 Difference]: With dead ends: 69322 [2025-03-08 05:26:33,988 INFO L226 Difference]: Without dead ends: 34782 [2025-03-08 05:26:34,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 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-03-08 05:26:34,132 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 1203 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 2518 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 2853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 2518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:34,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 1618 Invalid, 2853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 2518 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 05:26:34,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34782 states. [2025-03-08 05:26:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34782 to 34600. [2025-03-08 05:26:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34600 states, 25407 states have (on average 1.5695674420435313) internal successors, (39878), 26851 states have internal predecessors, (39878), 7498 states have call successors, (7498), 1114 states have call predecessors, (7498), 1694 states have return successors, (10679), 7470 states have call predecessors, (10679), 7493 states have call successors, (10679) [2025-03-08 05:26:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34600 states to 34600 states and 58055 transitions. [2025-03-08 05:26:36,141 INFO L78 Accepts]: Start accepts. Automaton has 34600 states and 58055 transitions. Word has length 139 [2025-03-08 05:26:36,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:36,141 INFO L471 AbstractCegarLoop]: Abstraction has 34600 states and 58055 transitions. [2025-03-08 05:26:36,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:26:36,141 INFO L276 IsEmpty]: Start isEmpty. Operand 34600 states and 58055 transitions. [2025-03-08 05:26:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 05:26:36,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:36,144 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:36,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 05:26:36,144 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:36,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:36,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2018552177, now seen corresponding path program 1 times [2025-03-08 05:26:36,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:36,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370994380] [2025-03-08 05:26:36,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:36,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:36,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 05:26:36,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 05:26:36,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:36,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:26:36,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:36,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370994380] [2025-03-08 05:26:36,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370994380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:36,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:36,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:36,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537798452] [2025-03-08 05:26:36,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:36,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:36,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:36,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:36,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:36,249 INFO L87 Difference]: Start difference. First operand 34600 states and 58055 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:26:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:40,686 INFO L93 Difference]: Finished difference Result 106190 states and 185770 transitions. [2025-03-08 05:26:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:40,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 148 [2025-03-08 05:26:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:41,238 INFO L225 Difference]: With dead ends: 106190 [2025-03-08 05:26:41,238 INFO L226 Difference]: Without dead ends: 71635 [2025-03-08 05:26:41,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:26:41,435 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 1797 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1869 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:41,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1869 Valid, 942 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 05:26:41,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71635 states.