./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product23.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec3_product23.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 f91feaa60fbddcfc87f4cdb3911bff4dfabb88b0b67a46a205760e052b15032c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:27:49,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:27:49,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:27:49,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:27:49,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:27:49,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:27:49,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:27:49,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:27:49,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:27:49,857 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:27:49,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:27:49,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:27:49,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:27:49,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:27:49,857 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:27:49,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:27:49,857 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:27:49,857 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:27:49,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:27:49,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:27:49,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:27:49,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:27:49,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:27:49,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:27:49,858 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:27:49,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:27:49,858 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:27:49,858 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:27:49,858 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:27:49,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:27:49,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:27:49,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:27:49,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:27:49,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:27:49,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:27:49,858 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:27:49,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:27:49,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:27:49,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:27:49,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:27:49,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:27:49,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:27:49,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:27:49,859 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 -> f91feaa60fbddcfc87f4cdb3911bff4dfabb88b0b67a46a205760e052b15032c [2025-03-08 05:27:50,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:27:50,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:27:50,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:27:50,090 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:27:50,090 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:27:50,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product23.cil.c [2025-03-08 05:27:51,222 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe1e7744/4c08f36d7e594055afd3a76c8a69a609/FLAG703640691 [2025-03-08 05:27:51,515 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:27:51,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product23.cil.c [2025-03-08 05:27:51,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe1e7744/4c08f36d7e594055afd3a76c8a69a609/FLAG703640691 [2025-03-08 05:27:51,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe1e7744/4c08f36d7e594055afd3a76c8a69a609 [2025-03-08 05:27:51,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:27:51,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:27:51,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:27:51,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:27:51,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:27:51,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:27:51" (1/1) ... [2025-03-08 05:27:51,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:51, skipping insertion in model container [2025-03-08 05:27:51,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:27:51" (1/1) ... [2025-03-08 05:27:51,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:27:51,989 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_spec3_product23.cil.c[5798,5811] [2025-03-08 05:27:52,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:27:52,252 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:27:52,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-03-08 05:27:52,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [67] [2025-03-08 05:27:52,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [260] [2025-03-08 05:27:52,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [269] [2025-03-08 05:27:52,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1874] [2025-03-08 05:27:52,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1968] [2025-03-08 05:27:52,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2086] [2025-03-08 05:27:52,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2124] [2025-03-08 05:27:52,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2472] [2025-03-08 05:27:52,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2838] [2025-03-08 05:27:52,272 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_spec3_product23.cil.c[5798,5811] [2025-03-08 05:27:52,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:27:52,385 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:27:52,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:52 WrapperNode [2025-03-08 05:27:52,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:27:52,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:27:52,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:27:52,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:27:52,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:52" (1/1) ... [2025-03-08 05:27:52,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:52" (1/1) ... [2025-03-08 05:27:52,444 INFO L138 Inliner]: procedures = 94, calls = 353, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 941 [2025-03-08 05:27:52,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:27:52,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:27:52,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:27:52,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:27:52,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:52" (1/1) ... [2025-03-08 05:27:52,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:52" (1/1) ... [2025-03-08 05:27:52,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:52" (1/1) ... [2025-03-08 05:27:52,489 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-08 05:27:52,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:52" (1/1) ... [2025-03-08 05:27:52,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:52" (1/1) ... [2025-03-08 05:27:52,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:52" (1/1) ... [2025-03-08 05:27:52,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:52" (1/1) ... [2025-03-08 05:27:52,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:52" (1/1) ... [2025-03-08 05:27:52,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:52" (1/1) ... [2025-03-08 05:27:52,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:27:52,528 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:27:52,528 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:27:52,528 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:27:52,529 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:52" (1/1) ... [2025-03-08 05:27:52,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:27:52,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:52,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:27:52,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:27:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:27:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-08 05:27:52,576 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-08 05:27:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-03-08 05:27:52,576 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-03-08 05:27:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-08 05:27:52,576 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-08 05:27:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:27:52,577 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:27:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-08 05:27:52,577 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-08 05:27:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:27:52,577 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:27:52,578 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-08 05:27:52,578 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-08 05:27:52,578 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:27:52,578 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:27:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:27:52,579 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:27:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:27:52,579 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:27:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:27:52,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:27:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:27:52,580 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:27:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:27:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:27:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-08 05:27:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-03-08 05:27:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:27:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:27:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-03-08 05:27:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:27:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:27:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:27:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:27:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:27:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:27:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:27:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:27:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:27:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-08 05:27:52,582 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-08 05:27:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:27:52,582 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:27:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:27:52,582 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:27:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:27:52,582 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:27:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2025-03-08 05:27:52,582 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2025-03-08 05:27:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:27:52,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:27:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:27:52,582 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:27:52,735 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:27:52,736 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:27:52,799 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1205-1: stopRequestedAtCurrentFloor__wrappee__weight_#res#1 := stopRequestedAtCurrentFloor__wrappee__weight_~retValue_acc~12#1; [2025-03-08 05:27:52,799 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233: #res#1 := ~retValue_acc~13#1; [2025-03-08 05:27:52,803 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: #res := ~retValue_acc~4; [2025-03-08 05:27:52,817 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2005: #res := ~retValue_acc~19; [2025-03-08 05:27:52,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862: #res := ~retValue_acc~17; [2025-03-08 05:27:52,906 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1086-1: stopRequestedInDirection__wrappee__twothirdsfull_#res#1 := stopRequestedInDirection__wrappee__twothirdsfull_~retValue_acc~9#1; [2025-03-08 05:27:52,906 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1115: #res#1 := ~retValue_acc~10#1; [2025-03-08 05:27:52,906 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1149-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~11#1; [2025-03-08 05:27:52,914 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1278: #res := ~retValue_acc~15; [2025-03-08 05:27:53,077 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~14#1; [2025-03-08 05:27:53,136 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L681-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~6#1; [2025-03-08 05:27:53,137 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L694-1: isIdle_#res#1 := isIdle_~retValue_acc~7#1; [2025-03-08 05:27:53,140 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3496: #res := ~retValue_acc~31; [2025-03-08 05:27:53,149 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2083: #res := ~retValue_acc~21; [2025-03-08 05:27:53,150 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L356: #res := ~retValue_acc~0; [2025-03-08 05:27:53,152 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L509: #res := ~retValue_acc~1; [2025-03-08 05:27:53,270 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2044: #res := ~retValue_acc~20; [2025-03-08 05:27:53,285 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L552: #res := ~retValue_acc~3; [2025-03-08 05:27:53,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3185: #res := ~retValue_acc~30; [2025-03-08 05:27:53,469 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1046: #res := ~retValue_acc~8; [2025-03-08 05:27:53,526 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2121-1: valid_product_#res#1 := valid_product_~retValue_acc~23#1; [2025-03-08 05:27:53,526 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2469-1: main_#res#1 := main_~retValue_acc~25#1; [2025-03-08 05:27:53,537 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2949: #res := ~retValue_acc~29; [2025-03-08 05:27:53,672 INFO L? ?]: Removed 481 outVars from TransFormulas that were not future-live. [2025-03-08 05:27:53,672 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:27:53,693 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:27:53,693 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:27:53,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:27:53 BoogieIcfgContainer [2025-03-08 05:27:53,693 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:27:53,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:27:53,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:27:53,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:27:53,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:27:51" (1/3) ... [2025-03-08 05:27:53,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5401ea0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:27:53, skipping insertion in model container [2025-03-08 05:27:53,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:52" (2/3) ... [2025-03-08 05:27:53,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5401ea0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:27:53, skipping insertion in model container [2025-03-08 05:27:53,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:27:53" (3/3) ... [2025-03-08 05:27:53,704 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product23.cil.c [2025-03-08 05:27:53,715 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:27:53,717 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product23.cil.c that has 29 procedures, 610 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:27:53,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:27:53,785 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;@7bfe128d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:27:53,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:27:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 610 states, 467 states have (on average 1.6616702355460387) internal successors, (776), 485 states have internal predecessors, (776), 113 states have call successors, (113), 28 states have call predecessors, (113), 28 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-08 05:27:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:27:53,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:53,807 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:53,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:53,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 594271102, now seen corresponding path program 1 times [2025-03-08 05:27:53,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:53,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618949711] [2025-03-08 05:27:53,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:53,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:53,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:27:54,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:27:54,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:54,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:27:54,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:54,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618949711] [2025-03-08 05:27:54,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618949711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:54,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:54,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:54,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744946640] [2025-03-08 05:27:54,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:54,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:54,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:54,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:54,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:54,499 INFO L87 Difference]: Start difference. First operand has 610 states, 467 states have (on average 1.6616702355460387) internal successors, (776), 485 states have internal predecessors, (776), 113 states have call successors, (113), 28 states have call predecessors, (113), 28 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:54,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:54,705 INFO L93 Difference]: Finished difference Result 1217 states and 2016 transitions. [2025-03-08 05:27:54,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:54,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 115 [2025-03-08 05:27:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:54,721 INFO L225 Difference]: With dead ends: 1217 [2025-03-08 05:27:54,721 INFO L226 Difference]: Without dead ends: 615 [2025-03-08 05:27:54,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:27:54,731 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 91 mSDsluCounter, 4849 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5836 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:54,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5836 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:27:54,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-03-08 05:27:54,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 613. [2025-03-08 05:27:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 470 states have (on average 1.6553191489361703) internal successors, (778), 488 states have internal predecessors, (778), 114 states have call successors, (114), 28 states have call predecessors, (114), 28 states have return successors, (113), 109 states have call predecessors, (113), 111 states have call successors, (113) [2025-03-08 05:27:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1005 transitions. [2025-03-08 05:27:54,815 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1005 transitions. Word has length 115 [2025-03-08 05:27:54,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:54,815 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 1005 transitions. [2025-03-08 05:27:54,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1005 transitions. [2025-03-08 05:27:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:27:54,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:54,823 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:54,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:27:54,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:54,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:54,824 INFO L85 PathProgramCache]: Analyzing trace with hash -542093372, now seen corresponding path program 1 times [2025-03-08 05:27:54,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:54,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625551081] [2025-03-08 05:27:54,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:54,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:54,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:27:54,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:27:54,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:54,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:55,016 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:27:55,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:55,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625551081] [2025-03-08 05:27:55,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625551081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:55,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:55,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:55,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453219255] [2025-03-08 05:27:55,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:55,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:55,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:55,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:55,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:55,018 INFO L87 Difference]: Start difference. First operand 613 states and 1005 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:27:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:55,087 INFO L93 Difference]: Finished difference Result 1208 states and 1991 transitions. [2025-03-08 05:27:55,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:27:55,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2025-03-08 05:27:55,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:55,093 INFO L225 Difference]: With dead ends: 1208 [2025-03-08 05:27:55,094 INFO L226 Difference]: Without dead ends: 589 [2025-03-08 05:27:55,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:27:55,098 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 14 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2920 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:55,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2920 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:55,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-08 05:27:55,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-03-08 05:27:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 449 states have (on average 1.645879732739421) internal successors, (739), 465 states have internal predecessors, (739), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-08 05:27:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 962 transitions. [2025-03-08 05:27:55,132 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 962 transitions. Word has length 116 [2025-03-08 05:27:55,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:55,132 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 962 transitions. [2025-03-08 05:27:55,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:27:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 962 transitions. [2025-03-08 05:27:55,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:27:55,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:55,136 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:55,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:27:55,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:55,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:55,138 INFO L85 PathProgramCache]: Analyzing trace with hash 781248547, now seen corresponding path program 1 times [2025-03-08 05:27:55,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:55,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936195645] [2025-03-08 05:27:55,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:55,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:55,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:27:55,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:27:55,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:55,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:27:55,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:55,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936195645] [2025-03-08 05:27:55,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936195645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:55,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:55,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:55,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666001620] [2025-03-08 05:27:55,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:55,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:55,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:55,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:55,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:55,448 INFO L87 Difference]: Start difference. First operand 589 states and 962 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:55,552 INFO L93 Difference]: Finished difference Result 1171 states and 1923 transitions. [2025-03-08 05:27:55,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:55,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 116 [2025-03-08 05:27:55,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:55,556 INFO L225 Difference]: With dead ends: 1171 [2025-03-08 05:27:55,557 INFO L226 Difference]: Without dead ends: 583 [2025-03-08 05:27:55,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:27:55,560 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 77 mSDsluCounter, 4685 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 5636 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:55,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 5636 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-08 05:27:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2025-03-08 05:27:55,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 443 states have (on average 1.6388261851015802) internal successors, (726), 459 states have internal predecessors, (726), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-08 05:27:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 949 transitions. [2025-03-08 05:27:55,586 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 949 transitions. Word has length 116 [2025-03-08 05:27:55,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:55,587 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 949 transitions. [2025-03-08 05:27:55,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 949 transitions. [2025-03-08 05:27:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:27:55,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:55,592 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:55,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:27:55,592 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:55,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:55,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1698607224, now seen corresponding path program 1 times [2025-03-08 05:27:55,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:55,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384877154] [2025-03-08 05:27:55,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:55,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:55,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:27:55,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:27:55,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:55,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:27:55,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:55,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384877154] [2025-03-08 05:27:55,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384877154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:55,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:55,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:55,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951426109] [2025-03-08 05:27:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:55,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:55,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:55,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:55,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:55,783 INFO L87 Difference]: Start difference. First operand 583 states and 949 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, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:55,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:55,859 INFO L93 Difference]: Finished difference Result 1159 states and 1897 transitions. [2025-03-08 05:27:55,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:55,859 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, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 117 [2025-03-08 05:27:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:55,864 INFO L225 Difference]: With dead ends: 1159 [2025-03-08 05:27:55,864 INFO L226 Difference]: Without dead ends: 577 [2025-03-08 05:27:55,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:27:55,870 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 63 mSDsluCounter, 4637 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5576 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:55,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5576 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:55,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-08 05:27:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2025-03-08 05:27:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 437 states have (on average 1.631578947368421) internal successors, (713), 453 states have internal predecessors, (713), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-08 05:27:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 936 transitions. [2025-03-08 05:27:55,897 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 936 transitions. Word has length 117 [2025-03-08 05:27:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:55,897 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 936 transitions. [2025-03-08 05:27:55,897 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, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 936 transitions. [2025-03-08 05:27:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:27:55,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:55,900 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:55,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:27:55,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:55,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash -512019683, now seen corresponding path program 1 times [2025-03-08 05:27:55,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:55,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629328242] [2025-03-08 05:27:55,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:55,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:55,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:27:55,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:27:55,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:55,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:27:56,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:56,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629328242] [2025-03-08 05:27:56,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629328242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:56,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:56,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:56,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697030285] [2025-03-08 05:27:56,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:56,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:56,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:56,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:56,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:56,098 INFO L87 Difference]: Start difference. First operand 577 states and 936 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:56,165 INFO L93 Difference]: Finished difference Result 1147 states and 1871 transitions. [2025-03-08 05:27:56,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:56,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 118 [2025-03-08 05:27:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:56,169 INFO L225 Difference]: With dead ends: 1147 [2025-03-08 05:27:56,169 INFO L226 Difference]: Without dead ends: 571 [2025-03-08 05:27:56,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:27:56,172 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 49 mSDsluCounter, 4589 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5516 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:56,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5516 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:56,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-08 05:27:56,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2025-03-08 05:27:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 431 states have (on average 1.6241299303944317) internal successors, (700), 447 states have internal predecessors, (700), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-08 05:27:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 923 transitions. [2025-03-08 05:27:56,193 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 923 transitions. Word has length 118 [2025-03-08 05:27:56,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:56,194 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 923 transitions. [2025-03-08 05:27:56,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 923 transitions. [2025-03-08 05:27:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:27:56,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:56,196 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:56,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:27:56,196 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:56,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:56,197 INFO L85 PathProgramCache]: Analyzing trace with hash -617723051, now seen corresponding path program 1 times [2025-03-08 05:27:56,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:56,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789480002] [2025-03-08 05:27:56,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:56,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:56,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:27:56,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:27:56,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:56,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:27:56,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:56,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789480002] [2025-03-08 05:27:56,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789480002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:56,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:56,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:27:56,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077995294] [2025-03-08 05:27:56,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:56,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:27:56,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:56,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:27:56,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:56,350 INFO L87 Difference]: Start difference. First operand 571 states and 923 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:56,411 INFO L93 Difference]: Finished difference Result 1135 states and 1845 transitions. [2025-03-08 05:27:56,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:27:56,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 118 [2025-03-08 05:27:56,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:56,416 INFO L225 Difference]: With dead ends: 1135 [2025-03-08 05:27:56,416 INFO L226 Difference]: Without dead ends: 571 [2025-03-08 05:27:56,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:27:56,420 INFO L435 NwaCegarLoop]: 915 mSDtfsCounter, 24 mSDsluCounter, 4553 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5468 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:56,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5468 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:56,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-08 05:27:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2025-03-08 05:27:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 431 states have (on average 1.6218097447795823) internal successors, (699), 447 states have internal predecessors, (699), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-08 05:27:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 922 transitions. [2025-03-08 05:27:56,443 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 922 transitions. Word has length 118 [2025-03-08 05:27:56,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:56,443 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 922 transitions. [2025-03-08 05:27:56,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 922 transitions. [2025-03-08 05:27:56,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:27:56,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:56,446 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:56,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:27:56,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:56,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:56,446 INFO L85 PathProgramCache]: Analyzing trace with hash -905951886, now seen corresponding path program 1 times [2025-03-08 05:27:56,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:56,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831799463] [2025-03-08 05:27:56,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:56,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:56,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:27:56,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:27:56,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:56,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:27:56,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:56,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831799463] [2025-03-08 05:27:56,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831799463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:56,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:56,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:56,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047337387] [2025-03-08 05:27:56,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:56,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:56,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:56,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:56,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:56,545 INFO L87 Difference]: Start difference. First operand 571 states and 922 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:27:56,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:56,622 INFO L93 Difference]: Finished difference Result 1126 states and 1830 transitions. [2025-03-08 05:27:56,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:27:56,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2025-03-08 05:27:56,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:56,625 INFO L225 Difference]: With dead ends: 1126 [2025-03-08 05:27:56,625 INFO L226 Difference]: Without dead ends: 571 [2025-03-08 05:27:56,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:56,628 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 15 mSDsluCounter, 1799 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2706 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:56,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2706 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-08 05:27:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2025-03-08 05:27:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 431 states have (on average 1.6194895591647331) internal successors, (698), 447 states have internal predecessors, (698), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-08 05:27:56,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 921 transitions. [2025-03-08 05:27:56,645 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 921 transitions. Word has length 119 [2025-03-08 05:27:56,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:56,645 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 921 transitions. [2025-03-08 05:27:56,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:27:56,645 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 921 transitions. [2025-03-08 05:27:56,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:27:56,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:56,648 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:56,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:27:56,648 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:56,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:56,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1594732357, now seen corresponding path program 1 times [2025-03-08 05:27:56,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:56,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126655962] [2025-03-08 05:27:56,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:56,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:56,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:27:56,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:27:56,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:56,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:27:56,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:56,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126655962] [2025-03-08 05:27:56,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126655962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:56,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:56,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:56,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54035420] [2025-03-08 05:27:56,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:56,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:56,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:56,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:56,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:56,737 INFO L87 Difference]: Start difference. First operand 571 states and 921 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:27:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:56,774 INFO L93 Difference]: Finished difference Result 1126 states and 1828 transitions. [2025-03-08 05:27:56,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:27:56,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2025-03-08 05:27:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:56,777 INFO L225 Difference]: With dead ends: 1126 [2025-03-08 05:27:56,778 INFO L226 Difference]: Without dead ends: 571 [2025-03-08 05:27:56,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:56,780 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 14 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:56,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2708 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-08 05:27:56,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2025-03-08 05:27:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 431 states have (on average 1.617169373549884) internal successors, (697), 447 states have internal predecessors, (697), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-08 05:27:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 920 transitions. [2025-03-08 05:27:56,797 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 920 transitions. Word has length 120 [2025-03-08 05:27:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:56,797 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 920 transitions. [2025-03-08 05:27:56,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:27:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 920 transitions. [2025-03-08 05:27:56,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:27:56,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:56,800 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:56,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:27:56,800 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:56,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:56,800 INFO L85 PathProgramCache]: Analyzing trace with hash 360604501, now seen corresponding path program 1 times [2025-03-08 05:27:56,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:56,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535873270] [2025-03-08 05:27:56,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:56,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:56,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:27:56,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:27:56,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:56,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:27:56,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:56,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535873270] [2025-03-08 05:27:56,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535873270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:56,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:56,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:56,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337567425] [2025-03-08 05:27:56,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:56,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:56,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:56,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:56,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:56,887 INFO L87 Difference]: Start difference. First operand 571 states and 920 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:27:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:56,923 INFO L93 Difference]: Finished difference Result 1126 states and 1826 transitions. [2025-03-08 05:27:56,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:27:56,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2025-03-08 05:27:56,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:56,927 INFO L225 Difference]: With dead ends: 1126 [2025-03-08 05:27:56,927 INFO L226 Difference]: Without dead ends: 571 [2025-03-08 05:27:56,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:56,930 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 13 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:56,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2710 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:56,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-08 05:27:56,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2025-03-08 05:27:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 431 states have (on average 1.6148491879350348) internal successors, (696), 447 states have internal predecessors, (696), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-08 05:27:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 919 transitions. [2025-03-08 05:27:56,948 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 919 transitions. Word has length 121 [2025-03-08 05:27:56,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:56,948 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 919 transitions. [2025-03-08 05:27:56,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:27:56,948 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 919 transitions. [2025-03-08 05:27:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 05:27:56,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:56,951 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:56,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:27:56,951 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:56,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:56,951 INFO L85 PathProgramCache]: Analyzing trace with hash -688581432, now seen corresponding path program 1 times [2025-03-08 05:27:56,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:56,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231407894] [2025-03-08 05:27:56,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:56,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:56,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 05:27:56,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 05:27:56,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:56,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:27:57,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:57,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231407894] [2025-03-08 05:27:57,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231407894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:57,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:57,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:57,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054072855] [2025-03-08 05:27:57,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:57,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:57,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:57,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:57,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:57,041 INFO L87 Difference]: Start difference. First operand 571 states and 919 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:27:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:57,074 INFO L93 Difference]: Finished difference Result 1126 states and 1824 transitions. [2025-03-08 05:27:57,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:27:57,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2025-03-08 05:27:57,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:57,079 INFO L225 Difference]: With dead ends: 1126 [2025-03-08 05:27:57,079 INFO L226 Difference]: Without dead ends: 571 [2025-03-08 05:27:57,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:57,082 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 12 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:57,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2712 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-08 05:27:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2025-03-08 05:27:57,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 431 states have (on average 1.6125290023201857) internal successors, (695), 447 states have internal predecessors, (695), 113 states have call successors, (113), 28 states have call predecessors, (113), 26 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-08 05:27:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 918 transitions. [2025-03-08 05:27:57,100 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 918 transitions. Word has length 122 [2025-03-08 05:27:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:57,100 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 918 transitions. [2025-03-08 05:27:57,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:27:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 918 transitions. [2025-03-08 05:27:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 05:27:57,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:57,103 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:57,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:27:57,103 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:57,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:57,103 INFO L85 PathProgramCache]: Analyzing trace with hash -299535048, now seen corresponding path program 1 times [2025-03-08 05:27:57,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:57,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803450786] [2025-03-08 05:27:57,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:57,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:57,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:27:57,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:27:57,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:57,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:27:57,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:57,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803450786] [2025-03-08 05:27:57,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803450786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:57,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641321679] [2025-03-08 05:27:57,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:57,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:57,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:57,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:27:57,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:27:57,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:27:57,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:27:57,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:57,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:57,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1638 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:27:57,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:27:57,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:57,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641321679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:57,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:57,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:27:57,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112080380] [2025-03-08 05:27:57,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:57,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:27:57,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:57,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:27:57,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:57,744 INFO L87 Difference]: Start difference. First operand 571 states and 918 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:57,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:57,813 INFO L93 Difference]: Finished difference Result 1624 states and 2642 transitions. [2025-03-08 05:27:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:27:57,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 123 [2025-03-08 05:27:57,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:57,821 INFO L225 Difference]: With dead ends: 1624 [2025-03-08 05:27:57,821 INFO L226 Difference]: Without dead ends: 1071 [2025-03-08 05:27:57,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:57,825 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 842 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 2386 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:57,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 2386 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-03-08 05:27:57,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1056. [2025-03-08 05:27:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 804 states have (on average 1.6243781094527363) internal successors, (1306), 835 states have internal predecessors, (1306), 201 states have call successors, (201), 51 states have call predecessors, (201), 50 states have return successors, (203), 195 states have call predecessors, (203), 198 states have call successors, (203) [2025-03-08 05:27:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1710 transitions. [2025-03-08 05:27:57,864 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1710 transitions. Word has length 123 [2025-03-08 05:27:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:57,864 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1710 transitions. [2025-03-08 05:27:57,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1710 transitions. [2025-03-08 05:27:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:27:57,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:57,869 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:57,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:27:58,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 05:27:58,069 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:58,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:58,070 INFO L85 PathProgramCache]: Analyzing trace with hash -420746460, now seen corresponding path program 1 times [2025-03-08 05:27:58,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:58,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197971116] [2025-03-08 05:27:58,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:58,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:58,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:27:58,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:27:58,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:58,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:27:58,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:58,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197971116] [2025-03-08 05:27:58,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197971116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:27:58,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327360002] [2025-03-08 05:27:58,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:58,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:27:58,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:27:58,227 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:27:58,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:27:58,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:27:58,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:27:58,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:58,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:58,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:27:58,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:27:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:27:58,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:27:58,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327360002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:58,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:27:58,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:27:58,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53203927] [2025-03-08 05:27:58,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:58,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:27:58,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:58,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:27:58,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:58,669 INFO L87 Difference]: Start difference. First operand 1056 states and 1710 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:58,734 INFO L93 Difference]: Finished difference Result 2594 states and 4228 transitions. [2025-03-08 05:27:58,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:27:58,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2025-03-08 05:27:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:58,763 INFO L225 Difference]: With dead ends: 2594 [2025-03-08 05:27:58,764 INFO L226 Difference]: Without dead ends: 1556 [2025-03-08 05:27:58,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:27:58,768 INFO L435 NwaCegarLoop]: 979 mSDtfsCounter, 843 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:58,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1791 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:27:58,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2025-03-08 05:27:58,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1508. [2025-03-08 05:27:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1150 states have (on average 1.6356521739130434) internal successors, (1881), 1196 states have internal predecessors, (1881), 286 states have call successors, (286), 71 states have call predecessors, (286), 71 states have return successors, (293), 279 states have call predecessors, (293), 283 states have call successors, (293) [2025-03-08 05:27:58,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2460 transitions. [2025-03-08 05:27:58,820 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2460 transitions. Word has length 124 [2025-03-08 05:27:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:58,820 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 2460 transitions. [2025-03-08 05:27:58,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:27:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2460 transitions. [2025-03-08 05:27:58,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 05:27:58,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:58,825 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:58,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:27:59,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 05:27:59,030 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:59,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash -552204944, now seen corresponding path program 1 times [2025-03-08 05:27:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:59,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162589110] [2025-03-08 05:27:59,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:59,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:59,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:27:59,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:27:59,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:59,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:27:59,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:59,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162589110] [2025-03-08 05:27:59,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162589110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:59,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:59,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:27:59,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552993833] [2025-03-08 05:27:59,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:59,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:27:59,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:59,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:27:59,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:27:59,205 INFO L87 Difference]: Start difference. First operand 1508 states and 2460 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:27:59,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:27:59,703 INFO L93 Difference]: Finished difference Result 4448 states and 7387 transitions. [2025-03-08 05:27:59,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:27:59,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 126 [2025-03-08 05:27:59,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:59,723 INFO L225 Difference]: With dead ends: 4448 [2025-03-08 05:27:59,723 INFO L226 Difference]: Without dead ends: 2958 [2025-03-08 05:27:59,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:27:59,733 INFO L435 NwaCegarLoop]: 1020 mSDtfsCounter, 909 mSDsluCounter, 3667 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 4687 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:59,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 4687 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:27:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2025-03-08 05:27:59,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2911. [2025-03-08 05:27:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2911 states, 2221 states have (on average 1.635299414678073) internal successors, (3632), 2309 states have internal predecessors, (3632), 551 states have call successors, (551), 136 states have call predecessors, (551), 138 states have return successors, (637), 543 states have call predecessors, (637), 547 states have call successors, (637) [2025-03-08 05:27:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 4820 transitions. [2025-03-08 05:27:59,884 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 4820 transitions. Word has length 126 [2025-03-08 05:27:59,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:59,886 INFO L471 AbstractCegarLoop]: Abstraction has 2911 states and 4820 transitions. [2025-03-08 05:27:59,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:27:59,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 4820 transitions. [2025-03-08 05:27:59,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:27:59,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:59,892 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:27:59,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:27:59,893 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:59,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:59,893 INFO L85 PathProgramCache]: Analyzing trace with hash -351972545, now seen corresponding path program 1 times [2025-03-08 05:27:59,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:59,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604384855] [2025-03-08 05:27:59,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:59,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:59,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:27:59,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:27:59,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:59,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:28:00,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:00,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604384855] [2025-03-08 05:28:00,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604384855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:28:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180099756] [2025-03-08 05:28:00,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:00,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:28:00,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:00,051 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:28:00,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:28:00,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:28:00,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:28:00,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:00,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:00,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 1657 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 05:28:00,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:28:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:28:00,435 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:28:00,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180099756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:00,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:28:00,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-08 05:28:00,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093394467] [2025-03-08 05:28:00,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:00,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:00,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:00,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:00,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:28:00,437 INFO L87 Difference]: Start difference. First operand 2911 states and 4820 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 states have internal predecessors, (83), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 05:28:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:01,092 INFO L93 Difference]: Finished difference Result 7898 states and 13290 transitions. [2025-03-08 05:28:01,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:28:01,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 states have internal predecessors, (83), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 127 [2025-03-08 05:28:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:01,125 INFO L225 Difference]: With dead ends: 7898 [2025-03-08 05:28:01,125 INFO L226 Difference]: Without dead ends: 5005 [2025-03-08 05:28:01,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:28:01,150 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 776 mSDsluCounter, 3207 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 4141 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:01,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 4141 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:28:01,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5005 states. [2025-03-08 05:28:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5005 to 4962. [2025-03-08 05:28:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4962 states, 3780 states have (on average 1.5883597883597884) internal successors, (6004), 3926 states have internal predecessors, (6004), 930 states have call successors, (930), 246 states have call predecessors, (930), 251 states have return successors, (1183), 919 states have call predecessors, (1183), 924 states have call successors, (1183) [2025-03-08 05:28:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4962 states to 4962 states and 8117 transitions. [2025-03-08 05:28:01,401 INFO L78 Accepts]: Start accepts. Automaton has 4962 states and 8117 transitions. Word has length 127 [2025-03-08 05:28:01,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:01,401 INFO L471 AbstractCegarLoop]: Abstraction has 4962 states and 8117 transitions. [2025-03-08 05:28:01,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 states have internal predecessors, (83), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 05:28:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 4962 states and 8117 transitions. [2025-03-08 05:28:01,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:28:01,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:01,405 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:01,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:28:01,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:28:01,609 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:01,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:01,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1054011280, now seen corresponding path program 1 times [2025-03-08 05:28:01,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:01,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634730851] [2025-03-08 05:28:01,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:01,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:01,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:28:01,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:28:01,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:01,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:01,678 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:28:01,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:01,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634730851] [2025-03-08 05:28:01,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634730851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:01,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:01,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:01,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516295988] [2025-03-08 05:28:01,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:01,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:01,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:01,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:01,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:01,683 INFO L87 Difference]: Start difference. First operand 4962 states and 8117 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:28:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:01,876 INFO L93 Difference]: Finished difference Result 9930 states and 16409 transitions. [2025-03-08 05:28:01,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:28:01,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2025-03-08 05:28:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:01,908 INFO L225 Difference]: With dead ends: 9930 [2025-03-08 05:28:01,909 INFO L226 Difference]: Without dead ends: 4986 [2025-03-08 05:28:01,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:28:01,934 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 12 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:01,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2676 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4986 states. [2025-03-08 05:28:02,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4986 to 4970. [2025-03-08 05:28:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4970 states, 3786 states have (on average 1.5868991019545695) internal successors, (6008), 3932 states have internal predecessors, (6008), 930 states have call successors, (930), 250 states have call predecessors, (930), 253 states have return successors, (1172), 917 states have call predecessors, (1172), 924 states have call successors, (1172) [2025-03-08 05:28:02,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 8110 transitions. [2025-03-08 05:28:02,119 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 8110 transitions. Word has length 127 [2025-03-08 05:28:02,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:02,119 INFO L471 AbstractCegarLoop]: Abstraction has 4970 states and 8110 transitions. [2025-03-08 05:28:02,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:28:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 8110 transitions. [2025-03-08 05:28:02,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 05:28:02,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:02,156 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:02,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:28:02,157 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:02,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:02,157 INFO L85 PathProgramCache]: Analyzing trace with hash -154335075, now seen corresponding path program 1 times [2025-03-08 05:28:02,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:02,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672889951] [2025-03-08 05:28:02,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:02,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 05:28:02,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 05:28:02,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:02,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:28:02,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:02,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672889951] [2025-03-08 05:28:02,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672889951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:02,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:02,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:02,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591846809] [2025-03-08 05:28:02,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:02,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:02,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:02,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:02,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:02,304 INFO L87 Difference]: Start difference. First operand 4970 states and 8110 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 05:28:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:02,958 INFO L93 Difference]: Finished difference Result 14843 states and 24981 transitions. [2025-03-08 05:28:02,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:28:02,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2025-03-08 05:28:02,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:03,029 INFO L225 Difference]: With dead ends: 14843 [2025-03-08 05:28:03,030 INFO L226 Difference]: Without dead ends: 9891 [2025-03-08 05:28:03,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:03,064 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 903 mSDsluCounter, 3577 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 4564 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:03,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 4564 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:28:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9891 states. [2025-03-08 05:28:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9891 to 9822. [2025-03-08 05:28:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9822 states, 7484 states have (on average 1.5827097808658472) internal successors, (11845), 7770 states have internal predecessors, (11845), 1832 states have call successors, (1832), 494 states have call predecessors, (1832), 505 states have return successors, (2726), 1817 states have call predecessors, (2726), 1822 states have call successors, (2726) [2025-03-08 05:28:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9822 states to 9822 states and 16403 transitions. [2025-03-08 05:28:03,456 INFO L78 Accepts]: Start accepts. Automaton has 9822 states and 16403 transitions. Word has length 135 [2025-03-08 05:28:03,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:03,457 INFO L471 AbstractCegarLoop]: Abstraction has 9822 states and 16403 transitions. [2025-03-08 05:28:03,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 05:28:03,458 INFO L276 IsEmpty]: Start isEmpty. Operand 9822 states and 16403 transitions. [2025-03-08 05:28:03,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 05:28:03,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:03,462 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:03,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:28:03,462 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:03,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:03,463 INFO L85 PathProgramCache]: Analyzing trace with hash -309286743, now seen corresponding path program 1 times [2025-03-08 05:28:03,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:03,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379010934] [2025-03-08 05:28:03,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:03,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:03,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 05:28:03,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 05:28:03,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:03,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:28:03,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:03,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379010934] [2025-03-08 05:28:03,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379010934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:03,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:03,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:03,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556651282] [2025-03-08 05:28:03,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:03,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:03,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:03,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:03,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:03,541 INFO L87 Difference]: Start difference. First operand 9822 states and 16403 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:28:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:03,978 INFO L93 Difference]: Finished difference Result 19698 states and 33379 transitions. [2025-03-08 05:28:03,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:28:03,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-03-08 05:28:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:04,033 INFO L225 Difference]: With dead ends: 19698 [2025-03-08 05:28:04,033 INFO L226 Difference]: Without dead ends: 9894 [2025-03-08 05:28:04,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:28:04,077 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 12 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:04,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2667 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:04,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9894 states. [2025-03-08 05:28:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9894 to 9862. [2025-03-08 05:28:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9862 states, 7520 states have (on average 1.5804521276595744) internal successors, (11885), 7798 states have internal predecessors, (11885), 1832 states have call successors, (1832), 510 states have call predecessors, (1832), 509 states have return successors, (2710), 1813 states have call predecessors, (2710), 1822 states have call successors, (2710) [2025-03-08 05:28:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9862 states to 9862 states and 16427 transitions. [2025-03-08 05:28:04,379 INFO L78 Accepts]: Start accepts. Automaton has 9862 states and 16427 transitions. Word has length 136 [2025-03-08 05:28:04,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:04,380 INFO L471 AbstractCegarLoop]: Abstraction has 9862 states and 16427 transitions. [2025-03-08 05:28:04,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:28:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 9862 states and 16427 transitions. [2025-03-08 05:28:04,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 05:28:04,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:04,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:04,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:28:04,385 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:04,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:04,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2117771747, now seen corresponding path program 1 times [2025-03-08 05:28:04,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:04,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645689535] [2025-03-08 05:28:04,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:04,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:04,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 05:28:04,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 05:28:04,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:04,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:28:04,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:04,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645689535] [2025-03-08 05:28:04,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645689535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:04,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:04,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:04,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827704622] [2025-03-08 05:28:04,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:04,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:04,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:04,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:04,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:04,549 INFO L87 Difference]: Start difference. First operand 9862 states and 16427 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:28:05,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:05,514 INFO L93 Difference]: Finished difference Result 29597 states and 51523 transitions. [2025-03-08 05:28:05,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:28:05,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-03-08 05:28:05,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:05,636 INFO L225 Difference]: With dead ends: 29597 [2025-03-08 05:28:05,636 INFO L226 Difference]: Without dead ends: 19753 [2025-03-08 05:28:05,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:05,708 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 898 mSDsluCounter, 3591 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 4579 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:05,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 4579 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:28:05,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19753 states. [2025-03-08 05:28:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19753 to 19652. [2025-03-08 05:28:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19652 states, 14988 states have (on average 1.576928209234054) internal successors, (23635), 15538 states have internal predecessors, (23635), 3642 states have call successors, (3642), 1014 states have call predecessors, (3642), 1021 states have return successors, (6611), 3619 states have call predecessors, (6611), 3624 states have call successors, (6611) [2025-03-08 05:28:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19652 states to 19652 states and 33888 transitions. [2025-03-08 05:28:06,665 INFO L78 Accepts]: Start accepts. Automaton has 19652 states and 33888 transitions. Word has length 145 [2025-03-08 05:28:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:06,666 INFO L471 AbstractCegarLoop]: Abstraction has 19652 states and 33888 transitions. [2025-03-08 05:28:06,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:28:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 19652 states and 33888 transitions. [2025-03-08 05:28:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 05:28:06,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:06,671 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:06,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:28:06,672 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:06,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:06,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1756930864, now seen corresponding path program 1 times [2025-03-08 05:28:06,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:06,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56951084] [2025-03-08 05:28:06,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:06,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:28:06,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:28:06,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:06,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:28:06,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:06,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56951084] [2025-03-08 05:28:06,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56951084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:06,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:06,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:06,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592349714] [2025-03-08 05:28:06,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:06,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:06,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:06,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:06,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:06,822 INFO L87 Difference]: Start difference. First operand 19652 states and 33888 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:28:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:07,626 INFO L93 Difference]: Finished difference Result 39430 states and 69560 transitions. [2025-03-08 05:28:07,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:28:07,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2025-03-08 05:28:07,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:07,771 INFO L225 Difference]: With dead ends: 39430 [2025-03-08 05:28:07,772 INFO L226 Difference]: Without dead ends: 19796 [2025-03-08 05:28:07,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:28:07,914 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 11 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:07,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2667 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19796 states. [2025-03-08 05:28:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19796 to 19732. [2025-03-08 05:28:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19732 states, 15060 states have (on average 1.5747011952191234) internal successors, (23715), 15610 states have internal predecessors, (23715), 3642 states have call successors, (3642), 1030 states have call predecessors, (3642), 1029 states have return successors, (6591), 3611 states have call predecessors, (6591), 3624 states have call successors, (6591) [2025-03-08 05:28:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19732 states to 19732 states and 33948 transitions. [2025-03-08 05:28:08,666 INFO L78 Accepts]: Start accepts. Automaton has 19732 states and 33948 transitions. Word has length 146 [2025-03-08 05:28:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:08,667 INFO L471 AbstractCegarLoop]: Abstraction has 19732 states and 33948 transitions. [2025-03-08 05:28:08,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:28:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 19732 states and 33948 transitions. [2025-03-08 05:28:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 05:28:08,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:08,672 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:08,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:28:08,672 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:08,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:08,672 INFO L85 PathProgramCache]: Analyzing trace with hash -215281138, now seen corresponding path program 1 times [2025-03-08 05:28:08,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:08,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224621083] [2025-03-08 05:28:08,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:08,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:08,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 05:28:08,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 05:28:08,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:08,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:28:08,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:08,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224621083] [2025-03-08 05:28:08,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224621083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:08,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:08,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:08,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986871772] [2025-03-08 05:28:08,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:08,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:08,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:08,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:08,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:08,800 INFO L87 Difference]: Start difference. First operand 19732 states and 33948 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 05:28:10,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:10,703 INFO L93 Difference]: Finished difference Result 59333 states and 109141 transitions. [2025-03-08 05:28:10,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:28:10,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 156 [2025-03-08 05:28:10,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:11,039 INFO L225 Difference]: With dead ends: 59333 [2025-03-08 05:28:11,039 INFO L226 Difference]: Without dead ends: 39619 [2025-03-08 05:28:11,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:11,223 INFO L435 NwaCegarLoop]: 1018 mSDtfsCounter, 893 mSDsluCounter, 3689 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 4707 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:11,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 4707 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:28:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39619 states. [2025-03-08 05:28:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39619 to 39454. [2025-03-08 05:28:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39454 states, 30116 states have (on average 1.5722207464470712) internal successors, (47349), 31210 states have internal predecessors, (47349), 7268 states have call successors, (7268), 2054 states have call predecessors, (7268), 2069 states have return successors, (16832), 7229 states have call predecessors, (16832), 7234 states have call successors, (16832) [2025-03-08 05:28:13,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39454 states to 39454 states and 71449 transitions. [2025-03-08 05:28:13,526 INFO L78 Accepts]: Start accepts. Automaton has 39454 states and 71449 transitions. Word has length 156 [2025-03-08 05:28:13,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:13,527 INFO L471 AbstractCegarLoop]: Abstraction has 39454 states and 71449 transitions. [2025-03-08 05:28:13,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 05:28:13,527 INFO L276 IsEmpty]: Start isEmpty. Operand 39454 states and 71449 transitions. [2025-03-08 05:28:13,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 05:28:13,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:13,532 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:13,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:28:13,532 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:13,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash -887157402, now seen corresponding path program 1 times [2025-03-08 05:28:13,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:13,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066187252] [2025-03-08 05:28:13,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:13,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:13,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 05:28:13,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 05:28:13,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:13,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 05:28:13,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:13,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066187252] [2025-03-08 05:28:13,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066187252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:13,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:13,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:13,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966607063] [2025-03-08 05:28:13,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:13,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:13,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:13,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:13,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:13,602 INFO L87 Difference]: Start difference. First operand 39454 states and 71449 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:28:15,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:15,686 INFO L93 Difference]: Finished difference Result 79210 states and 148625 transitions. [2025-03-08 05:28:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:28:15,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 157 [2025-03-08 05:28:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:15,988 INFO L225 Difference]: With dead ends: 79210 [2025-03-08 05:28:15,989 INFO L226 Difference]: Without dead ends: 39774 [2025-03-08 05:28:16,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:28:16,352 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 10 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:16,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2667 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39774 states. [2025-03-08 05:28:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39774 to 39646. [2025-03-08 05:28:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39646 states, 30292 states have (on average 1.569424270434438) internal successors, (47541), 31386 states have internal predecessors, (47541), 7268 states have call successors, (7268), 2086 states have call predecessors, (7268), 2085 states have return successors, (16816), 7213 states have call predecessors, (16816), 7234 states have call successors, (16816) [2025-03-08 05:28:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39646 states to 39646 states and 71625 transitions. [2025-03-08 05:28:18,466 INFO L78 Accepts]: Start accepts. Automaton has 39646 states and 71625 transitions. Word has length 157 [2025-03-08 05:28:18,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:18,466 INFO L471 AbstractCegarLoop]: Abstraction has 39646 states and 71625 transitions. [2025-03-08 05:28:18,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 05:28:18,467 INFO L276 IsEmpty]: Start isEmpty. Operand 39646 states and 71625 transitions. [2025-03-08 05:28:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 05:28:18,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:18,474 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:18,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:28:18,475 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:18,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:18,475 INFO L85 PathProgramCache]: Analyzing trace with hash 602919006, now seen corresponding path program 1 times [2025-03-08 05:28:18,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:18,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496649710] [2025-03-08 05:28:18,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:18,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:18,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 05:28:18,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 05:28:18,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:18,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:18,678 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-08 05:28:18,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496649710] [2025-03-08 05:28:18,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496649710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:28:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616468165] [2025-03-08 05:28:18,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:18,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:28:18,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:18,681 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:28:18,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:28:18,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 05:28:18,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 05:28:18,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:18,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:18,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 1750 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:28:19,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:28:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 05:28:19,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:28:19,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616468165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:19,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:28:19,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 05:28:19,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285592861] [2025-03-08 05:28:19,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:19,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:28:19,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:19,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:28:19,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:19,028 INFO L87 Difference]: Start difference. First operand 39646 states and 71625 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:28:22,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:22,474 INFO L93 Difference]: Finished difference Result 117791 states and 216367 transitions. [2025-03-08 05:28:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:28:22,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2025-03-08 05:28:22,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:23,222 INFO L225 Difference]: With dead ends: 117791 [2025-03-08 05:28:23,222 INFO L226 Difference]: Without dead ends: 78194 [2025-03-08 05:28:23,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:23,454 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 904 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:23,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 1822 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:23,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78194 states. [2025-03-08 05:28:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78194 to 77629. [2025-03-08 05:28:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77629 states, 59510 states have (on average 1.5726432532347505) internal successors, (93588), 61583 states have internal predecessors, (93588), 14049 states have call successors, (14049), 4038 states have call predecessors, (14049), 4069 states have return successors, (33271), 14055 states have call predecessors, (33271), 13983 states have call successors, (33271) [2025-03-08 05:28:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77629 states to 77629 states and 140908 transitions. [2025-03-08 05:28:27,157 INFO L78 Accepts]: Start accepts. Automaton has 77629 states and 140908 transitions. Word has length 168 [2025-03-08 05:28:27,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:27,158 INFO L471 AbstractCegarLoop]: Abstraction has 77629 states and 140908 transitions. [2025-03-08 05:28:27,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:28:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 77629 states and 140908 transitions. [2025-03-08 05:28:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 05:28:27,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:27,164 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:27,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:28:27,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:28:27,365 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:27,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:27,365 INFO L85 PathProgramCache]: Analyzing trace with hash 309515999, now seen corresponding path program 1 times [2025-03-08 05:28:27,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:27,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753922232] [2025-03-08 05:28:27,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:27,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:27,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 05:28:27,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 05:28:27,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:27,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-08 05:28:27,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:27,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753922232] [2025-03-08 05:28:27,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753922232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:28:27,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327625212] [2025-03-08 05:28:27,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:27,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:28:27,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:27,506 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:28:27,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:28:27,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 05:28:27,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 05:28:27,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:27,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:27,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 1749 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 05:28:27,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:28:27,865 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 05:28:27,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:28:27,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327625212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:27,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:28:27,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-08 05:28:27,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322619670] [2025-03-08 05:28:27,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:27,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:27,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:27,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:27,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:28:27,868 INFO L87 Difference]: Start difference. First operand 77629 states and 140908 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 05:28:34,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:34,484 INFO L93 Difference]: Finished difference Result 190915 states and 371171 transitions. [2025-03-08 05:28:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:28:34,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 168 [2025-03-08 05:28:34,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:35,573 INFO L225 Difference]: With dead ends: 190915 [2025-03-08 05:28:35,573 INFO L226 Difference]: Without dead ends: 113256 [2025-03-08 05:28:36,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:28:36,452 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 902 mSDsluCounter, 3186 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 4093 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:36,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 4093 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:28:36,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113256 states. [2025-03-08 05:28:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113256 to 113048. [2025-03-08 05:28:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113048 states, 86789 states have (on average 1.5528926476857667) internal successors, (134774), 89558 states have internal predecessors, (134774), 20081 states have call successors, (20081), 6178 states have call predecessors, (20081), 6177 states have return successors, (55313), 19959 states have call predecessors, (55313), 19999 states have call successors, (55313) [2025-03-08 05:28:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113048 states to 113048 states and 210168 transitions. [2025-03-08 05:28:42,061 INFO L78 Accepts]: Start accepts. Automaton has 113048 states and 210168 transitions. Word has length 168 [2025-03-08 05:28:42,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:42,062 INFO L471 AbstractCegarLoop]: Abstraction has 113048 states and 210168 transitions. [2025-03-08 05:28:42,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 05:28:42,062 INFO L276 IsEmpty]: Start isEmpty. Operand 113048 states and 210168 transitions. [2025-03-08 05:28:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 05:28:42,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:42,082 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:42,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:28:42,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 05:28:42,283 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:42,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:42,284 INFO L85 PathProgramCache]: Analyzing trace with hash -539040422, now seen corresponding path program 1 times [2025-03-08 05:28:42,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:42,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767039431] [2025-03-08 05:28:42,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:42,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:42,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 05:28:42,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 05:28:42,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:42,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:42,433 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 05:28:42,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:42,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767039431] [2025-03-08 05:28:42,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767039431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:28:42,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835151123] [2025-03-08 05:28:42,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:42,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:28:42,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:42,436 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:28:42,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:28:42,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 05:28:42,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 05:28:42,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:42,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:42,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 2068 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:28:42,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:28:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:28:43,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:28:43,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835151123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:43,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:28:43,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-08 05:28:43,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728034314] [2025-03-08 05:28:43,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:43,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:28:43,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:43,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:28:43,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:28:43,180 INFO L87 Difference]: Start difference. First operand 113048 states and 210168 transitions. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 states have internal predecessors, (123), 5 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26)