./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b02d53de4cc8dbaebc187e8fa236234211af4eca5416c7869304d04f0d61a0bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:34:39,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:34:39,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:34:39,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:34:39,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:34:39,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:34:39,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:34:39,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:34:39,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:34:39,682 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:34:39,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:34:39,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:34:39,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:34:39,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:34:39,682 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:34:39,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:34:39,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:34:39,682 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:34:39,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:34:39,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:34:39,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:34:39,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:34:39,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:34:39,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:34:39,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:34:39,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:34:39,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:34:39,684 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b02d53de4cc8dbaebc187e8fa236234211af4eca5416c7869304d04f0d61a0bd [2025-03-16 18:34:39,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:34:39,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:34:39,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:34:39,915 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:34:39,915 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:34:39,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c [2025-03-16 18:34:41,097 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf6cf310/24a4076f3fba4114890a26fe7a3bed32/FLAGf3f38370d [2025-03-16 18:34:41,428 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:34:41,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c [2025-03-16 18:34:41,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf6cf310/24a4076f3fba4114890a26fe7a3bed32/FLAGf3f38370d [2025-03-16 18:34:41,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adf6cf310/24a4076f3fba4114890a26fe7a3bed32 [2025-03-16 18:34:41,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:34:41,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:34:41,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:34:41,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:34:41,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:34:41,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:34:41" (1/1) ... [2025-03-16 18:34:41,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e29496e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:41, skipping insertion in model container [2025-03-16 18:34:41,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:34:41" (1/1) ... [2025-03-16 18:34:41,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:34:42,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c[40071,40084] [2025-03-16 18:34:42,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:34:42,110 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:34:42,116 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-03-16 18:34:42,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [86] [2025-03-16 18:34:42,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [452] [2025-03-16 18:34:42,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1120] [2025-03-16 18:34:42,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1220] [2025-03-16 18:34:42,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1574] [2025-03-16 18:34:42,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1586] [2025-03-16 18:34:42,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [1706] [2025-03-16 18:34:42,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1890] [2025-03-16 18:34:42,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1899] [2025-03-16 18:34:42,178 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c[40071,40084] [2025-03-16 18:34:42,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:34:42,242 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:34:42,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:42 WrapperNode [2025-03-16 18:34:42,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:34:42,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:34:42,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:34:42,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:34:42,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:42" (1/1) ... [2025-03-16 18:34:42,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:42" (1/1) ... [2025-03-16 18:34:42,309 INFO L138 Inliner]: procedures = 92, calls = 339, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 857 [2025-03-16 18:34:42,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:34:42,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:34:42,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:34:42,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:34:42,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:42" (1/1) ... [2025-03-16 18:34:42,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:42" (1/1) ... [2025-03-16 18:34:42,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:42" (1/1) ... [2025-03-16 18:34:42,354 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-16 18:34:42,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:42" (1/1) ... [2025-03-16 18:34:42,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:42" (1/1) ... [2025-03-16 18:34:42,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:42" (1/1) ... [2025-03-16 18:34:42,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:42" (1/1) ... [2025-03-16 18:34:42,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:42" (1/1) ... [2025-03-16 18:34:42,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:42" (1/1) ... [2025-03-16 18:34:42,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:34:42,402 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:34:42,402 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:34:42,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:34:42,403 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:42" (1/1) ... [2025-03-16 18:34:42,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:34:42,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:34:42,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 18:34:42,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 18:34:42,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:34:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-16 18:34:42,456 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-16 18:34:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-16 18:34:42,456 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-16 18:34:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-16 18:34:42,456 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-16 18:34:42,456 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-16 18:34:42,457 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-16 18:34:42,457 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-16 18:34:42,457 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-16 18:34:42,457 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-16 18:34:42,457 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-16 18:34:42,458 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-16 18:34:42,458 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-16 18:34:42,458 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-16 18:34:42,458 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-16 18:34:42,459 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-16 18:34:42,459 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-16 18:34:42,460 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-16 18:34:42,460 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-16 18:34:42,460 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-16 18:34:42,460 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-16 18:34:42,460 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-16 18:34:42,460 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-16 18:34:42,460 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-16 18:34:42,460 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-16 18:34:42,460 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-16 18:34:42,460 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-16 18:34:42,460 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-16 18:34:42,460 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-16 18:34:42,461 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-16 18:34:42,461 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-16 18:34:42,461 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-16 18:34:42,461 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-16 18:34:42,461 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-16 18:34:42,461 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-16 18:34:42,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:34:42,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 18:34:42,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 18:34:42,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 18:34:42,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 18:34:42,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 18:34:42,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 18:34:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 18:34:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 18:34:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 18:34:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 18:34:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 18:34:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 18:34:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 18:34:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 18:34:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 18:34:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-16 18:34:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-16 18:34:42,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-16 18:34:42,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-16 18:34:42,464 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-16 18:34:42,464 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-16 18:34:42,464 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-16 18:34:42,464 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-16 18:34:42,464 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-16 18:34:42,464 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-16 18:34:42,464 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-16 18:34:42,464 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-16 18:34:42,464 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2025-03-16 18:34:42,466 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2025-03-16 18:34:42,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:34:42,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:34:42,467 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-16 18:34:42,467 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-16 18:34:42,626 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:34:42,629 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:34:42,693 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1703: #res := ~retValue_acc~12; [2025-03-16 18:34:42,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1625: #res := ~retValue_acc~10; [2025-03-16 18:34:42,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1971: #res := ~retValue_acc~13; [2025-03-16 18:34:42,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2128: #res := ~retValue_acc~14; [2025-03-16 18:34:42,917 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~23#1; [2025-03-16 18:34:42,917 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2704: #res#1 := ~retValue_acc~22#1; [2025-03-16 18:34:42,973 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2836: #res := ~retValue_acc~26; [2025-03-16 18:34:42,983 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1664: #res := ~retValue_acc~11; [2025-03-16 18:34:43,000 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2171: #res := ~retValue_acc~16; [2025-03-16 18:34:43,071 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2300-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~19#1; [2025-03-16 18:34:43,071 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2313-1: isIdle_#res#1 := isIdle_~retValue_acc~20#1; [2025-03-16 18:34:43,198 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2794-1: stopRequestedAtCurrentFloor__wrappee__weight_#res#1 := stopRequestedAtCurrentFloor__wrappee__weight_~retValue_acc~24#1; [2025-03-16 18:34:43,199 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2822-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~25#1; [2025-03-16 18:34:43,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L806: #res := ~retValue_acc~6; [2025-03-16 18:34:43,371 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2665: #res := ~retValue_acc~21; [2025-03-16 18:34:43,435 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-16 18:34:43,435 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1571-1: main_#res#1 := main_~retValue_acc~9#1; [2025-03-16 18:34:43,445 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L570: #res := ~retValue_acc~5; [2025-03-16 18:34:43,447 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2137: #res := ~retValue_acc~15; [2025-03-16 18:34:43,451 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1117: #res := ~retValue_acc~7; [2025-03-16 18:34:43,579 INFO L? ?]: Removed 448 outVars from TransFormulas that were not future-live. [2025-03-16 18:34:43,579 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:34:43,599 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:34:43,599 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:34:43,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:34:43 BoogieIcfgContainer [2025-03-16 18:34:43,600 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:34:43,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:34:43,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:34:43,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:34:43,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:34:41" (1/3) ... [2025-03-16 18:34:43,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf25b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:34:43, skipping insertion in model container [2025-03-16 18:34:43,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:42" (2/3) ... [2025-03-16 18:34:43,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf25b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:34:43, skipping insertion in model container [2025-03-16 18:34:43,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:34:43" (3/3) ... [2025-03-16 18:34:43,608 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product21.cil.c [2025-03-16 18:34:43,619 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:34:43,622 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product21.cil.c that has 25 procedures, 555 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 18:34:43,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:34:43,684 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;@49fd6ef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:34:43,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:34:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 555 states, 434 states have (on average 1.705069124423963) internal successors, (740), 455 states have internal predecessors, (740), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-16 18:34:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 18:34:43,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:43,704 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-03-16 18:34:43,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:43,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1175871871, now seen corresponding path program 1 times [2025-03-16 18:34:43,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:43,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721416467] [2025-03-16 18:34:43,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:43,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:43,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 18:34:43,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 18:34:43,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:43,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:34:44,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:44,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721416467] [2025-03-16 18:34:44,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721416467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:44,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:44,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:44,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471223328] [2025-03-16 18:34:44,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:44,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:44,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:44,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:44,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:44,199 INFO L87 Difference]: Start difference. First operand has 555 states, 434 states have (on average 1.705069124423963) internal successors, (740), 455 states have internal predecessors, (740), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) 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, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:44,317 INFO L93 Difference]: Finished difference Result 1095 states and 1840 transitions. [2025-03-16 18:34:44,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:44,319 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, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 83 [2025-03-16 18:34:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:44,333 INFO L225 Difference]: With dead ends: 1095 [2025-03-16 18:34:44,333 INFO L226 Difference]: Without dead ends: 548 [2025-03-16 18:34:44,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:44,340 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 5 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2726 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:44,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2726 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:44,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-16 18:34:44,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-16 18:34:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 429 states have (on average 1.7016317016317015) internal successors, (730), 448 states have internal predecessors, (730), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:34:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 915 transitions. [2025-03-16 18:34:44,421 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 915 transitions. Word has length 83 [2025-03-16 18:34:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:44,423 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 915 transitions. [2025-03-16 18:34:44,423 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, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:44,423 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 915 transitions. [2025-03-16 18:34:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 18:34:44,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:44,429 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-03-16 18:34:44,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:34:44,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:44,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:44,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1905608623, now seen corresponding path program 1 times [2025-03-16 18:34:44,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:44,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995604362] [2025-03-16 18:34:44,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:44,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:44,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 18:34:44,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 18:34:44,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:44,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:34:44,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:44,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995604362] [2025-03-16 18:34:44,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995604362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:44,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:44,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:44,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288386677] [2025-03-16 18:34:44,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:44,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:44,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:44,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:44,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:44,674 INFO L87 Difference]: Start difference. First operand 548 states and 915 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:44,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:44,744 INFO L93 Difference]: Finished difference Result 1083 states and 1812 transitions. [2025-03-16 18:34:44,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:44,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 85 [2025-03-16 18:34:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:44,751 INFO L225 Difference]: With dead ends: 1083 [2025-03-16 18:34:44,751 INFO L226 Difference]: Without dead ends: 548 [2025-03-16 18:34:44,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:44,754 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 4 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:44,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2708 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-16 18:34:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-16 18:34:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 429 states have (on average 1.6993006993006994) internal successors, (729), 448 states have internal predecessors, (729), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:34:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 914 transitions. [2025-03-16 18:34:44,782 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 914 transitions. Word has length 85 [2025-03-16 18:34:44,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:44,782 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 914 transitions. [2025-03-16 18:34:44,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:44,783 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 914 transitions. [2025-03-16 18:34:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 18:34:44,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:44,791 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-03-16 18:34:44,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:34:44,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:44,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:44,795 INFO L85 PathProgramCache]: Analyzing trace with hash 763770399, now seen corresponding path program 1 times [2025-03-16 18:34:44,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:44,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846329743] [2025-03-16 18:34:44,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:44,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:44,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 18:34:44,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 18:34:44,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:44,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:34:44,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:44,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846329743] [2025-03-16 18:34:44,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846329743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:44,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:44,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:44,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074818569] [2025-03-16 18:34:44,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:44,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:44,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:44,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:44,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:44,950 INFO L87 Difference]: Start difference. First operand 548 states and 914 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:45,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:45,010 INFO L93 Difference]: Finished difference Result 1083 states and 1811 transitions. [2025-03-16 18:34:45,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:45,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2025-03-16 18:34:45,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:45,015 INFO L225 Difference]: With dead ends: 1083 [2025-03-16 18:34:45,015 INFO L226 Difference]: Without dead ends: 548 [2025-03-16 18:34:45,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:45,021 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 3 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:45,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2708 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-16 18:34:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-16 18:34:45,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 429 states have (on average 1.696969696969697) internal successors, (728), 448 states have internal predecessors, (728), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:34:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 913 transitions. [2025-03-16 18:34:45,050 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 913 transitions. Word has length 86 [2025-03-16 18:34:45,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:45,050 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 913 transitions. [2025-03-16 18:34:45,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 913 transitions. [2025-03-16 18:34:45,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 18:34:45,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:45,054 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-03-16 18:34:45,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 18:34:45,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:45,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:45,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1098977038, now seen corresponding path program 1 times [2025-03-16 18:34:45,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:45,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123952320] [2025-03-16 18:34:45,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:45,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:45,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 18:34:45,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 18:34:45,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:45,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:34:45,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:45,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123952320] [2025-03-16 18:34:45,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123952320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:45,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:45,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:45,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473627948] [2025-03-16 18:34:45,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:45,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:45,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:45,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:45,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:45,224 INFO L87 Difference]: Start difference. First operand 548 states and 913 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:45,271 INFO L93 Difference]: Finished difference Result 1083 states and 1810 transitions. [2025-03-16 18:34:45,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:45,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 87 [2025-03-16 18:34:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:45,276 INFO L225 Difference]: With dead ends: 1083 [2025-03-16 18:34:45,276 INFO L226 Difference]: Without dead ends: 548 [2025-03-16 18:34:45,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:45,280 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 2 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:45,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2708 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:45,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-16 18:34:45,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-16 18:34:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 429 states have (on average 1.6946386946386947) internal successors, (727), 448 states have internal predecessors, (727), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:34:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 912 transitions. [2025-03-16 18:34:45,306 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 912 transitions. Word has length 87 [2025-03-16 18:34:45,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:45,306 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 912 transitions. [2025-03-16 18:34:45,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 912 transitions. [2025-03-16 18:34:45,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 18:34:45,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:45,309 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-03-16 18:34:45,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 18:34:45,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:45,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:45,311 INFO L85 PathProgramCache]: Analyzing trace with hash 459893698, now seen corresponding path program 1 times [2025-03-16 18:34:45,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:45,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961358581] [2025-03-16 18:34:45,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:45,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:45,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 18:34:45,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 18:34:45,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:45,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:34:45,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:45,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961358581] [2025-03-16 18:34:45,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961358581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:45,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:45,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:45,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308242472] [2025-03-16 18:34:45,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:45,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:45,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:45,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:45,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:45,468 INFO L87 Difference]: Start difference. First operand 548 states and 912 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:45,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:45,508 INFO L93 Difference]: Finished difference Result 1083 states and 1809 transitions. [2025-03-16 18:34:45,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:45,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2025-03-16 18:34:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:45,515 INFO L225 Difference]: With dead ends: 1083 [2025-03-16 18:34:45,515 INFO L226 Difference]: Without dead ends: 548 [2025-03-16 18:34:45,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:45,519 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 1 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:45,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2708 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:45,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-16 18:34:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-16 18:34:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 429 states have (on average 1.6923076923076923) internal successors, (726), 448 states have internal predecessors, (726), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:34:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 911 transitions. [2025-03-16 18:34:45,548 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 911 transitions. Word has length 88 [2025-03-16 18:34:45,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:45,548 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 911 transitions. [2025-03-16 18:34:45,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 911 transitions. [2025-03-16 18:34:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 18:34:45,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:45,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:45,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 18:34:45,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:45,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:45,555 INFO L85 PathProgramCache]: Analyzing trace with hash 714745397, now seen corresponding path program 1 times [2025-03-16 18:34:45,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:45,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914833790] [2025-03-16 18:34:45,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:45,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:45,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 18:34:45,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 18:34:45,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:45,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:34:45,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:45,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914833790] [2025-03-16 18:34:45,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914833790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:45,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:45,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 18:34:45,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567539904] [2025-03-16 18:34:45,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:45,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:34:45,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:45,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:34:45,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:34:45,811 INFO L87 Difference]: Start difference. First operand 548 states and 911 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:34:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:45,906 INFO L93 Difference]: Finished difference Result 1049 states and 1741 transitions. [2025-03-16 18:34:45,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:34:45,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2025-03-16 18:34:45,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:45,913 INFO L225 Difference]: With dead ends: 1049 [2025-03-16 18:34:45,913 INFO L226 Difference]: Without dead ends: 563 [2025-03-16 18:34:45,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:34:45,918 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 91 mSDsluCounter, 6210 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7109 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:45,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7109 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:34:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-16 18:34:45,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 561. [2025-03-16 18:34:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 439 states have (on average 1.6879271070615034) internal successors, (741), 460 states have internal predecessors, (741), 96 states have call successors, (96), 24 states have call predecessors, (96), 25 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2025-03-16 18:34:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 930 transitions. [2025-03-16 18:34:45,942 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 930 transitions. Word has length 89 [2025-03-16 18:34:45,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:45,943 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 930 transitions. [2025-03-16 18:34:45,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:34:45,945 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 930 transitions. [2025-03-16 18:34:45,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 18:34:45,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:45,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:45,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 18:34:45,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:45,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:45,949 INFO L85 PathProgramCache]: Analyzing trace with hash 728278198, now seen corresponding path program 1 times [2025-03-16 18:34:45,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:45,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116200951] [2025-03-16 18:34:45,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:45,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:45,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 18:34:45,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 18:34:45,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:45,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:46,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:34:46,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:46,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116200951] [2025-03-16 18:34:46,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116200951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:46,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:46,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:46,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313923342] [2025-03-16 18:34:46,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:46,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:46,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:46,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:46,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:46,031 INFO L87 Difference]: Start difference. First operand 561 states and 930 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:46,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:46,064 INFO L93 Difference]: Finished difference Result 1101 states and 1835 transitions. [2025-03-16 18:34:46,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:46,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 89 [2025-03-16 18:34:46,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:46,069 INFO L225 Difference]: With dead ends: 1101 [2025-03-16 18:34:46,069 INFO L226 Difference]: Without dead ends: 542 [2025-03-16 18:34:46,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:46,073 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 0 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:46,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2710 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:46,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-16 18:34:46,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-03-16 18:34:46,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 423 states have (on average 1.6832151300236406) internal successors, (712), 442 states have internal predecessors, (712), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:34:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 897 transitions. [2025-03-16 18:34:46,091 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 897 transitions. Word has length 89 [2025-03-16 18:34:46,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:46,091 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 897 transitions. [2025-03-16 18:34:46,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:46,092 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 897 transitions. [2025-03-16 18:34:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 18:34:46,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:46,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:46,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 18:34:46,095 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:46,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:46,095 INFO L85 PathProgramCache]: Analyzing trace with hash -855984704, now seen corresponding path program 1 times [2025-03-16 18:34:46,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:46,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139480877] [2025-03-16 18:34:46,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:46,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:46,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 18:34:46,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 18:34:46,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:46,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:34:46,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:46,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139480877] [2025-03-16 18:34:46,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139480877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:46,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:46,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:46,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103647180] [2025-03-16 18:34:46,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:46,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:46,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:46,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:46,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:46,222 INFO L87 Difference]: Start difference. First operand 542 states and 897 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:46,368 INFO L93 Difference]: Finished difference Result 1046 states and 1733 transitions. [2025-03-16 18:34:46,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:46,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 90 [2025-03-16 18:34:46,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:46,373 INFO L225 Difference]: With dead ends: 1046 [2025-03-16 18:34:46,374 INFO L226 Difference]: Without dead ends: 551 [2025-03-16 18:34:46,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:46,377 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 55 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:46,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4241 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:34:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-16 18:34:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 542. [2025-03-16 18:34:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 423 states have (on average 1.673758865248227) internal successors, (708), 442 states have internal predecessors, (708), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:34:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 893 transitions. [2025-03-16 18:34:46,400 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 893 transitions. Word has length 90 [2025-03-16 18:34:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:46,400 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 893 transitions. [2025-03-16 18:34:46,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 893 transitions. [2025-03-16 18:34:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 18:34:46,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:46,403 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] [2025-03-16 18:34:46,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 18:34:46,404 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:46,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1591623774, now seen corresponding path program 1 times [2025-03-16 18:34:46,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:46,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596478516] [2025-03-16 18:34:46,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:46,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:46,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 18:34:46,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 18:34:46,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:46,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:34:46,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:46,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596478516] [2025-03-16 18:34:46,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596478516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:46,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:46,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:46,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417033920] [2025-03-16 18:34:46,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:46,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:46,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:46,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:46,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:46,548 INFO L87 Difference]: Start difference. First operand 542 states and 893 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:46,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:46,700 INFO L93 Difference]: Finished difference Result 1046 states and 1729 transitions. [2025-03-16 18:34:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:46,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 91 [2025-03-16 18:34:46,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:46,705 INFO L225 Difference]: With dead ends: 1046 [2025-03-16 18:34:46,705 INFO L226 Difference]: Without dead ends: 551 [2025-03-16 18:34:46,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:46,708 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 54 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:46,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4241 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:34:46,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-16 18:34:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 542. [2025-03-16 18:34:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 423 states have (on average 1.6643026004728132) internal successors, (704), 442 states have internal predecessors, (704), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:34:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 889 transitions. [2025-03-16 18:34:46,729 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 889 transitions. Word has length 91 [2025-03-16 18:34:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:46,730 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 889 transitions. [2025-03-16 18:34:46,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 889 transitions. [2025-03-16 18:34:46,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 18:34:46,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:46,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:46,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 18:34:46,734 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:46,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:46,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2079654813, now seen corresponding path program 1 times [2025-03-16 18:34:46,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:46,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054882361] [2025-03-16 18:34:46,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:46,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:46,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 18:34:46,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 18:34:46,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:46,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:34:46,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:46,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054882361] [2025-03-16 18:34:46,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054882361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:46,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:46,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:46,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980460026] [2025-03-16 18:34:46,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:46,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:46,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:46,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:46,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:46,871 INFO L87 Difference]: Start difference. First operand 542 states and 889 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:47,013 INFO L93 Difference]: Finished difference Result 1046 states and 1725 transitions. [2025-03-16 18:34:47,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:47,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2025-03-16 18:34:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:47,018 INFO L225 Difference]: With dead ends: 1046 [2025-03-16 18:34:47,019 INFO L226 Difference]: Without dead ends: 551 [2025-03-16 18:34:47,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:47,021 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 53 mSDsluCounter, 3370 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4223 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:47,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4223 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:34:47,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-16 18:34:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 542. [2025-03-16 18:34:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 423 states have (on average 1.6548463356973995) internal successors, (700), 442 states have internal predecessors, (700), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:34:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 885 transitions. [2025-03-16 18:34:47,064 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 885 transitions. Word has length 92 [2025-03-16 18:34:47,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:47,064 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 885 transitions. [2025-03-16 18:34:47,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:47,064 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 885 transitions. [2025-03-16 18:34:47,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 18:34:47,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:47,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:47,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 18:34:47,067 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:47,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:47,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1987316174, now seen corresponding path program 1 times [2025-03-16 18:34:47,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:47,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122506232] [2025-03-16 18:34:47,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:47,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:47,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 18:34:47,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 18:34:47,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:47,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:34:47,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:47,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122506232] [2025-03-16 18:34:47,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122506232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:47,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:47,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:34:47,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143856314] [2025-03-16 18:34:47,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:47,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:34:47,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:47,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:34:47,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:47,192 INFO L87 Difference]: Start difference. First operand 542 states and 885 transitions. Second operand has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:34:47,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:47,246 INFO L93 Difference]: Finished difference Result 1037 states and 1707 transitions. [2025-03-16 18:34:47,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:34:47,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2025-03-16 18:34:47,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:47,250 INFO L225 Difference]: With dead ends: 1037 [2025-03-16 18:34:47,250 INFO L226 Difference]: Without dead ends: 521 [2025-03-16 18:34:47,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:34:47,253 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 84 mSDsluCounter, 4297 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5171 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:47,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5171 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-16 18:34:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2025-03-16 18:34:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 402 states have (on average 1.6567164179104477) internal successors, (666), 421 states have internal predecessors, (666), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:34:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 851 transitions. [2025-03-16 18:34:47,268 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 851 transitions. Word has length 92 [2025-03-16 18:34:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:47,268 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 851 transitions. [2025-03-16 18:34:47,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:34:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 851 transitions. [2025-03-16 18:34:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 18:34:47,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:47,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:47,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 18:34:47,271 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:47,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:47,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1950327387, now seen corresponding path program 1 times [2025-03-16 18:34:47,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:47,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800603399] [2025-03-16 18:34:47,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:47,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:47,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 18:34:47,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 18:34:47,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:47,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:47,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-03-16 18:34:47,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:47,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800603399] [2025-03-16 18:34:47,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800603399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:47,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:47,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:47,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363242693] [2025-03-16 18:34:47,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:47,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:47,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:47,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:47,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:47,376 INFO L87 Difference]: Start difference. First operand 521 states and 851 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:47,439 INFO L93 Difference]: Finished difference Result 1016 states and 1673 transitions. [2025-03-16 18:34:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:47,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2025-03-16 18:34:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:47,444 INFO L225 Difference]: With dead ends: 1016 [2025-03-16 18:34:47,444 INFO L226 Difference]: Without dead ends: 521 [2025-03-16 18:34:47,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:47,447 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 17 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4161 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:47,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4161 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:47,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-16 18:34:47,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2025-03-16 18:34:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 402 states have (on average 1.654228855721393) internal successors, (665), 421 states have internal predecessors, (665), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:34:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 850 transitions. [2025-03-16 18:34:47,465 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 850 transitions. Word has length 93 [2025-03-16 18:34:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:47,465 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 850 transitions. [2025-03-16 18:34:47,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 850 transitions. [2025-03-16 18:34:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 18:34:47,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:47,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:47,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 18:34:47,469 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:47,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:47,470 INFO L85 PathProgramCache]: Analyzing trace with hash -137243270, now seen corresponding path program 1 times [2025-03-16 18:34:47,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:47,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479041415] [2025-03-16 18:34:47,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:47,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:47,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 18:34:47,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 18:34:47,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:47,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:34:47,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:47,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479041415] [2025-03-16 18:34:47,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479041415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:47,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:47,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:47,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362631172] [2025-03-16 18:34:47,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:47,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:47,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:47,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:47,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:47,577 INFO L87 Difference]: Start difference. First operand 521 states and 850 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:47,640 INFO L93 Difference]: Finished difference Result 1016 states and 1672 transitions. [2025-03-16 18:34:47,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:47,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2025-03-16 18:34:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:47,646 INFO L225 Difference]: With dead ends: 1016 [2025-03-16 18:34:47,646 INFO L226 Difference]: Without dead ends: 521 [2025-03-16 18:34:47,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:47,671 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 16 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4161 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:47,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4161 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-16 18:34:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2025-03-16 18:34:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 402 states have (on average 1.6517412935323383) internal successors, (664), 421 states have internal predecessors, (664), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:34:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 849 transitions. [2025-03-16 18:34:47,688 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 849 transitions. Word has length 94 [2025-03-16 18:34:47,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:47,688 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 849 transitions. [2025-03-16 18:34:47,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:34:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 849 transitions. [2025-03-16 18:34:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 18:34:47,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:47,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-03-16 18:34:47,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 18:34:47,691 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:47,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:47,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1494155352, now seen corresponding path program 1 times [2025-03-16 18:34:47,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:47,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251097612] [2025-03-16 18:34:47,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:47,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:47,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 18:34:47,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 18:34:47,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:47,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:34:47,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:47,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251097612] [2025-03-16 18:34:47,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251097612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:47,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:47,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 18:34:47,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401015941] [2025-03-16 18:34:47,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:47,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 18:34:47,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:47,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 18:34:47,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:34:47,923 INFO L87 Difference]: Start difference. First operand 521 states and 849 transitions. Second operand has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:34:48,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:48,013 INFO L93 Difference]: Finished difference Result 1010 states and 1660 transitions. [2025-03-16 18:34:48,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:34:48,014 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 95 [2025-03-16 18:34:48,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:48,018 INFO L225 Difference]: With dead ends: 1010 [2025-03-16 18:34:48,018 INFO L226 Difference]: Without dead ends: 521 [2025-03-16 18:34:48,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:34:48,022 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 6 mSDsluCounter, 6642 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7475 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:48,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7475 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:34:48,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-16 18:34:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2025-03-16 18:34:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 402 states have (on average 1.6492537313432836) internal successors, (663), 421 states have internal predecessors, (663), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-16 18:34:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 848 transitions. [2025-03-16 18:34:48,040 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 848 transitions. Word has length 95 [2025-03-16 18:34:48,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:48,040 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 848 transitions. [2025-03-16 18:34:48,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:34:48,040 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 848 transitions. [2025-03-16 18:34:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 18:34:48,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:48,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:48,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 18:34:48,043 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:48,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:48,044 INFO L85 PathProgramCache]: Analyzing trace with hash 558479655, now seen corresponding path program 1 times [2025-03-16 18:34:48,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:48,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751957304] [2025-03-16 18:34:48,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:48,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:48,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 18:34:48,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 18:34:48,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:48,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:34:48,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:48,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751957304] [2025-03-16 18:34:48,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751957304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:48,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:48,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:34:48,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402263729] [2025-03-16 18:34:48,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:48,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:34:48,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:48,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:34:48,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:34:48,236 INFO L87 Difference]: Start difference. First operand 521 states and 848 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-16 18:34:49,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:49,783 INFO L93 Difference]: Finished difference Result 1006 states and 1672 transitions. [2025-03-16 18:34:49,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:34:49,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 96 [2025-03-16 18:34:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:49,788 INFO L225 Difference]: With dead ends: 1006 [2025-03-16 18:34:49,788 INFO L226 Difference]: Without dead ends: 525 [2025-03-16 18:34:49,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:34:49,792 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 1301 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1301 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:49,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1301 Valid, 1533 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 2720 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 18:34:49,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-16 18:34:49,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2025-03-16 18:34:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 405 states have (on average 1.6444444444444444) internal successors, (666), 424 states have internal predecessors, (666), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (106), 89 states have call predecessors, (106), 90 states have call successors, (106) [2025-03-16 18:34:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 867 transitions. [2025-03-16 18:34:49,817 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 867 transitions. Word has length 96 [2025-03-16 18:34:49,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:49,817 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 867 transitions. [2025-03-16 18:34:49,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 5 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-16 18:34:49,817 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 867 transitions. [2025-03-16 18:34:49,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 18:34:49,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:49,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:49,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 18:34:49,820 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:49,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:49,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1509304096, now seen corresponding path program 1 times [2025-03-16 18:34:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:49,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373784584] [2025-03-16 18:34:49,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:49,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:49,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 18:34:49,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 18:34:49,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:49,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:49,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:34:49,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:49,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373784584] [2025-03-16 18:34:49,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373784584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:49,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:49,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:34:49,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562416424] [2025-03-16 18:34:49,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:49,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:34:49,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:49,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:34:49,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:49,951 INFO L87 Difference]: Start difference. First operand 525 states and 867 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-16 18:34:52,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:52,870 INFO L93 Difference]: Finished difference Result 1900 states and 3237 transitions. [2025-03-16 18:34:52,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 18:34:52,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 97 [2025-03-16 18:34:52,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:52,881 INFO L225 Difference]: With dead ends: 1900 [2025-03-16 18:34:52,882 INFO L226 Difference]: Without dead ends: 1415 [2025-03-16 18:34:52,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 18:34:52,886 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 2386 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 4922 mSolverCounterSat, 619 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2466 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 5541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 619 IncrementalHoareTripleChecker+Valid, 4922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:52,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2466 Valid, 2486 Invalid, 5541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [619 Valid, 4922 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 18:34:52,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2025-03-16 18:34:52,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1357. [2025-03-16 18:34:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1044 states have (on average 1.6503831417624522) internal successors, (1723), 1092 states have internal predecessors, (1723), 249 states have call successors, (249), 63 states have call predecessors, (249), 63 states have return successors, (270), 238 states have call predecessors, (270), 244 states have call successors, (270) [2025-03-16 18:34:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 2242 transitions. [2025-03-16 18:34:52,958 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 2242 transitions. Word has length 97 [2025-03-16 18:34:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:52,958 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 2242 transitions. [2025-03-16 18:34:52,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-16 18:34:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 2242 transitions. [2025-03-16 18:34:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 18:34:52,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:52,961 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] [2025-03-16 18:34:52,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 18:34:52,961 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:52,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:52,962 INFO L85 PathProgramCache]: Analyzing trace with hash -261149281, now seen corresponding path program 1 times [2025-03-16 18:34:52,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:52,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151896897] [2025-03-16 18:34:52,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:52,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:52,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 18:34:52,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 18:34:52,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:52,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:34:53,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:53,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151896897] [2025-03-16 18:34:53,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151896897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:53,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:53,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:53,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219677715] [2025-03-16 18:34:53,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:53,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:53,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:53,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:53,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:53,072 INFO L87 Difference]: Start difference. First operand 1357 states and 2242 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:34:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:55,308 INFO L93 Difference]: Finished difference Result 4671 states and 7896 transitions. [2025-03-16 18:34:55,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:34:55,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 99 [2025-03-16 18:34:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:55,332 INFO L225 Difference]: With dead ends: 4671 [2025-03-16 18:34:55,332 INFO L226 Difference]: Without dead ends: 3355 [2025-03-16 18:34:55,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:34:55,341 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 3234 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 3288 mSolverCounterSat, 837 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3276 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 4125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 837 IncrementalHoareTripleChecker+Valid, 3288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:55,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3276 Valid, 1786 Invalid, 4125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [837 Valid, 3288 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 18:34:55,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2025-03-16 18:34:55,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 2946. [2025-03-16 18:34:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2946 states, 2219 states have (on average 1.6421811626858946) internal successors, (3644), 2332 states have internal predecessors, (3644), 597 states have call successors, (597), 121 states have call predecessors, (597), 129 states have return successors, (662), 581 states have call predecessors, (662), 592 states have call successors, (662) [2025-03-16 18:34:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 4903 transitions. [2025-03-16 18:34:55,505 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 4903 transitions. Word has length 99 [2025-03-16 18:34:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:55,506 INFO L471 AbstractCegarLoop]: Abstraction has 2946 states and 4903 transitions. [2025-03-16 18:34:55,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:34:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 4903 transitions. [2025-03-16 18:34:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 18:34:55,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:55,508 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] [2025-03-16 18:34:55,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 18:34:55,509 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:55,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:55,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1338527818, now seen corresponding path program 1 times [2025-03-16 18:34:55,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:55,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394235427] [2025-03-16 18:34:55,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:55,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 18:34:55,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 18:34:55,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:55,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:55,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:34:55,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:55,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394235427] [2025-03-16 18:34:55,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394235427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:55,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:55,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:55,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575723602] [2025-03-16 18:34:55,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:55,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:55,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:55,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:55,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:55,634 INFO L87 Difference]: Start difference. First operand 2946 states and 4903 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:34:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:57,935 INFO L93 Difference]: Finished difference Result 10926 states and 18638 transitions. [2025-03-16 18:34:57,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:34:57,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 100 [2025-03-16 18:34:57,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:57,995 INFO L225 Difference]: With dead ends: 10926 [2025-03-16 18:34:57,995 INFO L226 Difference]: Without dead ends: 8022 [2025-03-16 18:34:58,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:34:58,014 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 3247 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 3255 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3290 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 4113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 3255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:58,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3290 Valid, 1799 Invalid, 4113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 3255 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 18:34:58,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8022 states. [2025-03-16 18:34:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8022 to 6860. [2025-03-16 18:34:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6860 states, 5053 states have (on average 1.6311102315456165) internal successors, (8242), 5335 states have internal predecessors, (8242), 1532 states have call successors, (1532), 237 states have call predecessors, (1532), 274 states have return successors, (1744), 1507 states have call predecessors, (1744), 1527 states have call successors, (1744) [2025-03-16 18:34:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6860 states to 6860 states and 11518 transitions. [2025-03-16 18:34:58,456 INFO L78 Accepts]: Start accepts. Automaton has 6860 states and 11518 transitions. Word has length 100 [2025-03-16 18:34:58,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:58,456 INFO L471 AbstractCegarLoop]: Abstraction has 6860 states and 11518 transitions. [2025-03-16 18:34:58,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:34:58,460 INFO L276 IsEmpty]: Start isEmpty. Operand 6860 states and 11518 transitions. [2025-03-16 18:34:58,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 18:34:58,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:58,462 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] [2025-03-16 18:34:58,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 18:34:58,462 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:58,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:58,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1619657798, now seen corresponding path program 1 times [2025-03-16 18:34:58,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:58,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282471866] [2025-03-16 18:34:58,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:58,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:58,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 18:34:58,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 18:34:58,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:58,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:34:58,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:58,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282471866] [2025-03-16 18:34:58,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282471866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:58,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:58,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:58,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306933599] [2025-03-16 18:34:58,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:58,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:58,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:58,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:58,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:58,569 INFO L87 Difference]: Start difference. First operand 6860 states and 11518 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:35:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:01,276 INFO L93 Difference]: Finished difference Result 27347 states and 47079 transitions. [2025-03-16 18:35:01,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:35:01,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 101 [2025-03-16 18:35:01,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:01,388 INFO L225 Difference]: With dead ends: 27347 [2025-03-16 18:35:01,389 INFO L226 Difference]: Without dead ends: 20531 [2025-03-16 18:35:01,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:35:01,422 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 3259 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 3256 mSolverCounterSat, 864 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3303 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 4120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 3256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:01,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3303 Valid, 1820 Invalid, 4120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 3256 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 18:35:01,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20531 states. [2025-03-16 18:35:02,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20531 to 17002. [2025-03-16 18:35:02,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17002 states, 12276 states have (on average 1.6208048224177256) internal successors, (19897), 13010 states have internal predecessors, (19897), 4121 states have call successors, (4121), 469 states have call predecessors, (4121), 604 states have return successors, (4824), 4079 states have call predecessors, (4824), 4116 states have call successors, (4824) [2025-03-16 18:35:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17002 states to 17002 states and 28842 transitions. [2025-03-16 18:35:02,321 INFO L78 Accepts]: Start accepts. Automaton has 17002 states and 28842 transitions. Word has length 101 [2025-03-16 18:35:02,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:02,323 INFO L471 AbstractCegarLoop]: Abstraction has 17002 states and 28842 transitions. [2025-03-16 18:35:02,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:35:02,324 INFO L276 IsEmpty]: Start isEmpty. Operand 17002 states and 28842 transitions. [2025-03-16 18:35:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 18:35:02,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:02,326 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] [2025-03-16 18:35:02,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 18:35:02,326 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:02,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:02,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1308081009, now seen corresponding path program 1 times [2025-03-16 18:35:02,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:02,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128772715] [2025-03-16 18:35:02,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:02,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:02,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 18:35:02,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 18:35:02,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:02,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:35:02,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:02,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128772715] [2025-03-16 18:35:02,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128772715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:02,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:02,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:02,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573527919] [2025-03-16 18:35:02,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:02,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:02,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:02,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:02,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:02,501 INFO L87 Difference]: Start difference. First operand 17002 states and 28842 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:35:06,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:06,992 INFO L93 Difference]: Finished difference Result 72514 states and 126013 transitions. [2025-03-16 18:35:06,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:35:06,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 102 [2025-03-16 18:35:06,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:07,324 INFO L225 Difference]: With dead ends: 72514 [2025-03-16 18:35:07,324 INFO L226 Difference]: Without dead ends: 55560 [2025-03-16 18:35:07,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:35:07,410 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 3271 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 3265 mSolverCounterSat, 866 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3316 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 4131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 866 IncrementalHoareTripleChecker+Valid, 3265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:07,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3316 Valid, 1841 Invalid, 4131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [866 Valid, 3265 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 18:35:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55560 states. [2025-03-16 18:35:10,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55560 to 44596. [2025-03-16 18:35:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44596 states, 31735 states have (on average 1.6127304238222782) internal successors, (51180), 33709 states have internal predecessors, (51180), 11470 states have call successors, (11470), 933 states have call predecessors, (11470), 1390 states have return successors, (13798), 11391 states have call predecessors, (13798), 11465 states have call successors, (13798) [2025-03-16 18:35:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44596 states to 44596 states and 76448 transitions. [2025-03-16 18:35:10,741 INFO L78 Accepts]: Start accepts. Automaton has 44596 states and 76448 transitions. Word has length 102 [2025-03-16 18:35:10,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:10,741 INFO L471 AbstractCegarLoop]: Abstraction has 44596 states and 76448 transitions. [2025-03-16 18:35:10,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:35:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 44596 states and 76448 transitions. [2025-03-16 18:35:10,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 18:35:10,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:10,745 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] [2025-03-16 18:35:10,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 18:35:10,745 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:10,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:10,746 INFO L85 PathProgramCache]: Analyzing trace with hash 631537109, now seen corresponding path program 1 times [2025-03-16 18:35:10,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:10,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955771977] [2025-03-16 18:35:10,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:10,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:10,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 18:35:10,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 18:35:10,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:10,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:35:10,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:10,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955771977] [2025-03-16 18:35:10,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955771977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:10,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:10,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:10,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922205798] [2025-03-16 18:35:10,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:10,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:10,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:10,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:10,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:10,837 INFO L87 Difference]: Start difference. First operand 44596 states and 76448 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:35:22,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:22,265 INFO L93 Difference]: Finished difference Result 201737 states and 353409 transitions. [2025-03-16 18:35:22,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:35:22,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 103 [2025-03-16 18:35:22,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:23,411 INFO L225 Difference]: With dead ends: 201737 [2025-03-16 18:35:23,412 INFO L226 Difference]: Without dead ends: 157197 [2025-03-16 18:35:23,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:35:23,662 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 3283 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 3274 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3329 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 4142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 3274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:23,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3329 Valid, 1862 Invalid, 4142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 3274 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 18:35:23,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157197 states. [2025-03-16 18:35:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157197 to 122874. [2025-03-16 18:35:31,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122874 states, 86778 states have (on average 1.6076309663739659) internal successors, (139507), 92228 states have internal predecessors, (139507), 32731 states have call successors, (32731), 1861 states have call predecessors, (32731), 3364 states have return successors, (40362), 32551 states have call predecessors, (40362), 32726 states have call successors, (40362) [2025-03-16 18:35:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122874 states to 122874 states and 212600 transitions. [2025-03-16 18:35:32,792 INFO L78 Accepts]: Start accepts. Automaton has 122874 states and 212600 transitions. Word has length 103 [2025-03-16 18:35:32,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:32,793 INFO L471 AbstractCegarLoop]: Abstraction has 122874 states and 212600 transitions. [2025-03-16 18:35:32,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:35:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 122874 states and 212600 transitions. [2025-03-16 18:35:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 18:35:32,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:32,796 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] [2025-03-16 18:35:32,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 18:35:32,796 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:32,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1417850733, now seen corresponding path program 1 times [2025-03-16 18:35:32,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:32,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115840883] [2025-03-16 18:35:32,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:32,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:32,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 18:35:32,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 18:35:32,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:32,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:35:32,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:32,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115840883] [2025-03-16 18:35:32,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115840883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:32,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:32,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 18:35:32,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825752561] [2025-03-16 18:35:32,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:32,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:35:32,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:32,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:35:32,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:35:32,927 INFO L87 Difference]: Start difference. First operand 122874 states and 212600 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 6 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11)