./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_product26.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 c39b0b488ad07619ca8d4ed9273747459006984c072c0894ad54004ae965569d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:35:08,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:35:08,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:35:08,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:35:08,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:35:08,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:35:08,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:35:08,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:35:08,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:35:08,908 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:35:08,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:35:08,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:35:08,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:35:08,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:35:08,908 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:35:08,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:35:08,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:35:08,909 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:35:08,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:35:08,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:35:08,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:35:08,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:35:08,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:35:08,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:35:08,909 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:35:08,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:35:08,910 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:35:08,910 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:35:08,910 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:35:08,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:35:08,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:35:08,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:35:08,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:35:08,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:35:08,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:35:08,910 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:35:08,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:35:08,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:35:08,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:35:08,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:35:08,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:35:08,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:35:08,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:35:08,911 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 -> c39b0b488ad07619ca8d4ed9273747459006984c072c0894ad54004ae965569d [2025-03-16 18:35:09,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:35:09,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:35:09,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:35:09,181 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:35:09,181 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:35:09,182 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c [2025-03-16 18:35:10,351 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/112e7a311/9e1282b0fdf44310a4b62fa10c167964/FLAG676762dab [2025-03-16 18:35:10,691 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:35:10,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c [2025-03-16 18:35:10,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/112e7a311/9e1282b0fdf44310a4b62fa10c167964/FLAG676762dab [2025-03-16 18:35:10,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/112e7a311/9e1282b0fdf44310a4b62fa10c167964 [2025-03-16 18:35:10,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:35:10,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:35:10,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:35:10,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:35:10,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:35:10,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:35:10" (1/1) ... [2025-03-16 18:35:10,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14414b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:10, skipping insertion in model container [2025-03-16 18:35:10,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:35:10" (1/1) ... [2025-03-16 18:35:10,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:35:11,195 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_product26.cil.c[70298,70311] [2025-03-16 18:35:11,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:35:11,216 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:35:11,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-03-16 18:35:11,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [412] [2025-03-16 18:35:11,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1940] [2025-03-16 18:35:11,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2058] [2025-03-16 18:35:11,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2070] [2025-03-16 18:35:11,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2436] [2025-03-16 18:35:11,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2471] [2025-03-16 18:35:11,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [3132] [2025-03-16 18:35:11,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3314] [2025-03-16 18:35:11,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3323] [2025-03-16 18:35:11,332 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_product26.cil.c[70298,70311] [2025-03-16 18:35:11,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:35:11,361 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:35:11,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:11 WrapperNode [2025-03-16 18:35:11,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:35:11,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:35:11,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:35:11,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:35:11,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:11" (1/1) ... [2025-03-16 18:35:11,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:11" (1/1) ... [2025-03-16 18:35:11,432 INFO L138 Inliner]: procedures = 93, calls = 340, calls flagged for inlining = 28, calls inlined = 24, statements flattened = 857 [2025-03-16 18:35:11,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:35:11,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:35:11,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:35:11,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:35:11,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:11" (1/1) ... [2025-03-16 18:35:11,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:11" (1/1) ... [2025-03-16 18:35:11,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:11" (1/1) ... [2025-03-16 18:35:11,467 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-16 18:35:11,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:11" (1/1) ... [2025-03-16 18:35:11,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:11" (1/1) ... [2025-03-16 18:35:11,483 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:11" (1/1) ... [2025-03-16 18:35:11,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:11" (1/1) ... [2025-03-16 18:35:11,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:11" (1/1) ... [2025-03-16 18:35:11,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:11" (1/1) ... [2025-03-16 18:35:11,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:35:11,494 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:35:11,494 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:35:11,494 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:35:11,495 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:11" (1/1) ... [2025-03-16 18:35:11,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:35:11,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:35:11,529 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-16 18:35:11,532 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-16 18:35:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:35:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-16 18:35:11,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-16 18:35:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-16 18:35:11,550 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-16 18:35:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-16 18:35:11,551 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-16 18:35:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-16 18:35:11,551 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-16 18:35:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-16 18:35:11,551 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-16 18:35:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-16 18:35:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-16 18:35:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-16 18:35:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-16 18:35:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-16 18:35:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-16 18:35:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-16 18:35:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-16 18:35:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-16 18:35:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-16 18:35:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-16 18:35:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-16 18:35:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-16 18:35:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-16 18:35:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-16 18:35:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-16 18:35:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-16 18:35:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-16 18:35:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2025-03-16 18:35:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2025-03-16 18:35:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-16 18:35:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-16 18:35:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-16 18:35:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-16 18:35:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-16 18:35:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-16 18:35:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:35:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 18:35:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-16 18:35:11,553 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-16 18:35:11,553 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-16 18:35:11,553 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:35:11,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:35:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-16 18:35:11,553 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-16 18:35:11,683 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:35:11,685 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:35:11,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2055: #res := ~retValue_acc~17; [2025-03-16 18:35:11,752 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1977: #res := ~retValue_acc~15; [2025-03-16 18:35:11,755 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L498: #res := ~retValue_acc~2; [2025-03-16 18:35:12,055 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1213: #res := ~retValue_acc~10; [2025-03-16 18:35:12,178 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1303-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~12#1; [2025-03-16 18:35:12,178 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~5#1; [2025-03-16 18:35:12,236 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1317: #res := ~retValue_acc~13; [2025-03-16 18:35:12,251 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2016: #res := ~retValue_acc~16; [2025-03-16 18:35:12,310 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L768-1: isEmpty_#res#1 := isEmpty_~retValue_acc~7#1; [2025-03-16 18:35:12,346 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L861-1: isIdle_#res#1 := isIdle_~retValue_acc~9#1; [2025-03-16 18:35:12,346 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L848-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~8#1; [2025-03-16 18:35:12,381 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L676-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~3#1; [2025-03-16 18:35:12,422 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2818: #res := ~retValue_acc~24; [2025-03-16 18:35:12,484 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L409-1: main_#res#1 := main_~retValue_acc~1#1; [2025-03-16 18:35:12,484 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2468-1: valid_product_#res#1 := valid_product_~retValue_acc~22#1; [2025-03-16 18:35:12,491 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2582: #res := ~retValue_acc~23; [2025-03-16 18:35:12,493 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L685: #res := ~retValue_acc~4; [2025-03-16 18:35:12,497 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3129: #res := ~retValue_acc~25; [2025-03-16 18:35:12,630 INFO L? ?]: Removed 440 outVars from TransFormulas that were not future-live. [2025-03-16 18:35:12,631 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:35:12,652 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:35:12,652 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:35:12,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:35:12 BoogieIcfgContainer [2025-03-16 18:35:12,652 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:35:12,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:35:12,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:35:12,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:35:12,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:35:10" (1/3) ... [2025-03-16 18:35:12,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797f37c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:35:12, skipping insertion in model container [2025-03-16 18:35:12,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:11" (2/3) ... [2025-03-16 18:35:12,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797f37c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:35:12, skipping insertion in model container [2025-03-16 18:35:12,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:35:12" (3/3) ... [2025-03-16 18:35:12,664 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product26.cil.c [2025-03-16 18:35:12,673 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:35:12,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product26.cil.c that has 23 procedures, 541 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 18:35:12,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:35:12,736 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;@248aa50c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:35:12,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:35:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 541 states, 426 states have (on average 1.7206572769953052) internal successors, (733), 449 states have internal predecessors, (733), 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-16 18:35:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 18:35:12,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:12,752 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] [2025-03-16 18:35:12,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:12,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:12,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1364338002, now seen corresponding path program 1 times [2025-03-16 18:35:12,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:12,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971631402] [2025-03-16 18:35:12,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:12,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:12,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 18:35:12,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 18:35:12,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:12,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:13,200 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-16 18:35:13,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:13,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971631402] [2025-03-16 18:35:13,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971631402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:13,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:13,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:13,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419492913] [2025-03-16 18:35:13,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:13,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:13,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:13,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:13,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:13,224 INFO L87 Difference]: Start difference. First operand has 541 states, 426 states have (on average 1.7206572769953052) internal successors, (733), 449 states have internal predecessors, (733), 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 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-16 18:35:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:13,336 INFO L93 Difference]: Finished difference Result 1067 states and 1810 transitions. [2025-03-16 18:35:13,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:13,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 51 [2025-03-16 18:35:13,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:13,355 INFO L225 Difference]: With dead ends: 1067 [2025-03-16 18:35:13,355 INFO L226 Difference]: Without dead ends: 534 [2025-03-16 18:35:13,363 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-16 18:35:13,365 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 5 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2681 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-16 18:35:13,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2681 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-16 18:35:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-03-16 18:35:13,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 421 states have (on average 1.7173396674584323) internal successors, (723), 442 states have internal predecessors, (723), 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-16 18:35:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 900 transitions. [2025-03-16 18:35:13,430 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 900 transitions. Word has length 51 [2025-03-16 18:35:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:13,431 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 900 transitions. [2025-03-16 18:35:13,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-16 18:35:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 900 transitions. [2025-03-16 18:35:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 18:35:13,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:13,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:13,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:35:13,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:13,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:13,437 INFO L85 PathProgramCache]: Analyzing trace with hash 906295875, now seen corresponding path program 1 times [2025-03-16 18:35:13,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:13,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935586074] [2025-03-16 18:35:13,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:13,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:13,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 18:35:13,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 18:35:13,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:13,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:13,586 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-16 18:35:13,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:13,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935586074] [2025-03-16 18:35:13,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935586074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:13,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:13,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:13,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172789029] [2025-03-16 18:35:13,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:13,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:13,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:13,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:13,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:13,589 INFO L87 Difference]: Start difference. First operand 534 states and 900 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-16 18:35:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:13,666 INFO L93 Difference]: Finished difference Result 1055 states and 1782 transitions. [2025-03-16 18:35:13,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:13,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 53 [2025-03-16 18:35:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:13,670 INFO L225 Difference]: With dead ends: 1055 [2025-03-16 18:35:13,670 INFO L226 Difference]: Without dead ends: 534 [2025-03-16 18:35:13,672 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-16 18:35:13,672 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 4 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2663 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-16 18:35:13,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2663 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-16 18:35:13,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-03-16 18:35:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 421 states have (on average 1.7149643705463182) internal successors, (722), 442 states have internal predecessors, (722), 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-16 18:35:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 899 transitions. [2025-03-16 18:35:13,699 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 899 transitions. Word has length 53 [2025-03-16 18:35:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:13,699 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 899 transitions. [2025-03-16 18:35:13,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-16 18:35:13,700 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 899 transitions. [2025-03-16 18:35:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 18:35:13,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:13,703 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] [2025-03-16 18:35:13,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:35:13,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:13,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:13,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1955017889, now seen corresponding path program 1 times [2025-03-16 18:35:13,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:13,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631061806] [2025-03-16 18:35:13,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:13,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:13,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 18:35:13,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 18:35:13,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:13,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:13,836 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-16 18:35:13,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:13,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631061806] [2025-03-16 18:35:13,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631061806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:13,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:13,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:13,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680194552] [2025-03-16 18:35:13,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:13,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:13,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:13,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:13,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:13,839 INFO L87 Difference]: Start difference. First operand 534 states and 899 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-16 18:35:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:13,885 INFO L93 Difference]: Finished difference Result 1055 states and 1781 transitions. [2025-03-16 18:35:13,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:13,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 54 [2025-03-16 18:35:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:13,891 INFO L225 Difference]: With dead ends: 1055 [2025-03-16 18:35:13,891 INFO L226 Difference]: Without dead ends: 534 [2025-03-16 18:35:13,893 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-16 18:35:13,895 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 3 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2663 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-16 18:35:13,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2663 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-16 18:35:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-03-16 18:35:13,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 421 states have (on average 1.7125890736342042) internal successors, (721), 442 states have internal predecessors, (721), 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-16 18:35:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 898 transitions. [2025-03-16 18:35:13,922 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 898 transitions. Word has length 54 [2025-03-16 18:35:13,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:13,923 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 898 transitions. [2025-03-16 18:35:13,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-16 18:35:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 898 transitions. [2025-03-16 18:35:13,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 18:35:13,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:13,925 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] [2025-03-16 18:35:13,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 18:35:13,926 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:13,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:13,926 INFO L85 PathProgramCache]: Analyzing trace with hash 771616070, now seen corresponding path program 1 times [2025-03-16 18:35:13,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:13,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040487748] [2025-03-16 18:35:13,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:13,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:13,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 18:35:13,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 18:35:13,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:13,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:14,068 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-16 18:35:14,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:14,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040487748] [2025-03-16 18:35:14,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040487748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:14,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:14,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:14,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018977248] [2025-03-16 18:35:14,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:14,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:14,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:14,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:14,069 INFO L87 Difference]: Start difference. First operand 534 states and 898 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-16 18:35:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:14,111 INFO L93 Difference]: Finished difference Result 1055 states and 1780 transitions. [2025-03-16 18:35:14,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:14,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 55 [2025-03-16 18:35:14,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:14,115 INFO L225 Difference]: With dead ends: 1055 [2025-03-16 18:35:14,115 INFO L226 Difference]: Without dead ends: 534 [2025-03-16 18:35:14,118 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-16 18:35:14,119 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 2 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2663 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-16 18:35:14,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2663 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:14,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-16 18:35:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-03-16 18:35:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 421 states have (on average 1.7102137767220902) internal successors, (720), 442 states have internal predecessors, (720), 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-16 18:35:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 897 transitions. [2025-03-16 18:35:14,142 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 897 transitions. Word has length 55 [2025-03-16 18:35:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:14,143 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 897 transitions. [2025-03-16 18:35:14,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-16 18:35:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 897 transitions. [2025-03-16 18:35:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 18:35:14,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:14,144 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-16 18:35:14,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 18:35:14,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:14,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:14,145 INFO L85 PathProgramCache]: Analyzing trace with hash -888147836, now seen corresponding path program 1 times [2025-03-16 18:35:14,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:14,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866477787] [2025-03-16 18:35:14,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:14,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:14,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 18:35:14,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 18:35:14,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:14,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:14,263 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-16 18:35:14,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:14,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866477787] [2025-03-16 18:35:14,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866477787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:14,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:14,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:14,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578421481] [2025-03-16 18:35:14,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:14,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:14,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:14,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:14,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:14,266 INFO L87 Difference]: Start difference. First operand 534 states and 897 transitions. 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-16 18:35:14,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:14,300 INFO L93 Difference]: Finished difference Result 1055 states and 1779 transitions. [2025-03-16 18:35:14,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:14,301 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-16 18:35:14,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:14,305 INFO L225 Difference]: With dead ends: 1055 [2025-03-16 18:35:14,305 INFO L226 Difference]: Without dead ends: 534 [2025-03-16 18:35:14,307 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-16 18:35:14,308 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 1 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2663 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-16 18:35:14,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2663 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:14,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-16 18:35:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-03-16 18:35:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 421 states have (on average 1.7078384798099762) internal successors, (719), 442 states have internal predecessors, (719), 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-16 18:35:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 896 transitions. [2025-03-16 18:35:14,328 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 896 transitions. Word has length 56 [2025-03-16 18:35:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:14,328 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 896 transitions. [2025-03-16 18:35:14,328 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-16 18:35:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 896 transitions. [2025-03-16 18:35:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 18:35:14,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:14,329 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] [2025-03-16 18:35:14,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 18:35:14,329 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:14,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:14,330 INFO L85 PathProgramCache]: Analyzing trace with hash -135267255, now seen corresponding path program 1 times [2025-03-16 18:35:14,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:14,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528784412] [2025-03-16 18:35:14,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:14,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:14,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 18:35:14,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 18:35:14,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:14,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:14,485 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-16 18:35:14,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:14,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528784412] [2025-03-16 18:35:14,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528784412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:14,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:14,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:35:14,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792453466] [2025-03-16 18:35:14,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:14,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:35:14,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:14,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:35:14,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:35:14,488 INFO L87 Difference]: Start difference. First operand 534 states and 896 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-16 18:35:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:14,575 INFO L93 Difference]: Finished difference Result 1021 states and 1711 transitions. [2025-03-16 18:35:14,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:35:14,575 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 57 [2025-03-16 18:35:14,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:14,580 INFO L225 Difference]: With dead ends: 1021 [2025-03-16 18:35:14,580 INFO L226 Difference]: Without dead ends: 549 [2025-03-16 18:35:14,582 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-16 18:35:14,583 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 91 mSDsluCounter, 4349 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5235 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:14,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5235 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-16 18:35:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 547. [2025-03-16 18:35:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 431 states have (on average 1.703016241299304) internal successors, (734), 454 states have internal predecessors, (734), 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-16 18:35:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 915 transitions. [2025-03-16 18:35:14,608 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 915 transitions. Word has length 57 [2025-03-16 18:35:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:14,608 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 915 transitions. [2025-03-16 18:35:14,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-16 18:35:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 915 transitions. [2025-03-16 18:35:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 18:35:14,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:14,611 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] [2025-03-16 18:35:14,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 18:35:14,612 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:14,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:14,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1836007734, now seen corresponding path program 1 times [2025-03-16 18:35:14,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:14,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962568467] [2025-03-16 18:35:14,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:14,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 18:35:14,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 18:35:14,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:14,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:14,696 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-16 18:35:14,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:14,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962568467] [2025-03-16 18:35:14,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962568467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:14,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:14,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:14,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816480329] [2025-03-16 18:35:14,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:14,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:14,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:14,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:14,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:14,697 INFO L87 Difference]: Start difference. First operand 547 states and 915 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-16 18:35:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:14,731 INFO L93 Difference]: Finished difference Result 1073 states and 1805 transitions. [2025-03-16 18:35:14,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:14,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 57 [2025-03-16 18:35:14,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:14,739 INFO L225 Difference]: With dead ends: 1073 [2025-03-16 18:35:14,739 INFO L226 Difference]: Without dead ends: 528 [2025-03-16 18:35:14,741 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-16 18:35:14,742 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 0 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2665 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-16 18:35:14,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2665 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:14,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-16 18:35:14,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-03-16 18:35:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 415 states have (on average 1.6987951807228916) internal successors, (705), 436 states have internal predecessors, (705), 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-16 18:35:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 882 transitions. [2025-03-16 18:35:14,758 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 882 transitions. Word has length 57 [2025-03-16 18:35:14,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:14,758 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 882 transitions. [2025-03-16 18:35:14,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-16 18:35:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 882 transitions. [2025-03-16 18:35:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 18:35:14,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:14,763 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-16 18:35:14,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 18:35:14,763 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:14,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:14,763 INFO L85 PathProgramCache]: Analyzing trace with hash -564688311, now seen corresponding path program 1 times [2025-03-16 18:35:14,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:14,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108215283] [2025-03-16 18:35:14,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:14,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:14,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 18:35:14,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 18:35:14,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:14,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:14,864 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-16 18:35:14,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:14,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108215283] [2025-03-16 18:35:14,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108215283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:14,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:14,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:14,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145674929] [2025-03-16 18:35:14,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:14,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:14,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:14,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:14,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:14,867 INFO L87 Difference]: Start difference. First operand 528 states and 882 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-16 18:35:15,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:15,022 INFO L93 Difference]: Finished difference Result 1018 states and 1703 transitions. [2025-03-16 18:35:15,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:15,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 58 [2025-03-16 18:35:15,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:15,026 INFO L225 Difference]: With dead ends: 1018 [2025-03-16 18:35:15,026 INFO L226 Difference]: Without dead ends: 537 [2025-03-16 18:35:15,028 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-16 18:35:15,029 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 55 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4166 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-16 18:35:15,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4166 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:35:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-16 18:35:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 528. [2025-03-16 18:35:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 415 states have (on average 1.689156626506024) internal successors, (701), 436 states have internal predecessors, (701), 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-16 18:35:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 878 transitions. [2025-03-16 18:35:15,062 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 878 transitions. Word has length 58 [2025-03-16 18:35:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:15,063 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 878 transitions. [2025-03-16 18:35:15,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-16 18:35:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 878 transitions. [2025-03-16 18:35:15,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 18:35:15,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:15,064 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-16 18:35:15,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 18:35:15,064 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:15,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:15,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1612625646, now seen corresponding path program 1 times [2025-03-16 18:35:15,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:15,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254882818] [2025-03-16 18:35:15,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:15,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:15,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 18:35:15,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 18:35:15,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:15,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:15,160 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-16 18:35:15,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:15,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254882818] [2025-03-16 18:35:15,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254882818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:15,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:15,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:15,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484578443] [2025-03-16 18:35:15,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:15,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:15,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:15,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:15,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:15,162 INFO L87 Difference]: Start difference. First operand 528 states and 878 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-16 18:35:15,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:15,297 INFO L93 Difference]: Finished difference Result 1018 states and 1699 transitions. [2025-03-16 18:35:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:15,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 59 [2025-03-16 18:35:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:15,301 INFO L225 Difference]: With dead ends: 1018 [2025-03-16 18:35:15,301 INFO L226 Difference]: Without dead ends: 537 [2025-03-16 18:35:15,303 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-16 18:35:15,306 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 54 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4166 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-16 18:35:15,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4166 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:35:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-16 18:35:15,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 528. [2025-03-16 18:35:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 415 states have (on average 1.6795180722891567) internal successors, (697), 436 states have internal predecessors, (697), 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-16 18:35:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 874 transitions. [2025-03-16 18:35:15,324 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 874 transitions. Word has length 59 [2025-03-16 18:35:15,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:15,324 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 874 transitions. [2025-03-16 18:35:15,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-16 18:35:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 874 transitions. [2025-03-16 18:35:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 18:35:15,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:15,325 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-16 18:35:15,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 18:35:15,325 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:15,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:15,326 INFO L85 PathProgramCache]: Analyzing trace with hash -555740794, now seen corresponding path program 1 times [2025-03-16 18:35:15,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:15,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139954281] [2025-03-16 18:35:15,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:15,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:15,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 18:35:15,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 18:35:15,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:15,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:15,418 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-16 18:35:15,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:15,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139954281] [2025-03-16 18:35:15,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139954281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:15,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:15,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:15,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192826058] [2025-03-16 18:35:15,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:15,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:15,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:15,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:15,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:15,419 INFO L87 Difference]: Start difference. First operand 528 states and 874 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-16 18:35:15,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:15,540 INFO L93 Difference]: Finished difference Result 1018 states and 1695 transitions. [2025-03-16 18:35:15,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:15,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 60 [2025-03-16 18:35:15,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:15,545 INFO L225 Difference]: With dead ends: 1018 [2025-03-16 18:35:15,545 INFO L226 Difference]: Without dead ends: 537 [2025-03-16 18:35:15,547 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-16 18:35:15,547 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 53 mSDsluCounter, 3310 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4148 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-16 18:35:15,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4148 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:35:15,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-16 18:35:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 528. [2025-03-16 18:35:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 415 states have (on average 1.6698795180722892) internal successors, (693), 436 states have internal predecessors, (693), 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-16 18:35:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 870 transitions. [2025-03-16 18:35:15,566 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 870 transitions. Word has length 60 [2025-03-16 18:35:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:15,566 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 870 transitions. [2025-03-16 18:35:15,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-16 18:35:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 870 transitions. [2025-03-16 18:35:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 18:35:15,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:15,567 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-16 18:35:15,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 18:35:15,567 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:15,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:15,567 INFO L85 PathProgramCache]: Analyzing trace with hash -977527881, now seen corresponding path program 1 times [2025-03-16 18:35:15,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:15,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259289523] [2025-03-16 18:35:15,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:15,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:15,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 18:35:15,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 18:35:15,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:15,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:15,686 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-16 18:35:15,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:15,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259289523] [2025-03-16 18:35:15,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259289523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:15,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:15,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:35:15,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128194655] [2025-03-16 18:35:15,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:15,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:35:15,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:15,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:35:15,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:35:15,687 INFO L87 Difference]: Start difference. First operand 528 states and 870 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-16 18:35:15,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:15,735 INFO L93 Difference]: Finished difference Result 1009 states and 1677 transitions. [2025-03-16 18:35:15,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:35:15,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 60 [2025-03-16 18:35:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:15,740 INFO L225 Difference]: With dead ends: 1009 [2025-03-16 18:35:15,740 INFO L226 Difference]: Without dead ends: 507 [2025-03-16 18:35:15,742 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-16 18:35:15,743 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 84 mSDsluCounter, 4222 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5081 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-16 18:35:15,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5081 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-16 18:35:15,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-16 18:35:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 394 states have (on average 1.6725888324873097) internal successors, (659), 415 states have internal predecessors, (659), 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-16 18:35:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 836 transitions. [2025-03-16 18:35:15,755 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 836 transitions. Word has length 60 [2025-03-16 18:35:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:15,755 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 836 transitions. [2025-03-16 18:35:15,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-16 18:35:15,755 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 836 transitions. [2025-03-16 18:35:15,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 18:35:15,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:15,757 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-16 18:35:15,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 18:35:15,758 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:15,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:15,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1326122415, now seen corresponding path program 1 times [2025-03-16 18:35:15,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:15,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310657295] [2025-03-16 18:35:15,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:15,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:15,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 18:35:15,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 18:35:15,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:15,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:15,851 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-16 18:35:15,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:15,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310657295] [2025-03-16 18:35:15,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310657295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:15,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:15,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:15,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530588410] [2025-03-16 18:35:15,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:15,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:15,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:15,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:15,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:15,852 INFO L87 Difference]: Start difference. First operand 507 states and 836 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-16 18:35:15,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:15,915 INFO L93 Difference]: Finished difference Result 988 states and 1643 transitions. [2025-03-16 18:35:15,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:15,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 61 [2025-03-16 18:35:15,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:15,919 INFO L225 Difference]: With dead ends: 988 [2025-03-16 18:35:15,920 INFO L226 Difference]: Without dead ends: 507 [2025-03-16 18:35:15,921 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-16 18:35:15,922 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 17 mSDsluCounter, 3267 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4086 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-16 18:35:15,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4086 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:15,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-16 18:35:15,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-16 18:35:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 394 states have (on average 1.6700507614213198) internal successors, (658), 415 states have internal predecessors, (658), 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-16 18:35:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 835 transitions. [2025-03-16 18:35:15,936 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 835 transitions. Word has length 61 [2025-03-16 18:35:15,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:15,936 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 835 transitions. [2025-03-16 18:35:15,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-16 18:35:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 835 transitions. [2025-03-16 18:35:15,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 18:35:15,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:15,937 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-16 18:35:15,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 18:35:15,937 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:15,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:15,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1282456381, now seen corresponding path program 1 times [2025-03-16 18:35:15,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:15,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486090059] [2025-03-16 18:35:15,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:15,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:15,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 18:35:15,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 18:35:15,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:15,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:16,020 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-16 18:35:16,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:16,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486090059] [2025-03-16 18:35:16,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486090059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:16,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:16,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:16,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895378422] [2025-03-16 18:35:16,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:16,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:16,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:16,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:16,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:16,021 INFO L87 Difference]: Start difference. First operand 507 states and 835 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-16 18:35:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:16,078 INFO L93 Difference]: Finished difference Result 988 states and 1642 transitions. [2025-03-16 18:35:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:16,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 62 [2025-03-16 18:35:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:16,082 INFO L225 Difference]: With dead ends: 988 [2025-03-16 18:35:16,082 INFO L226 Difference]: Without dead ends: 507 [2025-03-16 18:35:16,084 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-16 18:35:16,084 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 16 mSDsluCounter, 3267 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4086 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-16 18:35:16,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4086 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-16 18:35:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-16 18:35:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 394 states have (on average 1.66751269035533) internal successors, (657), 415 states have internal predecessors, (657), 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-16 18:35:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 834 transitions. [2025-03-16 18:35:16,098 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 834 transitions. Word has length 62 [2025-03-16 18:35:16,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:16,098 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 834 transitions. [2025-03-16 18:35:16,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-16 18:35:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 834 transitions. [2025-03-16 18:35:16,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 18:35:16,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:16,099 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-16 18:35:16,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 18:35:16,099 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:16,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:16,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1360816564, now seen corresponding path program 1 times [2025-03-16 18:35:16,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:16,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023192129] [2025-03-16 18:35:16,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:16,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:16,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 18:35:16,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 18:35:16,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:16,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:16,176 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-16 18:35:16,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:16,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023192129] [2025-03-16 18:35:16,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023192129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:16,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:16,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:16,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421088681] [2025-03-16 18:35:16,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:16,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:16,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:16,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:16,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:16,177 INFO L87 Difference]: Start difference. First operand 507 states and 834 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 18:35:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:16,211 INFO L93 Difference]: Finished difference Result 982 states and 1630 transitions. [2025-03-16 18:35:16,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:16,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 63 [2025-03-16 18:35:16,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:16,215 INFO L225 Difference]: With dead ends: 982 [2025-03-16 18:35:16,215 INFO L226 Difference]: Without dead ends: 507 [2025-03-16 18:35:16,217 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-16 18:35:16,218 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 5 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2456 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:16,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2456 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:16,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-16 18:35:16,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-16 18:35:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 394 states have (on average 1.6649746192893402) internal successors, (656), 415 states have internal predecessors, (656), 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-16 18:35:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 833 transitions. [2025-03-16 18:35:16,233 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 833 transitions. Word has length 63 [2025-03-16 18:35:16,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:16,233 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 833 transitions. [2025-03-16 18:35:16,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 18:35:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 833 transitions. [2025-03-16 18:35:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 18:35:16,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:16,234 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-16 18:35:16,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 18:35:16,234 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:16,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:16,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1272902096, now seen corresponding path program 1 times [2025-03-16 18:35:16,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:16,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817542512] [2025-03-16 18:35:16,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:16,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:16,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 18:35:16,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 18:35:16,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:16,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:16,441 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-16 18:35:16,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:16,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817542512] [2025-03-16 18:35:16,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817542512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:16,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724815986] [2025-03-16 18:35:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:16,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:16,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:16,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:16,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:16,444 INFO L87 Difference]: Start difference. First operand 507 states and 833 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-16 18:35:18,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:18,093 INFO L93 Difference]: Finished difference Result 1576 states and 2645 transitions. [2025-03-16 18:35:18,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:18,094 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), 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 64 [2025-03-16 18:35:18,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:18,101 INFO L225 Difference]: With dead ends: 1576 [2025-03-16 18:35:18,101 INFO L226 Difference]: Without dead ends: 1109 [2025-03-16 18:35:18,103 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-16 18:35:18,103 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 3115 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3175 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 2417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:18,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3175 Valid, 1032 Invalid, 2417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 18:35:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2025-03-16 18:35:18,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 987. [2025-03-16 18:35:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 775 states have (on average 1.6825806451612904) internal successors, (1304), 805 states have internal predecessors, (1304), 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-16 18:35:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1654 transitions. [2025-03-16 18:35:18,142 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1654 transitions. Word has length 64 [2025-03-16 18:35:18,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:18,142 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 1654 transitions. [2025-03-16 18:35:18,143 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), 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-16 18:35:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1654 transitions. [2025-03-16 18:35:18,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 18:35:18,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:18,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:18,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 18:35:18,145 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:18,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:18,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1634890442, now seen corresponding path program 1 times [2025-03-16 18:35:18,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:18,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869453744] [2025-03-16 18:35:18,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:18,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:18,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 18:35:18,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 18:35:18,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:18,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:18,376 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-16 18:35:18,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:18,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869453744] [2025-03-16 18:35:18,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869453744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:18,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:18,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:35:18,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912626157] [2025-03-16 18:35:18,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:18,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:35:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:18,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:35:18,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:35:18,377 INFO L87 Difference]: Start difference. First operand 987 states and 1654 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 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-16 18:35:19,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:19,679 INFO L93 Difference]: Finished difference Result 1942 states and 3315 transitions. [2025-03-16 18:35:19,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:35:19,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 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 93 [2025-03-16 18:35:19,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:19,685 INFO L225 Difference]: With dead ends: 1942 [2025-03-16 18:35:19,685 INFO L226 Difference]: Without dead ends: 995 [2025-03-16 18:35:19,690 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-16 18:35:19,691 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 1284 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 2958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:19,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 1592 Invalid, 2958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 18:35:19,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2025-03-16 18:35:19,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2025-03-16 18:35:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 781 states have (on average 1.6773367477592829) internal successors, (1310), 811 states have internal predecessors, (1310), 174 states have call successors, (174), 36 states have call predecessors, (174), 39 states have return successors, (208), 160 states have call predecessors, (208), 169 states have call successors, (208) [2025-03-16 18:35:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1692 transitions. [2025-03-16 18:35:19,742 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1692 transitions. Word has length 93 [2025-03-16 18:35:19,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:19,742 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1692 transitions. [2025-03-16 18:35:19,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 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-16 18:35:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1692 transitions. [2025-03-16 18:35:19,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 18:35:19,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:19,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:19,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 18:35:19,745 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:19,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:19,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1701391797, now seen corresponding path program 1 times [2025-03-16 18:35:19,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:19,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477887343] [2025-03-16 18:35:19,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:19,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:19,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 18:35:19,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 18:35:19,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:19,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:20,000 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-16 18:35:20,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:20,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477887343] [2025-03-16 18:35:20,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477887343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:20,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:20,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 18:35:20,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957888641] [2025-03-16 18:35:20,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:20,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 18:35:20,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:20,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 18:35:20,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-16 18:35:20,002 INFO L87 Difference]: Start difference. First operand 995 states and 1692 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 11 states have internal predecessors, (72), 7 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-16 18:35:24,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:24,529 INFO L93 Difference]: Finished difference Result 3611 states and 6180 transitions. [2025-03-16 18:35:24,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 18:35:24,529 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 11 states have internal predecessors, (72), 7 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 93 [2025-03-16 18:35:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:24,543 INFO L225 Difference]: With dead ends: 3611 [2025-03-16 18:35:24,543 INFO L226 Difference]: Without dead ends: 2656 [2025-03-16 18:35:24,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 18:35:24,548 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 2757 mSDsluCounter, 6361 mSDsCounter, 0 mSdLazyCounter, 11605 mSolverCounterSat, 846 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2831 SdHoareTripleChecker+Valid, 7111 SdHoareTripleChecker+Invalid, 12451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 846 IncrementalHoareTripleChecker+Valid, 11605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:24,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2831 Valid, 7111 Invalid, 12451 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [846 Valid, 11605 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 18:35:24,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2025-03-16 18:35:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2560. [2025-03-16 18:35:24,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 1946 states have (on average 1.6433710174717369) internal successors, (3198), 2022 states have internal predecessors, (3198), 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-16 18:35:24,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 4323 transitions. [2025-03-16 18:35:24,668 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 4323 transitions. Word has length 93 [2025-03-16 18:35:24,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:24,668 INFO L471 AbstractCegarLoop]: Abstraction has 2560 states and 4323 transitions. [2025-03-16 18:35:24,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 11 states have internal predecessors, (72), 7 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-16 18:35:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 4323 transitions. [2025-03-16 18:35:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 18:35:24,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:24,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:24,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 18:35:24,671 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:24,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:24,672 INFO L85 PathProgramCache]: Analyzing trace with hash -104990485, now seen corresponding path program 1 times [2025-03-16 18:35:24,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:24,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678532541] [2025-03-16 18:35:24,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:24,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:24,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 18:35:24,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 18:35:24,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:24,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:24,816 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-16 18:35:24,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:24,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678532541] [2025-03-16 18:35:24,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678532541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:24,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:24,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:35:24,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064352517] [2025-03-16 18:35:24,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:24,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:35:24,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:24,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:35:24,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:35:24,818 INFO L87 Difference]: Start difference. First operand 2560 states and 4323 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (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-16 18:35:26,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:26,753 INFO L93 Difference]: Finished difference Result 8204 states and 14123 transitions. [2025-03-16 18:35:26,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 18:35:26,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (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 94 [2025-03-16 18:35:26,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:26,778 INFO L225 Difference]: With dead ends: 8204 [2025-03-16 18:35:26,778 INFO L226 Difference]: Without dead ends: 5684 [2025-03-16 18:35:26,789 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-16 18:35:26,789 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 2695 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 4280 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2764 SdHoareTripleChecker+Valid, 2518 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 4280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:26,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2764 Valid, 2518 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 4280 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 18:35:26,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5684 states. [2025-03-16 18:35:26,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5684 to 5453. [2025-03-16 18:35:26,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5453 states, 4142 states have (on average 1.6310960888459682) internal successors, (6756), 4323 states have internal predecessors, (6756), 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-16 18:35:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 9081 transitions. [2025-03-16 18:35:27,061 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 9081 transitions. Word has length 94 [2025-03-16 18:35:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:27,062 INFO L471 AbstractCegarLoop]: Abstraction has 5453 states and 9081 transitions. [2025-03-16 18:35:27,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (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-16 18:35:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 9081 transitions. [2025-03-16 18:35:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 18:35:27,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:27,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:27,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 18:35:27,064 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:27,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash 327147123, now seen corresponding path program 1 times [2025-03-16 18:35:27,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:27,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734476428] [2025-03-16 18:35:27,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:27,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 18:35:27,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 18:35:27,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:27,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:27,201 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-16 18:35:27,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:27,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734476428] [2025-03-16 18:35:27,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734476428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:27,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:27,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:35:27,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639135865] [2025-03-16 18:35:27,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:27,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:35:27,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:27,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:35:27,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:35:27,203 INFO L87 Difference]: Start difference. First operand 5453 states and 9081 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-16 18:35:30,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:30,013 INFO L93 Difference]: Finished difference Result 20100 states and 34300 transitions. [2025-03-16 18:35:30,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 18:35:30,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 96 [2025-03-16 18:35:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:30,075 INFO L225 Difference]: With dead ends: 20100 [2025-03-16 18:35:30,075 INFO L226 Difference]: Without dead ends: 14681 [2025-03-16 18:35:30,094 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-16 18:35:30,094 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 3096 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 5306 mSolverCounterSat, 838 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3227 SdHoareTripleChecker+Valid, 2884 SdHoareTripleChecker+Invalid, 6144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 838 IncrementalHoareTripleChecker+Valid, 5306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:30,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3227 Valid, 2884 Invalid, 6144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [838 Valid, 5306 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 18:35:30,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14681 states. [2025-03-16 18:35:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14681 to 12641. [2025-03-16 18:35:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12641 states, 8997 states have (on average 1.6142047349116373) internal successors, (14523), 9625 states have internal predecessors, (14523), 3192 states have call successors, (3192), 362 states have call predecessors, (3192), 451 states have return successors, (3927), 3117 states have call predecessors, (3927), 3187 states have call successors, (3927) [2025-03-16 18:35:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12641 states to 12641 states and 21642 transitions. [2025-03-16 18:35:30,677 INFO L78 Accepts]: Start accepts. Automaton has 12641 states and 21642 transitions. Word has length 96 [2025-03-16 18:35:30,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:30,677 INFO L471 AbstractCegarLoop]: Abstraction has 12641 states and 21642 transitions. [2025-03-16 18:35:30,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-16 18:35:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 12641 states and 21642 transitions. [2025-03-16 18:35:30,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 18:35:30,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:30,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:30,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 18:35:30,680 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:30,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:30,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1044660175, now seen corresponding path program 1 times [2025-03-16 18:35:30,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:30,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063220894] [2025-03-16 18:35:30,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:30,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:30,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 18:35:30,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 18:35:30,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:30,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:30,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-16 18:35:30,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:30,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063220894] [2025-03-16 18:35:30,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063220894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:30,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:30,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:35:30,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628698340] [2025-03-16 18:35:30,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:30,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:35:30,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:30,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:35:30,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:35:30,873 INFO L87 Difference]: Start difference. First operand 12641 states and 21642 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-16 18:35:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:33,725 INFO L93 Difference]: Finished difference Result 37537 states and 65106 transitions. [2025-03-16 18:35:33,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 18:35:33,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 96 [2025-03-16 18:35:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:33,872 INFO L225 Difference]: With dead ends: 37537 [2025-03-16 18:35:33,872 INFO L226 Difference]: Without dead ends: 26604 [2025-03-16 18:35:33,930 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-16 18:35:33,932 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 2354 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 3566 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2434 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 4068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 3566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:33,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2434 Valid, 1720 Invalid, 4068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 3566 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 18:35:33,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26604 states. [2025-03-16 18:35:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26604 to 25540. [2025-03-16 18:35:35,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25540 states, 18252 states have (on average 1.6141792680254219) internal successors, (29462), 19547 states have internal predecessors, (29462), 6255 states have call successors, (6255), 716 states have call predecessors, (6255), 1032 states have return successors, (8255), 6137 states have call predecessors, (8255), 6250 states have call successors, (8255) [2025-03-16 18:35:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25540 states to 25540 states and 43972 transitions. [2025-03-16 18:35:35,179 INFO L78 Accepts]: Start accepts. Automaton has 25540 states and 43972 transitions. Word has length 96 [2025-03-16 18:35:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:35,180 INFO L471 AbstractCegarLoop]: Abstraction has 25540 states and 43972 transitions. [2025-03-16 18:35:35,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-16 18:35:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 25540 states and 43972 transitions. [2025-03-16 18:35:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 18:35:35,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:35,182 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-16 18:35:35,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 18:35:35,182 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:35,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:35,183 INFO L85 PathProgramCache]: Analyzing trace with hash 119436968, now seen corresponding path program 1 times [2025-03-16 18:35:35,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:35,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116861614] [2025-03-16 18:35:35,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:35,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:35,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 18:35:35,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 18:35:35,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:35,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:35,270 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-16 18:35:35,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:35,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116861614] [2025-03-16 18:35:35,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116861614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:35,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:35,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:35:35,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390141328] [2025-03-16 18:35:35,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:35,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:35:35,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:35,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:35:35,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:35:35,271 INFO L87 Difference]: Start difference. First operand 25540 states and 43972 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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-16 18:35:37,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:37,013 INFO L93 Difference]: Finished difference Result 49468 states and 85518 transitions. [2025-03-16 18:35:37,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:35:37,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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 101 [2025-03-16 18:35:37,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:37,221 INFO L225 Difference]: With dead ends: 49468 [2025-03-16 18:35:37,222 INFO L226 Difference]: Without dead ends: 25856 [2025-03-16 18:35:37,334 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-16 18:35:37,335 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 0 mSDsluCounter, 2463 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3294 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-16 18:35:37,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3294 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25856 states. [2025-03-16 18:35:38,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25856 to 25796. [2025-03-16 18:35:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25796 states, 18450 states have (on average 1.6069376693766937) internal successors, (29648), 19739 states have internal predecessors, (29648), 6243 states have call successors, (6243), 716 states have call predecessors, (6243), 1102 states have return successors, (8476), 6201 states have call predecessors, (8476), 6238 states have call successors, (8476) [2025-03-16 18:35:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25796 states to 25796 states and 44367 transitions. [2025-03-16 18:35:38,535 INFO L78 Accepts]: Start accepts. Automaton has 25796 states and 44367 transitions. Word has length 101 [2025-03-16 18:35:38,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:38,537 INFO L471 AbstractCegarLoop]: Abstraction has 25796 states and 44367 transitions. [2025-03-16 18:35:38,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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-16 18:35:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 25796 states and 44367 transitions. [2025-03-16 18:35:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 18:35:38,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:38,540 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] [2025-03-16 18:35:38,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 18:35:38,540 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:38,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash 929167530, now seen corresponding path program 1 times [2025-03-16 18:35:38,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:38,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079776996] [2025-03-16 18:35:38,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:38,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:38,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 18:35:38,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 18:35:38,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:38,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:38,887 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-16 18:35:38,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:38,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079776996] [2025-03-16 18:35:38,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079776996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:38,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:38,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 18:35:38,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573240972] [2025-03-16 18:35:38,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:38,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:35:38,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:38,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:35:38,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:35:38,890 INFO L87 Difference]: Start difference. First operand 25796 states and 44367 transitions. Second operand has 9 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-16 18:35:40,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:40,056 INFO L93 Difference]: Finished difference Result 53656 states and 94164 transitions. [2025-03-16 18:35:40,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:35:40,059 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 108 [2025-03-16 18:35:40,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:40,237 INFO L225 Difference]: With dead ends: 53656 [2025-03-16 18:35:40,237 INFO L226 Difference]: Without dead ends: 26352 [2025-03-16 18:35:40,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:35:40,354 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 244 mSDsluCounter, 5800 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 6669 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:40,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 6669 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:35:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26352 states. [2025-03-16 18:35:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26352 to 25868. [2025-03-16 18:35:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25868 states, 18513 states have (on average 1.5797007508237455) internal successors, (29245), 19811 states have internal predecessors, (29245), 6243 states have call successors, (6243), 716 states have call predecessors, (6243), 1111 states have return successors, (8512), 6201 states have call predecessors, (8512), 6238 states have call successors, (8512) [2025-03-16 18:35:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25868 states to 25868 states and 44000 transitions. [2025-03-16 18:35:41,911 INFO L78 Accepts]: Start accepts. Automaton has 25868 states and 44000 transitions. Word has length 108 [2025-03-16 18:35:41,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:41,912 INFO L471 AbstractCegarLoop]: Abstraction has 25868 states and 44000 transitions. [2025-03-16 18:35:41,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-16 18:35:41,912 INFO L276 IsEmpty]: Start isEmpty. Operand 25868 states and 44000 transitions. [2025-03-16 18:35:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 18:35:41,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:41,915 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] [2025-03-16 18:35:41,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 18:35:41,915 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:41,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:41,915 INFO L85 PathProgramCache]: Analyzing trace with hash -298784802, now seen corresponding path program 1 times [2025-03-16 18:35:41,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:41,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528128793] [2025-03-16 18:35:41,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:41,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:41,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 18:35:41,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 18:35:41,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:41,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:42,089 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-16 18:35:42,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:42,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528128793] [2025-03-16 18:35:42,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528128793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:42,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:42,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:35:42,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729214260] [2025-03-16 18:35:42,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:42,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:35:42,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:42,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:35:42,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:35:42,091 INFO L87 Difference]: Start difference. First operand 25868 states and 44000 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-16 18:35:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:44,937 INFO L93 Difference]: Finished difference Result 52429 states and 89500 transitions. [2025-03-16 18:35:44,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 18:35:44,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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 113 [2025-03-16 18:35:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:45,153 INFO L225 Difference]: With dead ends: 52429 [2025-03-16 18:35:45,153 INFO L226 Difference]: Without dead ends: 28510 [2025-03-16 18:35:45,454 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-16 18:35:45,455 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 2078 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 3080 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2154 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 3557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 3080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:45,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2154 Valid, 1664 Invalid, 3557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 3080 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 18:35:45,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28510 states. [2025-03-16 18:35:46,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28510 to 26966. [2025-03-16 18:35:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26966 states, 19332 states have (on average 1.5678667494309952) internal successors, (30310), 20702 states have internal predecessors, (30310), 6348 states have call successors, (6348), 821 states have call predecessors, (6348), 1285 states have return successors, (8913), 6303 states have call predecessors, (8913), 6343 states have call successors, (8913) [2025-03-16 18:35:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26966 states to 26966 states and 45571 transitions. [2025-03-16 18:35:46,552 INFO L78 Accepts]: Start accepts. Automaton has 26966 states and 45571 transitions. Word has length 113 [2025-03-16 18:35:46,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:46,552 INFO L471 AbstractCegarLoop]: Abstraction has 26966 states and 45571 transitions. [2025-03-16 18:35:46,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-16 18:35:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 26966 states and 45571 transitions. [2025-03-16 18:35:46,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 18:35:46,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:46,555 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] [2025-03-16 18:35:46,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 18:35:46,555 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:46,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:46,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1611467842, now seen corresponding path program 1 times [2025-03-16 18:35:46,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:46,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395254827] [2025-03-16 18:35:46,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:46,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:46,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 18:35:46,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 18:35:46,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:46,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:46,673 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-16 18:35:46,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:46,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395254827] [2025-03-16 18:35:46,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395254827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:46,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:46,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:35:46,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896100852] [2025-03-16 18:35:46,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:46,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:35:46,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:46,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:35:46,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:35:46,674 INFO L87 Difference]: Start difference. First operand 26966 states and 45571 transitions. Second operand has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:35:48,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:48,605 INFO L93 Difference]: Finished difference Result 64681 states and 110158 transitions. [2025-03-16 18:35:48,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:35:48,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2025-03-16 18:35:48,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:48,942 INFO L225 Difference]: With dead ends: 64681 [2025-03-16 18:35:48,943 INFO L226 Difference]: Without dead ends: 39664 [2025-03-16 18:35:49,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:35:49,043 INFO L435 NwaCegarLoop]: 1349 mSDtfsCounter, 789 mSDsluCounter, 7495 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 8844 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:49,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 8844 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:35:49,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39664 states. [2025-03-16 18:35:51,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39664 to 37021. [2025-03-16 18:35:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37021 states, 26455 states have (on average 1.5748629748629748) internal successors, (41663), 28291 states have internal predecessors, (41663), 8932 states have call successors, (8932), 1047 states have call predecessors, (8932), 1633 states have return successors, (12420), 8940 states have call predecessors, (12420), 8927 states have call successors, (12420) [2025-03-16 18:35:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37021 states to 37021 states and 63015 transitions. [2025-03-16 18:35:51,699 INFO L78 Accepts]: Start accepts. Automaton has 37021 states and 63015 transitions. Word has length 118 [2025-03-16 18:35:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:51,699 INFO L471 AbstractCegarLoop]: Abstraction has 37021 states and 63015 transitions. [2025-03-16 18:35:51,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:35:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 37021 states and 63015 transitions. [2025-03-16 18:35:51,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 18:35:51,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:51,702 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] [2025-03-16 18:35:51,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 18:35:51,702 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:51,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:51,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1544461089, now seen corresponding path program 1 times [2025-03-16 18:35:51,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:51,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979901349] [2025-03-16 18:35:51,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:51,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:51,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 18:35:51,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 18:35:51,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:51,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:51,823 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-16 18:35:51,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:51,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979901349] [2025-03-16 18:35:51,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979901349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:51,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:51,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112496823] [2025-03-16 18:35:51,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:51,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:51,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:51,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:51,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:51,825 INFO L87 Difference]: Start difference. First operand 37021 states and 63015 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-16 18:35:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:53,424 INFO L93 Difference]: Finished difference Result 37186 states and 63320 transitions. [2025-03-16 18:35:53,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:35:53,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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 118 [2025-03-16 18:35:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:53,666 INFO L225 Difference]: With dead ends: 37186 [2025-03-16 18:35:53,666 INFO L226 Difference]: Without dead ends: 37171 [2025-03-16 18:35:53,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:35:53,689 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 897 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 2911 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:53,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 2911 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 18:35:53,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37171 states. [2025-03-16 18:35:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37171 to 37031. [2025-03-16 18:35:55,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37031 states, 26465 states have (on average 1.574645758549027) internal successors, (41673), 28301 states have internal predecessors, (41673), 8932 states have call successors, (8932), 1047 states have call predecessors, (8932), 1633 states have return successors, (12420), 8940 states have call predecessors, (12420), 8927 states have call successors, (12420) [2025-03-16 18:35:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37031 states to 37031 states and 63025 transitions. [2025-03-16 18:35:55,321 INFO L78 Accepts]: Start accepts. Automaton has 37031 states and 63025 transitions. Word has length 118 [2025-03-16 18:35:55,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:55,321 INFO L471 AbstractCegarLoop]: Abstraction has 37031 states and 63025 transitions. [2025-03-16 18:35:55,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-16 18:35:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand 37031 states and 63025 transitions. [2025-03-16 18:35:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 18:35:55,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:55,324 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] [2025-03-16 18:35:55,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 18:35:55,324 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:55,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:55,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1962153614, now seen corresponding path program 1 times [2025-03-16 18:35:55,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:55,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461360934] [2025-03-16 18:35:55,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:55,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:55,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 18:35:55,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 18:35:55,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:55,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:55,540 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-16 18:35:55,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:55,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461360934] [2025-03-16 18:35:55,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461360934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:55,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:55,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 18:35:55,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970327750] [2025-03-16 18:35:55,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:55,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 18:35:55,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:55,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 18:35:55,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-16 18:35:55,542 INFO L87 Difference]: Start difference. First operand 37031 states and 63025 transitions. Second operand has 13 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 7 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15)