./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68493680033c9035e39b01d00eb3730662e9195bee3c7e3d4b2805e2b52b60ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:45:11,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:45:11,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:45:11,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:45:11,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:45:11,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:45:11,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:45:11,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:45:11,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:45:11,386 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:45:11,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:45:11,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:45:11,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:45:11,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:45:11,387 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:45:11,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:45:11,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:45:11,389 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:45:11,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:45:11,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:45:11,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:45:11,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:45:11,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:45:11,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:45:11,390 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:45:11,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:45:11,390 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:45:11,390 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:45:11,390 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:45:11,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:45:11,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:45:11,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:45:11,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:45:11,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:45:11,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:45:11,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:45:11,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:45:11,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:45:11,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:45:11,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:45:11,391 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:45:11,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:45:11,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:45:11,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:45:11,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:45:11,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:45:11,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:45:11,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:45:11,391 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68493680033c9035e39b01d00eb3730662e9195bee3c7e3d4b2805e2b52b60ec [2025-01-09 03:45:11,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:45:11,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:45:11,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:45:11,717 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:45:11,718 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:45:11,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c [2025-01-09 03:45:13,111 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e41b8303/3585ac4fa5c341dfb8b711434c9092e1/FLAGa084da9c5 [2025-01-09 03:45:13,557 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:45:13,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c [2025-01-09 03:45:13,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e41b8303/3585ac4fa5c341dfb8b711434c9092e1/FLAGa084da9c5 [2025-01-09 03:45:13,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e41b8303/3585ac4fa5c341dfb8b711434c9092e1 [2025-01-09 03:45:13,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:45:13,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:45:13,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:45:13,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:45:13,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:45:13,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4760b3f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:13, skipping insertion in model container [2025-01-09 03:45:13,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:45:13" (1/1) ... [2025-01-09 03:45:13,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:45:14,154 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c[66231,66244] [2025-01-09 03:45:14,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:45:14,210 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:45:14,220 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-01-09 03:45:14,222 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [86] [2025-01-09 03:45:14,222 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [100] [2025-01-09 03:45:14,222 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [286] [2025-01-09 03:45:14,223 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1765] [2025-01-09 03:45:14,223 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1884] [2025-01-09 03:45:14,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2546] [2025-01-09 03:45:14,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2638] [2025-01-09 03:45:14,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3004] [2025-01-09 03:45:14,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3013] [2025-01-09 03:45:14,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c[66231,66244] [2025-01-09 03:45:14,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:45:14,373 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:45:14,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:14 WrapperNode [2025-01-09 03:45:14,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:45:14,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:45:14,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:45:14,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:45:14,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:14" (1/1) ... [2025-01-09 03:45:14,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:14" (1/1) ... [2025-01-09 03:45:14,441 INFO L138 Inliner]: procedures = 91, calls = 334, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 842 [2025-01-09 03:45:14,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:45:14,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:45:14,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:45:14,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:45:14,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:14" (1/1) ... [2025-01-09 03:45:14,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:14" (1/1) ... [2025-01-09 03:45:14,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:14" (1/1) ... [2025-01-09 03:45:14,505 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-01-09 03:45:14,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:14" (1/1) ... [2025-01-09 03:45:14,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:14" (1/1) ... [2025-01-09 03:45:14,529 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:14" (1/1) ... [2025-01-09 03:45:14,536 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:14" (1/1) ... [2025-01-09 03:45:14,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:14" (1/1) ... [2025-01-09 03:45:14,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:14" (1/1) ... [2025-01-09 03:45:14,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:14" (1/1) ... [2025-01-09 03:45:14,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:45:14,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:45:14,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:45:14,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:45:14,590 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:14" (1/1) ... [2025-01-09 03:45:14,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:45:14,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:45:14,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:45:14,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:45:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:45:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-01-09 03:45:14,649 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-01-09 03:45:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-01-09 03:45:14,649 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-01-09 03:45:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-01-09 03:45:14,649 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-01-09 03:45:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-01-09 03:45:14,649 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-01-09 03:45:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-01-09 03:45:14,649 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-01-09 03:45:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:45:14,649 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:45:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:45:14,649 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:45:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-01-09 03:45:14,649 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-01-09 03:45:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:45:14,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:45:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-01-09 03:45:14,650 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-01-09 03:45:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-01-09 03:45:14,650 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-01-09 03:45:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-01-09 03:45:14,650 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-01-09 03:45:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-01-09 03:45:14,650 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-01-09 03:45:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-01-09 03:45:14,650 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-01-09 03:45:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-01-09 03:45:14,651 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-01-09 03:45:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-01-09 03:45:14,651 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-01-09 03:45:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-01-09 03:45:14,651 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-01-09 03:45:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:45:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:45:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:45:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:45:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 03:45:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 03:45:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 03:45:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 03:45:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 03:45:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 03:45:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 03:45:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 03:45:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 03:45:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 03:45:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 03:45:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 03:45:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 03:45:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 03:45:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 03:45:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 03:45:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-01-09 03:45:14,652 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-01-09 03:45:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-01-09 03:45:14,652 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-01-09 03:45:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-01-09 03:45:14,652 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-01-09 03:45:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:45:14,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:45:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-01-09 03:45:14,652 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-01-09 03:45:14,848 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:45:14,850 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:45:16,172 INFO L? ?]: Removed 439 outVars from TransFormulas that were not future-live. [2025-01-09 03:45:16,172 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:45:16,199 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:45:16,200 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:45:16,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:45:16 BoogieIcfgContainer [2025-01-09 03:45:16,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:45:16,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:45:16,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:45:16,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:45:16,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:45:13" (1/3) ... [2025-01-09 03:45:16,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d9223f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:45:16, skipping insertion in model container [2025-01-09 03:45:16,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:45:14" (2/3) ... [2025-01-09 03:45:16,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d9223f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:45:16, skipping insertion in model container [2025-01-09 03:45:16,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:45:16" (3/3) ... [2025-01-09 03:45:16,211 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product25.cil.c [2025-01-09 03:45:16,222 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:45:16,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product25.cil.c that has 22 procedures, 540 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:45:16,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:45:16,302 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;@3e157e95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:45:16,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:45:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 540 states, 429 states have (on average 1.710955710955711) internal successors, (734), 450 states have internal predecessors, (734), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (88), 82 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 03:45:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 03:45:16,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:16,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:16,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:16,334 INFO L85 PathProgramCache]: Analyzing trace with hash -161080608, now seen corresponding path program 1 times [2025-01-09 03:45:16,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:16,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159927375] [2025-01-09 03:45:16,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:16,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:16,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 03:45:16,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 03:45:16,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:16,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:16,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:16,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159927375] [2025-01-09 03:45:16,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159927375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:16,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:16,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:16,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992095172] [2025-01-09 03:45:16,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:16,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:16,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:16,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:16,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:16,943 INFO L87 Difference]: Start difference. First operand has 540 states, 429 states have (on average 1.710955710955711) internal successors, (734), 450 states have internal predecessors, (734), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (88), 82 states have call predecessors, (88), 88 states have call successors, (88) Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:17,110 INFO L93 Difference]: Finished difference Result 1060 states and 1795 transitions. [2025-01-09 03:45:17,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:17,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-01-09 03:45:17,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:17,135 INFO L225 Difference]: With dead ends: 1060 [2025-01-09 03:45:17,138 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 03:45:17,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:17,154 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 5 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2666 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:17,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2666 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:17,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 03:45:17,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-01-09 03:45:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 423 states have (on average 1.7092198581560283) internal successors, (723), 442 states have internal predecessors, (723), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:45:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 894 transitions. [2025-01-09 03:45:17,261 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 894 transitions. Word has length 74 [2025-01-09 03:45:17,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:17,262 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 894 transitions. [2025-01-09 03:45:17,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 894 transitions. [2025-01-09 03:45:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 03:45:17,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:17,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:17,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:45:17,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:17,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:17,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1138058454, now seen corresponding path program 1 times [2025-01-09 03:45:17,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:17,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257899348] [2025-01-09 03:45:17,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:17,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:17,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 03:45:17,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 03:45:17,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:17,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:17,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:17,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257899348] [2025-01-09 03:45:17,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257899348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:17,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:17,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:17,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276771763] [2025-01-09 03:45:17,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:17,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:17,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:17,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:17,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:17,540 INFO L87 Difference]: Start difference. First operand 532 states and 894 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:17,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:17,629 INFO L93 Difference]: Finished difference Result 1046 states and 1765 transitions. [2025-01-09 03:45:17,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:17,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2025-01-09 03:45:17,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:17,637 INFO L225 Difference]: With dead ends: 1046 [2025-01-09 03:45:17,641 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 03:45:17,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:17,646 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 4 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:17,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2645 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:17,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 03:45:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-01-09 03:45:17,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 423 states have (on average 1.706855791962175) internal successors, (722), 442 states have internal predecessors, (722), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:45:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 893 transitions. [2025-01-09 03:45:17,679 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 893 transitions. Word has length 76 [2025-01-09 03:45:17,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:17,680 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 893 transitions. [2025-01-09 03:45:17,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 893 transitions. [2025-01-09 03:45:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 03:45:17,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:17,689 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] [2025-01-09 03:45:17,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:45:17,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:17,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:17,690 INFO L85 PathProgramCache]: Analyzing trace with hash -374812646, now seen corresponding path program 1 times [2025-01-09 03:45:17,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:17,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046377826] [2025-01-09 03:45:17,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:17,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:17,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 03:45:17,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 03:45:17,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:17,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:17,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:17,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046377826] [2025-01-09 03:45:17,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046377826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:17,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:17,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:17,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264982835] [2025-01-09 03:45:17,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:17,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:17,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:17,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:17,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:17,909 INFO L87 Difference]: Start difference. First operand 532 states and 893 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:17,983 INFO L93 Difference]: Finished difference Result 1046 states and 1764 transitions. [2025-01-09 03:45:17,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:17,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2025-01-09 03:45:17,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:17,994 INFO L225 Difference]: With dead ends: 1046 [2025-01-09 03:45:17,995 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 03:45:17,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:17,999 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 3 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:17,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2645 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 03:45:18,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-01-09 03:45:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 423 states have (on average 1.7044917257683214) internal successors, (721), 442 states have internal predecessors, (721), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:45:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 892 transitions. [2025-01-09 03:45:18,038 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 892 transitions. Word has length 77 [2025-01-09 03:45:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:18,039 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 892 transitions. [2025-01-09 03:45:18,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 892 transitions. [2025-01-09 03:45:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 03:45:18,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:18,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:18,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:45:18,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:18,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:18,045 INFO L85 PathProgramCache]: Analyzing trace with hash 976177710, now seen corresponding path program 1 times [2025-01-09 03:45:18,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:18,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961163475] [2025-01-09 03:45:18,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:18,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:18,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 03:45:18,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 03:45:18,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:18,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:18,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:18,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961163475] [2025-01-09 03:45:18,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961163475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:18,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:18,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:18,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717408574] [2025-01-09 03:45:18,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:18,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:18,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:18,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:18,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:18,245 INFO L87 Difference]: Start difference. First operand 532 states and 892 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:18,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:18,311 INFO L93 Difference]: Finished difference Result 1046 states and 1763 transitions. [2025-01-09 03:45:18,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:18,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2025-01-09 03:45:18,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:18,323 INFO L225 Difference]: With dead ends: 1046 [2025-01-09 03:45:18,324 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 03:45:18,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:18,329 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 2 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:18,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2645 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:18,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 03:45:18,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-01-09 03:45:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 423 states have (on average 1.702127659574468) internal successors, (720), 442 states have internal predecessors, (720), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:45:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 891 transitions. [2025-01-09 03:45:18,379 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 891 transitions. Word has length 78 [2025-01-09 03:45:18,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:18,380 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 891 transitions. [2025-01-09 03:45:18,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:18,380 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 891 transitions. [2025-01-09 03:45:18,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 03:45:18,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:18,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:18,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:45:18,385 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:18,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:18,386 INFO L85 PathProgramCache]: Analyzing trace with hash -927587426, now seen corresponding path program 1 times [2025-01-09 03:45:18,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:18,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141295595] [2025-01-09 03:45:18,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:18,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:18,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 03:45:18,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 03:45:18,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:18,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:18,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:18,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141295595] [2025-01-09 03:45:18,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141295595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:18,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:18,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:18,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343423931] [2025-01-09 03:45:18,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:18,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:18,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:18,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:18,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:18,574 INFO L87 Difference]: Start difference. First operand 532 states and 891 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:18,641 INFO L93 Difference]: Finished difference Result 1046 states and 1762 transitions. [2025-01-09 03:45:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:18,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2025-01-09 03:45:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:18,646 INFO L225 Difference]: With dead ends: 1046 [2025-01-09 03:45:18,647 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 03:45:18,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:18,650 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 1 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:18,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2645 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:18,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 03:45:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-01-09 03:45:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 423 states have (on average 1.6997635933806146) internal successors, (719), 442 states have internal predecessors, (719), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:45:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 890 transitions. [2025-01-09 03:45:18,676 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 890 transitions. Word has length 79 [2025-01-09 03:45:18,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:18,676 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 890 transitions. [2025-01-09 03:45:18,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:18,676 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 890 transitions. [2025-01-09 03:45:18,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 03:45:18,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:18,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:18,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:45:18,681 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:18,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash -858256013, now seen corresponding path program 1 times [2025-01-09 03:45:18,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:18,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107354103] [2025-01-09 03:45:18,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:18,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:18,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 03:45:18,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 03:45:18,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:18,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:18,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:18,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107354103] [2025-01-09 03:45:18,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107354103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:18,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:18,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:18,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117095081] [2025-01-09 03:45:18,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:18,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:18,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:18,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:18,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:18,802 INFO L87 Difference]: Start difference. First operand 532 states and 890 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:18,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:18,842 INFO L93 Difference]: Finished difference Result 1046 states and 1761 transitions. [2025-01-09 03:45:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:18,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2025-01-09 03:45:18,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:18,848 INFO L225 Difference]: With dead ends: 1046 [2025-01-09 03:45:18,848 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 03:45:18,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:18,851 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 0 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:18,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2645 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 03:45:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-01-09 03:45:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 423 states have (on average 1.6973995271867612) internal successors, (718), 442 states have internal predecessors, (718), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:45:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 889 transitions. [2025-01-09 03:45:18,876 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 889 transitions. Word has length 80 [2025-01-09 03:45:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:18,876 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 889 transitions. [2025-01-09 03:45:18,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:18,876 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 889 transitions. [2025-01-09 03:45:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 03:45:18,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:18,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:18,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:45:18,882 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:18,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:18,882 INFO L85 PathProgramCache]: Analyzing trace with hash -649557710, now seen corresponding path program 1 times [2025-01-09 03:45:18,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:18,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002335416] [2025-01-09 03:45:18,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:18,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:18,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 03:45:18,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 03:45:18,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:18,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:19,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:19,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002335416] [2025-01-09 03:45:19,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002335416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:19,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:19,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:19,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347579888] [2025-01-09 03:45:19,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:19,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:19,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:19,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:19,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:19,078 INFO L87 Difference]: Start difference. First operand 532 states and 889 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:45:19,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:19,181 INFO L93 Difference]: Finished difference Result 1006 states and 1685 transitions. [2025-01-09 03:45:19,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:19,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2025-01-09 03:45:19,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:19,189 INFO L225 Difference]: With dead ends: 1006 [2025-01-09 03:45:19,189 INFO L226 Difference]: Without dead ends: 526 [2025-01-09 03:45:19,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:19,194 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 91 mSDsluCounter, 4303 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5180 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:19,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5180 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:19,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-01-09 03:45:19,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-01-09 03:45:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 417 states have (on average 1.6906474820143884) internal successors, (705), 436 states have internal predecessors, (705), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:45:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 876 transitions. [2025-01-09 03:45:19,218 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 876 transitions. Word has length 80 [2025-01-09 03:45:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:19,220 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 876 transitions. [2025-01-09 03:45:19,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:45:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 876 transitions. [2025-01-09 03:45:19,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 03:45:19,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:19,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:19,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:45:19,223 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:19,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:19,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1892674100, now seen corresponding path program 1 times [2025-01-09 03:45:19,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:19,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378846391] [2025-01-09 03:45:19,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:19,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:19,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 03:45:19,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 03:45:19,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:19,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:19,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:19,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378846391] [2025-01-09 03:45:19,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378846391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:19,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:19,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:19,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659704238] [2025-01-09 03:45:19,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:19,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:19,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:19,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:19,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:19,405 INFO L87 Difference]: Start difference. First operand 526 states and 876 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:19,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:19,630 INFO L93 Difference]: Finished difference Result 1009 states and 1686 transitions. [2025-01-09 03:45:19,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:19,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2025-01-09 03:45:19,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:19,636 INFO L225 Difference]: With dead ends: 1009 [2025-01-09 03:45:19,637 INFO L226 Difference]: Without dead ends: 535 [2025-01-09 03:45:19,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:19,640 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 55 mSDsluCounter, 3303 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4136 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:19,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4136 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:45:19,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-01-09 03:45:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2025-01-09 03:45:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 417 states have (on average 1.6810551558752997) internal successors, (701), 436 states have internal predecessors, (701), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:45:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 872 transitions. [2025-01-09 03:45:19,666 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 872 transitions. Word has length 81 [2025-01-09 03:45:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:19,666 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 872 transitions. [2025-01-09 03:45:19,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:19,667 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 872 transitions. [2025-01-09 03:45:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 03:45:19,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:19,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:19,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:45:19,670 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:19,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:19,671 INFO L85 PathProgramCache]: Analyzing trace with hash 415708591, now seen corresponding path program 1 times [2025-01-09 03:45:19,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:19,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570607954] [2025-01-09 03:45:19,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:19,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:19,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 03:45:19,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 03:45:19,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:19,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:19,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:19,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570607954] [2025-01-09 03:45:19,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570607954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:19,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:19,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:19,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303874075] [2025-01-09 03:45:19,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:19,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:19,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:19,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:19,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:19,850 INFO L87 Difference]: Start difference. First operand 526 states and 872 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:20,041 INFO L93 Difference]: Finished difference Result 1009 states and 1682 transitions. [2025-01-09 03:45:20,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:20,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2025-01-09 03:45:20,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:20,048 INFO L225 Difference]: With dead ends: 1009 [2025-01-09 03:45:20,048 INFO L226 Difference]: Without dead ends: 535 [2025-01-09 03:45:20,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:20,052 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 54 mSDsluCounter, 3303 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4136 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:20,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4136 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:45:20,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-01-09 03:45:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2025-01-09 03:45:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 417 states have (on average 1.671462829736211) internal successors, (697), 436 states have internal predecessors, (697), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:45:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 868 transitions. [2025-01-09 03:45:20,079 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 868 transitions. Word has length 82 [2025-01-09 03:45:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:20,079 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 868 transitions. [2025-01-09 03:45:20,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 868 transitions. [2025-01-09 03:45:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 03:45:20,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:20,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:20,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:45:20,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:20,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:20,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1976104943, now seen corresponding path program 1 times [2025-01-09 03:45:20,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:20,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182528988] [2025-01-09 03:45:20,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:20,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:20,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 03:45:20,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 03:45:20,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:20,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:20,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:20,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182528988] [2025-01-09 03:45:20,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182528988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:20,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:20,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:20,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350246797] [2025-01-09 03:45:20,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:20,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:20,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:20,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:20,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:20,258 INFO L87 Difference]: Start difference. First operand 526 states and 868 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:20,421 INFO L93 Difference]: Finished difference Result 1009 states and 1678 transitions. [2025-01-09 03:45:20,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:20,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2025-01-09 03:45:20,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:20,427 INFO L225 Difference]: With dead ends: 1009 [2025-01-09 03:45:20,427 INFO L226 Difference]: Without dead ends: 535 [2025-01-09 03:45:20,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:20,430 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 53 mSDsluCounter, 3286 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4118 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:20,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4118 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:45:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-01-09 03:45:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2025-01-09 03:45:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 417 states have (on average 1.6618705035971224) internal successors, (693), 436 states have internal predecessors, (693), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:45:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 864 transitions. [2025-01-09 03:45:20,452 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 864 transitions. Word has length 83 [2025-01-09 03:45:20,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:20,452 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 864 transitions. [2025-01-09 03:45:20,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:20,453 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 864 transitions. [2025-01-09 03:45:20,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 03:45:20,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:20,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:20,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:45:20,456 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:20,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:20,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1704389487, now seen corresponding path program 1 times [2025-01-09 03:45:20,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:20,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259431846] [2025-01-09 03:45:20,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:20,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:20,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 03:45:20,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 03:45:20,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:20,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:20,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:20,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259431846] [2025-01-09 03:45:20,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259431846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:20,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:20,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:20,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87177725] [2025-01-09 03:45:20,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:20,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:20,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:20,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:20,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:20,632 INFO L87 Difference]: Start difference. First operand 526 states and 864 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:45:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:20,704 INFO L93 Difference]: Finished difference Result 1000 states and 1660 transitions. [2025-01-09 03:45:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:20,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2025-01-09 03:45:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:20,710 INFO L225 Difference]: With dead ends: 1000 [2025-01-09 03:45:20,710 INFO L226 Difference]: Without dead ends: 505 [2025-01-09 03:45:20,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:20,714 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 84 mSDsluCounter, 4192 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5045 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:20,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5045 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-01-09 03:45:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-01-09 03:45:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 396 states have (on average 1.6641414141414141) internal successors, (659), 415 states have internal predecessors, (659), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:45:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 830 transitions. [2025-01-09 03:45:20,735 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 830 transitions. Word has length 83 [2025-01-09 03:45:20,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:20,736 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 830 transitions. [2025-01-09 03:45:20,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:45:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 830 transitions. [2025-01-09 03:45:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 03:45:20,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:20,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:20,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:45:20,741 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:20,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:20,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1089528822, now seen corresponding path program 1 times [2025-01-09 03:45:20,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:20,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020957020] [2025-01-09 03:45:20,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:20,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:20,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 03:45:20,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 03:45:20,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:20,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:20,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:20,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020957020] [2025-01-09 03:45:20,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020957020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:20,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:20,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:20,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092528079] [2025-01-09 03:45:20,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:20,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:20,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:20,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:20,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:20,869 INFO L87 Difference]: Start difference. First operand 505 states and 830 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:20,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:20,955 INFO L93 Difference]: Finished difference Result 979 states and 1626 transitions. [2025-01-09 03:45:20,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:20,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2025-01-09 03:45:20,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:20,961 INFO L225 Difference]: With dead ends: 979 [2025-01-09 03:45:20,962 INFO L226 Difference]: Without dead ends: 505 [2025-01-09 03:45:20,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:20,965 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 17 mSDsluCounter, 3243 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4056 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:20,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4056 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:20,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-01-09 03:45:20,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-01-09 03:45:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 396 states have (on average 1.6616161616161615) internal successors, (658), 415 states have internal predecessors, (658), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:45:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 829 transitions. [2025-01-09 03:45:20,987 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 829 transitions. Word has length 84 [2025-01-09 03:45:20,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:20,987 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 829 transitions. [2025-01-09 03:45:20,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 829 transitions. [2025-01-09 03:45:20,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 03:45:20,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:20,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:20,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:45:20,991 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:20,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:20,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1533208150, now seen corresponding path program 1 times [2025-01-09 03:45:20,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:20,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128293771] [2025-01-09 03:45:20,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:20,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:21,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 03:45:21,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 03:45:21,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:21,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:21,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:21,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128293771] [2025-01-09 03:45:21,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128293771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:21,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:21,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:21,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990278113] [2025-01-09 03:45:21,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:21,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:21,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:21,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:21,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:21,136 INFO L87 Difference]: Start difference. First operand 505 states and 829 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:21,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:21,211 INFO L93 Difference]: Finished difference Result 979 states and 1625 transitions. [2025-01-09 03:45:21,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:45:21,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2025-01-09 03:45:21,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:21,216 INFO L225 Difference]: With dead ends: 979 [2025-01-09 03:45:21,217 INFO L226 Difference]: Without dead ends: 505 [2025-01-09 03:45:21,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:21,220 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 16 mSDsluCounter, 3243 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4056 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:21,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4056 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:21,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-01-09 03:45:21,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-01-09 03:45:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 396 states have (on average 1.6590909090909092) internal successors, (657), 415 states have internal predecessors, (657), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:45:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 828 transitions. [2025-01-09 03:45:21,244 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 828 transitions. Word has length 85 [2025-01-09 03:45:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:21,244 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 828 transitions. [2025-01-09 03:45:21,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 828 transitions. [2025-01-09 03:45:21,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 03:45:21,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:21,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:21,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:45:21,247 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:21,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:21,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2034963491, now seen corresponding path program 1 times [2025-01-09 03:45:21,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:21,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871458810] [2025-01-09 03:45:21,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:21,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:21,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 03:45:21,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 03:45:21,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:21,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:21,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:21,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871458810] [2025-01-09 03:45:21,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871458810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:21,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:21,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:21,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854389226] [2025-01-09 03:45:21,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:21,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:21,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:21,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:21,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:21,352 INFO L87 Difference]: Start difference. First operand 505 states and 828 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:21,390 INFO L93 Difference]: Finished difference Result 979 states and 1624 transitions. [2025-01-09 03:45:21,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:21,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2025-01-09 03:45:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:21,397 INFO L225 Difference]: With dead ends: 979 [2025-01-09 03:45:21,397 INFO L226 Difference]: Without dead ends: 505 [2025-01-09 03:45:21,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:21,401 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 9 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2457 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:21,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2457 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-01-09 03:45:21,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-01-09 03:45:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 396 states have (on average 1.6565656565656566) internal successors, (656), 415 states have internal predecessors, (656), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:45:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 827 transitions. [2025-01-09 03:45:21,424 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 827 transitions. Word has length 86 [2025-01-09 03:45:21,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:21,424 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 827 transitions. [2025-01-09 03:45:21,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 827 transitions. [2025-01-09 03:45:21,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 03:45:21,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:21,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:21,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:45:21,429 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:21,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:21,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1994288741, now seen corresponding path program 1 times [2025-01-09 03:45:21,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:21,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807553077] [2025-01-09 03:45:21,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:21,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:21,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 03:45:21,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 03:45:21,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:21,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:21,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:21,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807553077] [2025-01-09 03:45:21,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807553077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:21,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:21,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:21,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376358591] [2025-01-09 03:45:21,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:21,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:21,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:21,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:21,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:21,552 INFO L87 Difference]: Start difference. First operand 505 states and 827 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:21,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:21,593 INFO L93 Difference]: Finished difference Result 973 states and 1612 transitions. [2025-01-09 03:45:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:45:21,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2025-01-09 03:45:21,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:21,601 INFO L225 Difference]: With dead ends: 973 [2025-01-09 03:45:21,601 INFO L226 Difference]: Without dead ends: 505 [2025-01-09 03:45:21,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:21,604 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 4 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:21,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2436 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-01-09 03:45:21,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-01-09 03:45:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 396 states have (on average 1.654040404040404) internal successors, (655), 415 states have internal predecessors, (655), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 03:45:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 826 transitions. [2025-01-09 03:45:21,626 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 826 transitions. Word has length 86 [2025-01-09 03:45:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:21,626 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 826 transitions. [2025-01-09 03:45:21,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 03:45:21,627 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 826 transitions. [2025-01-09 03:45:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 03:45:21,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:21,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:21,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:45:21,631 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:21,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:21,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2117467285, now seen corresponding path program 1 times [2025-01-09 03:45:21,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:21,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425387021] [2025-01-09 03:45:21,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:21,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:21,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 03:45:21,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 03:45:21,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:21,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:21,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:21,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425387021] [2025-01-09 03:45:21,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425387021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:21,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:21,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:45:21,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468438083] [2025-01-09 03:45:21,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:21,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:45:21,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:21,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:45:21,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:21,883 INFO L87 Difference]: Start difference. First operand 505 states and 826 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:45:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:23,753 INFO L93 Difference]: Finished difference Result 969 states and 1624 transitions. [2025-01-09 03:45:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:45:23,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2025-01-09 03:45:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:23,762 INFO L225 Difference]: With dead ends: 969 [2025-01-09 03:45:23,762 INFO L226 Difference]: Without dead ends: 509 [2025-01-09 03:45:23,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:45:23,766 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 1276 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 2564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:23,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1584 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 2564 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 03:45:23,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-01-09 03:45:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-01-09 03:45:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 399 states have (on average 1.6491228070175439) internal successors, (658), 418 states have internal predecessors, (658), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (99), 82 states have call predecessors, (99), 83 states have call successors, (99) [2025-01-09 03:45:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 845 transitions. [2025-01-09 03:45:23,801 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 845 transitions. Word has length 87 [2025-01-09 03:45:23,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:23,802 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 845 transitions. [2025-01-09 03:45:23,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 03:45:23,802 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 845 transitions. [2025-01-09 03:45:23,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 03:45:23,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:23,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:23,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:45:23,806 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:23,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:23,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1597880366, now seen corresponding path program 1 times [2025-01-09 03:45:23,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:23,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216973866] [2025-01-09 03:45:23,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:23,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:23,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 03:45:23,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 03:45:23,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:23,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:23,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:23,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216973866] [2025-01-09 03:45:23,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216973866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:23,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:23,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:23,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334890627] [2025-01-09 03:45:23,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:23,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:23,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:23,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:23,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:23,990 INFO L87 Difference]: Start difference. First operand 509 states and 845 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:45:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:27,513 INFO L93 Difference]: Finished difference Result 1823 states and 3125 transitions. [2025-01-09 03:45:27,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 03:45:27,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 88 [2025-01-09 03:45:27,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:27,525 INFO L225 Difference]: With dead ends: 1823 [2025-01-09 03:45:27,526 INFO L226 Difference]: Without dead ends: 1359 [2025-01-09 03:45:27,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-01-09 03:45:27,530 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 2307 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 4652 mSolverCounterSat, 576 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2376 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 5228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 576 IncrementalHoareTripleChecker+Valid, 4652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:27,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2376 Valid, 2580 Invalid, 5228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [576 Valid, 4652 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 03:45:27,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-01-09 03:45:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1302. [2025-01-09 03:45:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1018 states have (on average 1.6640471512770139) internal successors, (1694), 1066 states have internal predecessors, (1694), 229 states have call successors, (229), 54 states have call predecessors, (229), 54 states have return successors, (244), 218 states have call predecessors, (244), 224 states have call successors, (244) [2025-01-09 03:45:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 2167 transitions. [2025-01-09 03:45:27,618 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 2167 transitions. Word has length 88 [2025-01-09 03:45:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:27,618 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 2167 transitions. [2025-01-09 03:45:27,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:45:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 2167 transitions. [2025-01-09 03:45:27,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 03:45:27,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:27,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:27,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:45:27,621 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:27,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:27,622 INFO L85 PathProgramCache]: Analyzing trace with hash 745468090, now seen corresponding path program 1 times [2025-01-09 03:45:27,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:27,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571328227] [2025-01-09 03:45:27,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:27,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 03:45:27,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 03:45:27,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:27,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:27,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:27,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571328227] [2025-01-09 03:45:27,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571328227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:27,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:27,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:27,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281830858] [2025-01-09 03:45:27,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:27,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:27,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:27,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:27,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:27,890 INFO L87 Difference]: Start difference. First operand 1302 states and 2167 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:45:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:31,794 INFO L93 Difference]: Finished difference Result 6140 states and 10552 transitions. [2025-01-09 03:45:31,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:45:31,794 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2025-01-09 03:45:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:31,841 INFO L225 Difference]: With dead ends: 6140 [2025-01-09 03:45:31,841 INFO L226 Difference]: Without dead ends: 4883 [2025-01-09 03:45:31,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:45:31,854 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 3071 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 5258 mSolverCounterSat, 804 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3202 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 6062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 804 IncrementalHoareTripleChecker+Valid, 5258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:31,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3202 Valid, 2849 Invalid, 6062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [804 Valid, 5258 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-09 03:45:31,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2025-01-09 03:45:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 4468. [2025-01-09 03:45:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4468 states, 3300 states have (on average 1.66) internal successors, (5478), 3523 states have internal predecessors, (5478), 1004 states have call successors, (1004), 146 states have call predecessors, (1004), 163 states have return successors, (1204), 983 states have call predecessors, (1204), 999 states have call successors, (1204) [2025-01-09 03:45:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4468 states to 4468 states and 7686 transitions. [2025-01-09 03:45:32,163 INFO L78 Accepts]: Start accepts. Automaton has 4468 states and 7686 transitions. Word has length 90 [2025-01-09 03:45:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:32,164 INFO L471 AbstractCegarLoop]: Abstraction has 4468 states and 7686 transitions. [2025-01-09 03:45:32,165 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:45:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4468 states and 7686 transitions. [2025-01-09 03:45:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 03:45:32,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:32,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:32,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:45:32,167 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:32,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:32,168 INFO L85 PathProgramCache]: Analyzing trace with hash -283891208, now seen corresponding path program 1 times [2025-01-09 03:45:32,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:32,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767131258] [2025-01-09 03:45:32,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:32,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:32,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 03:45:32,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 03:45:32,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:32,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:32,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:32,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767131258] [2025-01-09 03:45:32,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767131258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:32,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:32,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:32,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230622518] [2025-01-09 03:45:32,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:32,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:32,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:32,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:32,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:32,377 INFO L87 Difference]: Start difference. First operand 4468 states and 7686 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, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:45:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:35,033 INFO L93 Difference]: Finished difference Result 11887 states and 20569 transitions. [2025-01-09 03:45:35,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 03:45:35,034 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, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2025-01-09 03:45:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:35,107 INFO L225 Difference]: With dead ends: 11887 [2025-01-09 03:45:35,107 INFO L226 Difference]: Without dead ends: 8727 [2025-01-09 03:45:35,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:45:35,129 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 2341 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 3539 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2420 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 4022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 3539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:35,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2420 Valid, 1700 Invalid, 4022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 3539 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 03:45:35,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8727 states. [2025-01-09 03:45:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8727 to 8278. [2025-01-09 03:45:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8278 states, 6171 states have (on average 1.659536541889483) internal successors, (10241), 6572 states have internal predecessors, (10241), 1776 states have call successors, (1776), 269 states have call predecessors, (1776), 330 states have return successors, (2254), 1738 states have call predecessors, (2254), 1771 states have call successors, (2254) [2025-01-09 03:45:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8278 states to 8278 states and 14271 transitions. [2025-01-09 03:45:35,687 INFO L78 Accepts]: Start accepts. Automaton has 8278 states and 14271 transitions. Word has length 90 [2025-01-09 03:45:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:35,688 INFO L471 AbstractCegarLoop]: Abstraction has 8278 states and 14271 transitions. [2025-01-09 03:45:35,688 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, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 03:45:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 8278 states and 14271 transitions. [2025-01-09 03:45:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 03:45:35,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:35,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:35,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:45:35,691 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:35,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:35,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1448598911, now seen corresponding path program 1 times [2025-01-09 03:45:35,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:35,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742094971] [2025-01-09 03:45:35,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:35,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:35,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 03:45:35,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 03:45:35,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:35,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:35,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:35,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742094971] [2025-01-09 03:45:35,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742094971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:35,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:35,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:45:35,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939039277] [2025-01-09 03:45:35,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:35,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:45:35,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:35,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:45:35,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:45:35,831 INFO L87 Difference]: Start difference. First operand 8278 states and 14271 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:45:36,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:36,383 INFO L93 Difference]: Finished difference Result 15170 states and 26213 transitions. [2025-01-09 03:45:36,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:45:36,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2025-01-09 03:45:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:36,464 INFO L225 Difference]: With dead ends: 15170 [2025-01-09 03:45:36,464 INFO L226 Difference]: Without dead ends: 8365 [2025-01-09 03:45:36,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:45:36,498 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 0 mSDsluCounter, 2442 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3266 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:36,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3266 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:45:36,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8365 states. [2025-01-09 03:45:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8365 to 8351. [2025-01-09 03:45:37,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8351 states, 6227 states have (on average 1.6531234944596114) internal successors, (10294), 6627 states have internal predecessors, (10294), 1773 states have call successors, (1773), 269 states have call predecessors, (1773), 350 states have return successors, (2317), 1756 states have call predecessors, (2317), 1768 states have call successors, (2317) [2025-01-09 03:45:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8351 states to 8351 states and 14384 transitions. [2025-01-09 03:45:37,126 INFO L78 Accepts]: Start accepts. Automaton has 8351 states and 14384 transitions. Word has length 95 [2025-01-09 03:45:37,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:37,126 INFO L471 AbstractCegarLoop]: Abstraction has 8351 states and 14384 transitions. [2025-01-09 03:45:37,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:45:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand 8351 states and 14384 transitions. [2025-01-09 03:45:37,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:45:37,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:37,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:37,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:45:37,131 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:37,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash -304422412, now seen corresponding path program 1 times [2025-01-09 03:45:37,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:37,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406911581] [2025-01-09 03:45:37,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:37,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:37,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:45:37,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:45:37,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:37,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:45:37,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:37,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406911581] [2025-01-09 03:45:37,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406911581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:37,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:37,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:45:37,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455242345] [2025-01-09 03:45:37,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:37,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:45:37,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:37,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:45:37,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:45:37,354 INFO L87 Difference]: Start difference. First operand 8351 states and 14384 transitions. Second operand has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:45:37,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:37,981 INFO L93 Difference]: Finished difference Result 16396 states and 28686 transitions. [2025-01-09 03:45:37,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:45:37,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 102 [2025-01-09 03:45:37,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:38,054 INFO L225 Difference]: With dead ends: 16396 [2025-01-09 03:45:38,054 INFO L226 Difference]: Without dead ends: 8499 [2025-01-09 03:45:38,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:45:38,092 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 235 mSDsluCounter, 5788 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 6657 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-01-09 03:45:38,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 6657 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:45:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8499 states. [2025-01-09 03:45:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8499 to 8375. [2025-01-09 03:45:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8375 states, 6248 states have (on average 1.6317221510883482) internal successors, (10195), 6651 states have internal predecessors, (10195), 1773 states have call successors, (1773), 269 states have call predecessors, (1773), 353 states have return successors, (2329), 1756 states have call predecessors, (2329), 1768 states have call successors, (2329) [2025-01-09 03:45:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8375 states to 8375 states and 14297 transitions. [2025-01-09 03:45:38,728 INFO L78 Accepts]: Start accepts. Automaton has 8375 states and 14297 transitions. Word has length 102 [2025-01-09 03:45:38,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:38,729 INFO L471 AbstractCegarLoop]: Abstraction has 8375 states and 14297 transitions. [2025-01-09 03:45:38,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:45:38,729 INFO L276 IsEmpty]: Start isEmpty. Operand 8375 states and 14297 transitions. [2025-01-09 03:45:38,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:45:38,732 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:38,732 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:38,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:45:38,732 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:38,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:38,733 INFO L85 PathProgramCache]: Analyzing trace with hash 100010084, now seen corresponding path program 1 times [2025-01-09 03:45:38,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:38,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793922420] [2025-01-09 03:45:38,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:38,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:38,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:45:38,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:45:38,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:38,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:45:38,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:38,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793922420] [2025-01-09 03:45:38,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793922420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:38,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:38,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:45:38,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512393716] [2025-01-09 03:45:38,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:38,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:45:38,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:38,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:45:38,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:45:38,897 INFO L87 Difference]: Start difference. First operand 8375 states and 14297 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:45:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:41,466 INFO L93 Difference]: Finished difference Result 16031 states and 27400 transitions. [2025-01-09 03:45:41,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:45:41,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 107 [2025-01-09 03:45:41,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:41,560 INFO L225 Difference]: With dead ends: 16031 [2025-01-09 03:45:41,560 INFO L226 Difference]: Without dead ends: 9145 [2025-01-09 03:45:41,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-01-09 03:45:41,608 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 2063 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 3042 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2139 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 3498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 3042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:41,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2139 Valid, 1638 Invalid, 3498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 3042 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 03:45:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9145 states. [2025-01-09 03:45:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9145 to 8610. [2025-01-09 03:45:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8610 states, 6423 states have (on average 1.6213607348591002) internal successors, (10414), 6844 states have internal predecessors, (10414), 1793 states have call successors, (1793), 294 states have call predecessors, (1793), 393 states have return successors, (2421), 1774 states have call predecessors, (2421), 1788 states have call successors, (2421) [2025-01-09 03:45:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8610 states to 8610 states and 14628 transitions. [2025-01-09 03:45:42,345 INFO L78 Accepts]: Start accepts. Automaton has 8610 states and 14628 transitions. Word has length 107 [2025-01-09 03:45:42,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:42,345 INFO L471 AbstractCegarLoop]: Abstraction has 8610 states and 14628 transitions. [2025-01-09 03:45:42,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:45:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 8610 states and 14628 transitions. [2025-01-09 03:45:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:45:42,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:42,350 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] [2025-01-09 03:45:42,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:45:42,350 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:42,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:42,351 INFO L85 PathProgramCache]: Analyzing trace with hash 149930745, now seen corresponding path program 1 times [2025-01-09 03:45:42,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:42,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343560454] [2025-01-09 03:45:42,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:42,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:42,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:45:42,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:45:42,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:42,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:45:42,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:42,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343560454] [2025-01-09 03:45:42,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343560454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:42,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:42,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:45:42,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662840194] [2025-01-09 03:45:42,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:42,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:45:42,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:42,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:45:42,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:42,537 INFO L87 Difference]: Start difference. First operand 8610 states and 14628 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:45:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:43,160 INFO L93 Difference]: Finished difference Result 19280 states and 32904 transitions. [2025-01-09 03:45:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:45:43,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-01-09 03:45:43,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:43,276 INFO L225 Difference]: With dead ends: 19280 [2025-01-09 03:45:43,276 INFO L226 Difference]: Without dead ends: 12159 [2025-01-09 03:45:43,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:45:43,320 INFO L435 NwaCegarLoop]: 1331 mSDtfsCounter, 775 mSDsluCounter, 7399 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 8730 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:43,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 8730 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:45:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12159 states. [2025-01-09 03:45:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12159 to 11485. [2025-01-09 03:45:43,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11485 states, 8577 states have (on average 1.6309898565932144) internal successors, (13989), 9125 states have internal predecessors, (13989), 2408 states have call successors, (2408), 381 states have call predecessors, (2408), 499 states have return successors, (3193), 2398 states have call predecessors, (3193), 2403 states have call successors, (3193) [2025-01-09 03:45:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11485 states to 11485 states and 19590 transitions. [2025-01-09 03:45:43,999 INFO L78 Accepts]: Start accepts. Automaton has 11485 states and 19590 transitions. Word has length 112 [2025-01-09 03:45:44,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:44,000 INFO L471 AbstractCegarLoop]: Abstraction has 11485 states and 19590 transitions. [2025-01-09 03:45:44,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:45:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 11485 states and 19590 transitions. [2025-01-09 03:45:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:45:44,004 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:44,004 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:44,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:45:44,004 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:44,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:44,005 INFO L85 PathProgramCache]: Analyzing trace with hash 846627495, now seen corresponding path program 1 times [2025-01-09 03:45:44,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:44,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416404159] [2025-01-09 03:45:44,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:44,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:44,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:45:44,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:45:44,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:44,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:45:44,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:44,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416404159] [2025-01-09 03:45:44,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416404159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:44,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:44,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 03:45:44,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980424078] [2025-01-09 03:45:44,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:44,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:45:44,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:44,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:45:44,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:45:44,308 INFO L87 Difference]: Start difference. First operand 11485 states and 19590 transitions. Second operand has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 03:45:48,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:48,399 INFO L93 Difference]: Finished difference Result 24649 states and 41728 transitions. [2025-01-09 03:45:48,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 03:45:48,399 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 114 [2025-01-09 03:45:48,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:48,517 INFO L225 Difference]: With dead ends: 24649 [2025-01-09 03:45:48,517 INFO L226 Difference]: Without dead ends: 14472 [2025-01-09 03:45:48,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2025-01-09 03:45:48,571 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 2795 mSDsluCounter, 4284 mSDsCounter, 0 mSdLazyCounter, 8394 mSolverCounterSat, 629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2880 SdHoareTripleChecker+Valid, 4795 SdHoareTripleChecker+Invalid, 9023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 629 IncrementalHoareTripleChecker+Valid, 8394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:48,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2880 Valid, 4795 Invalid, 9023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [629 Valid, 8394 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 03:45:48,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14472 states. [2025-01-09 03:45:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14472 to 13247. [2025-01-09 03:45:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13247 states, 9969 states have (on average 1.6127996790049153) internal successors, (16078), 10582 states have internal predecessors, (16078), 2641 states have call successors, (2641), 470 states have call predecessors, (2641), 636 states have return successors, (3534), 2607 states have call predecessors, (3534), 2636 states have call successors, (3534) [2025-01-09 03:45:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13247 states to 13247 states and 22253 transitions. [2025-01-09 03:45:49,651 INFO L78 Accepts]: Start accepts. Automaton has 13247 states and 22253 transitions. Word has length 114 [2025-01-09 03:45:49,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:49,652 INFO L471 AbstractCegarLoop]: Abstraction has 13247 states and 22253 transitions. [2025-01-09 03:45:49,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 03:45:49,653 INFO L276 IsEmpty]: Start isEmpty. Operand 13247 states and 22253 transitions. [2025-01-09 03:45:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:45:49,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:49,657 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] [2025-01-09 03:45:49,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 03:45:49,658 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:49,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash 368785463, now seen corresponding path program 1 times [2025-01-09 03:45:49,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:49,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122917397] [2025-01-09 03:45:49,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:49,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:49,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:45:49,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:45:49,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:49,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:49,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-01-09 03:45:49,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:49,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122917397] [2025-01-09 03:45:49,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122917397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:49,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:49,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:45:49,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501021704] [2025-01-09 03:45:49,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:49,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:45:49,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:49,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:45:49,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:45:49,825 INFO L87 Difference]: Start difference. First operand 13247 states and 22253 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:45:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:50,724 INFO L93 Difference]: Finished difference Result 13375 states and 22480 transitions. [2025-01-09 03:45:50,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:45:50,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-01-09 03:45:50,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:50,821 INFO L225 Difference]: With dead ends: 13375 [2025-01-09 03:45:50,821 INFO L226 Difference]: Without dead ends: 13360 [2025-01-09 03:45:50,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:50,830 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 886 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 2291 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:50,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 2291 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:45:50,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13360 states. [2025-01-09 03:45:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13360 to 13255. [2025-01-09 03:45:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13255 states, 9977 states have (on average 1.6123083091109551) internal successors, (16086), 10590 states have internal predecessors, (16086), 2641 states have call successors, (2641), 470 states have call predecessors, (2641), 636 states have return successors, (3534), 2607 states have call predecessors, (3534), 2636 states have call successors, (3534) [2025-01-09 03:45:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13255 states to 13255 states and 22261 transitions. [2025-01-09 03:45:51,372 INFO L78 Accepts]: Start accepts. Automaton has 13255 states and 22261 transitions. Word has length 112 [2025-01-09 03:45:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:51,372 INFO L471 AbstractCegarLoop]: Abstraction has 13255 states and 22261 transitions. [2025-01-09 03:45:51,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:45:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 13255 states and 22261 transitions. [2025-01-09 03:45:51,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:45:51,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:51,375 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] [2025-01-09 03:45:51,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 03:45:51,376 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:51,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:51,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1165513309, now seen corresponding path program 1 times [2025-01-09 03:45:51,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:51,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481502410] [2025-01-09 03:45:51,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:51,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:51,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:45:51,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:45:51,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:51,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 03:45:51,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:51,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481502410] [2025-01-09 03:45:51,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481502410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:51,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:51,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 03:45:51,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567220045] [2025-01-09 03:45:51,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:51,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:45:51,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:51,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:45:51,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:45:51,602 INFO L87 Difference]: Start difference. First operand 13255 states and 22261 transitions. Second operand has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:45:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:52,139 INFO L93 Difference]: Finished difference Result 13270 states and 22279 transitions. [2025-01-09 03:45:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:45:52,139 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2025-01-09 03:45:52,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:52,226 INFO L225 Difference]: With dead ends: 13270 [2025-01-09 03:45:52,226 INFO L226 Difference]: Without dead ends: 13255 [2025-01-09 03:45:52,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:45:52,244 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 17 mSDsluCounter, 6422 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 7229 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:52,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 7229 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:45:52,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13255 states. [2025-01-09 03:45:52,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13255 to 13255. [2025-01-09 03:45:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13255 states, 9977 states have (on average 1.6115064648691992) internal successors, (16078), 10590 states have internal predecessors, (16078), 2641 states have call successors, (2641), 470 states have call predecessors, (2641), 636 states have return successors, (3534), 2607 states have call predecessors, (3534), 2636 states have call successors, (3534) [2025-01-09 03:45:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13255 states to 13255 states and 22253 transitions. [2025-01-09 03:45:52,929 INFO L78 Accepts]: Start accepts. Automaton has 13255 states and 22253 transitions. Word has length 120 [2025-01-09 03:45:52,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:52,929 INFO L471 AbstractCegarLoop]: Abstraction has 13255 states and 22253 transitions. [2025-01-09 03:45:52,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:45:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand 13255 states and 22253 transitions. [2025-01-09 03:45:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:45:52,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:52,932 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:52,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 03:45:52,933 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:52,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:52,933 INFO L85 PathProgramCache]: Analyzing trace with hash 372884811, now seen corresponding path program 1 times [2025-01-09 03:45:52,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:52,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689013109] [2025-01-09 03:45:52,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:52,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:52,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:45:52,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:45:52,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:52,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 03:45:53,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:53,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689013109] [2025-01-09 03:45:53,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689013109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:53,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:53,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:45:53,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958659211] [2025-01-09 03:45:53,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:53,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:45:53,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:53,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:45:53,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:45:53,226 INFO L87 Difference]: Start difference. First operand 13255 states and 22253 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:45:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:54,907 INFO L93 Difference]: Finished difference Result 26519 states and 44681 transitions. [2025-01-09 03:45:54,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:45:54,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 131 [2025-01-09 03:45:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:54,988 INFO L225 Difference]: With dead ends: 26519 [2025-01-09 03:45:54,988 INFO L226 Difference]: Without dead ends: 13321 [2025-01-09 03:45:55,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:45:55,035 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 1220 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:55,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 1575 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 2571 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 03:45:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13321 states. [2025-01-09 03:45:55,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13321 to 13255. [2025-01-09 03:45:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13255 states, 9977 states have (on average 1.6107046206274431) internal successors, (16070), 10590 states have internal predecessors, (16070), 2641 states have call successors, (2641), 470 states have call predecessors, (2641), 636 states have return successors, (3534), 2607 states have call predecessors, (3534), 2636 states have call successors, (3534) [2025-01-09 03:45:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13255 states to 13255 states and 22245 transitions. [2025-01-09 03:45:55,990 INFO L78 Accepts]: Start accepts. Automaton has 13255 states and 22245 transitions. Word has length 131 [2025-01-09 03:45:55,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:45:55,991 INFO L471 AbstractCegarLoop]: Abstraction has 13255 states and 22245 transitions. [2025-01-09 03:45:55,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:45:55,991 INFO L276 IsEmpty]: Start isEmpty. Operand 13255 states and 22245 transitions. [2025-01-09 03:45:55,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 03:45:55,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:45:55,995 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:45:55,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 03:45:55,996 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:45:55,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:45:55,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2031609397, now seen corresponding path program 1 times [2025-01-09 03:45:55,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:45:55,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683193902] [2025-01-09 03:45:55,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:45:55,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:45:56,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 03:45:56,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 03:45:56,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:45:56,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:45:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:45:56,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:45:56,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683193902] [2025-01-09 03:45:56,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683193902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:45:56,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:45:56,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:45:56,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417223027] [2025-01-09 03:45:56,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:45:56,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:45:56,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:45:56,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:45:56,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:45:56,155 INFO L87 Difference]: Start difference. First operand 13255 states and 22245 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:45:58,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:45:58,775 INFO L93 Difference]: Finished difference Result 43688 states and 75588 transitions. [2025-01-09 03:45:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:45:58,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 138 [2025-01-09 03:45:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:45:58,990 INFO L225 Difference]: With dead ends: 43688 [2025-01-09 03:45:58,990 INFO L226 Difference]: Without dead ends: 30478 [2025-01-09 03:45:59,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:45:59,052 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 1833 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1905 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:45:59,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1905 Valid, 911 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 03:45:59,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30478 states. [2025-01-09 03:46:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30478 to 29557. [2025-01-09 03:46:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29557 states, 21670 states have (on average 1.6035071527457314) internal successors, (34748), 23152 states have internal predecessors, (34748), 6549 states have call successors, (6549), 935 states have call predecessors, (6549), 1337 states have return successors, (10140), 6510 states have call predecessors, (10140), 6544 states have call successors, (10140) [2025-01-09 03:46:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29557 states to 29557 states and 51437 transitions. [2025-01-09 03:46:00,541 INFO L78 Accepts]: Start accepts. Automaton has 29557 states and 51437 transitions. Word has length 138 [2025-01-09 03:46:00,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:00,542 INFO L471 AbstractCegarLoop]: Abstraction has 29557 states and 51437 transitions. [2025-01-09 03:46:00,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:00,542 INFO L276 IsEmpty]: Start isEmpty. Operand 29557 states and 51437 transitions. [2025-01-09 03:46:00,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 03:46:00,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:00,545 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:00,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 03:46:00,546 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:00,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:00,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1444494555, now seen corresponding path program 1 times [2025-01-09 03:46:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180562455] [2025-01-09 03:46:00,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:00,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 03:46:00,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 03:46:00,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:00,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:00,660 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:46:00,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:00,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180562455] [2025-01-09 03:46:00,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180562455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:00,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:00,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:00,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720584597] [2025-01-09 03:46:00,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:00,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:00,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:00,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:00,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:00,663 INFO L87 Difference]: Start difference. First operand 29557 states and 51437 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:46:06,213 INFO L93 Difference]: Finished difference Result 99314 states and 180387 transitions. [2025-01-09 03:46:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:46:06,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 139 [2025-01-09 03:46:06,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:46:06,896 INFO L225 Difference]: With dead ends: 99314 [2025-01-09 03:46:06,896 INFO L226 Difference]: Without dead ends: 69802 [2025-01-09 03:46:07,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:46:07,015 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1837 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:46:07,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 884 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 03:46:07,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69802 states. [2025-01-09 03:46:10,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69802 to 67768. [2025-01-09 03:46:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67768 states, 48247 states have (on average 1.5945447385329659) internal successors, (76932), 51891 states have internal predecessors, (76932), 16696 states have call successors, (16696), 1865 states have call predecessors, (16696), 2824 states have return successors, (30392), 16695 states have call predecessors, (30392), 16691 states have call successors, (30392) [2025-01-09 03:46:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67768 states to 67768 states and 124020 transitions. [2025-01-09 03:46:11,698 INFO L78 Accepts]: Start accepts. Automaton has 67768 states and 124020 transitions. Word has length 139 [2025-01-09 03:46:11,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:46:11,698 INFO L471 AbstractCegarLoop]: Abstraction has 67768 states and 124020 transitions. [2025-01-09 03:46:11,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:46:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand 67768 states and 124020 transitions. [2025-01-09 03:46:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 03:46:11,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:46:11,704 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:46:11,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 03:46:11,704 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:46:11,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:46:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1829538573, now seen corresponding path program 1 times [2025-01-09 03:46:11,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:46:11,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827471900] [2025-01-09 03:46:11,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:46:11,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:46:11,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 03:46:11,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 03:46:11,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:46:11,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:46:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:46:11,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:46:11,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827471900] [2025-01-09 03:46:11,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827471900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:46:11,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:46:11,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:46:11,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773503432] [2025-01-09 03:46:11,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:46:11,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:46:11,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:46:11,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:46:11,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:46:11,828 INFO L87 Difference]: Start difference. First operand 67768 states and 124020 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14)