./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 798a7b37 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-?-798a7b3-m [2025-03-03 14:17:59,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:17:59,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:17:59,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:17:59,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:17:59,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:17:59,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:17:59,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:17:59,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:17:59,177 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:17:59,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:17:59,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:17:59,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:17:59,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:17:59,177 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:17:59,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:17:59,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:17:59,177 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:17:59,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:17:59,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:17:59,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:17:59,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:17:59,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:17:59,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:17:59,178 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:17:59,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:17:59,178 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:17:59,178 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:17:59,178 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:17:59,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:17:59,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:17:59,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:17:59,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:17:59,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:17:59,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:17:59,178 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:17:59,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:17:59,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:17:59,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:17:59,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:17:59,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:17:59,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:17:59,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:17:59,181 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-03 14:17:59,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:17:59,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:17:59,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:17:59,618 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:17:59,619 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:17:59,620 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-03 14:18:00,754 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ccdd614/f7a2f77831b046b7abb451b7709767d1/FLAGbacff2a9b [2025-03-03 14:18:01,135 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:18:01,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product23.cil.c [2025-03-03 14:18:01,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ccdd614/f7a2f77831b046b7abb451b7709767d1/FLAGbacff2a9b [2025-03-03 14:18:01,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ccdd614/f7a2f77831b046b7abb451b7709767d1 [2025-03-03 14:18:01,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:18:01,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:18:01,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:18:01,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:18:01,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:18:01,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:18:01" (1/1) ... [2025-03-03 14:18:01,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf97972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:01, skipping insertion in model container [2025-03-03 14:18:01,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:18:01" (1/1) ... [2025-03-03 14:18:01,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:18:01,535 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-03 14:18:01,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:18:01,805 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:18:01,811 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-03-03 14:18:01,812 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [67] [2025-03-03 14:18:01,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [260] [2025-03-03 14:18:01,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [269] [2025-03-03 14:18:01,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1874] [2025-03-03 14:18:01,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1968] [2025-03-03 14:18:01,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2086] [2025-03-03 14:18:01,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2124] [2025-03-03 14:18:01,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2472] [2025-03-03 14:18:01,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2838] [2025-03-03 14:18:01,822 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-03 14:18:01,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:18:01,944 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:18:01,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:01 WrapperNode [2025-03-03 14:18:01,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:18:01,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:18:01,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:18:01,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:18:01,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:01" (1/1) ... [2025-03-03 14:18:01,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:01" (1/1) ... [2025-03-03 14:18:02,012 INFO L138 Inliner]: procedures = 94, calls = 353, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 941 [2025-03-03 14:18:02,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:18:02,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:18:02,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:18:02,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:18:02,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:01" (1/1) ... [2025-03-03 14:18:02,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:01" (1/1) ... [2025-03-03 14:18:02,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:01" (1/1) ... [2025-03-03 14:18:02,053 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-03 14:18:02,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:01" (1/1) ... [2025-03-03 14:18:02,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:01" (1/1) ... [2025-03-03 14:18:02,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:01" (1/1) ... [2025-03-03 14:18:02,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:01" (1/1) ... [2025-03-03 14:18:02,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:01" (1/1) ... [2025-03-03 14:18:02,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:01" (1/1) ... [2025-03-03 14:18:02,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:18:02,102 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:18:02,102 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:18:02,102 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:18:02,103 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:01" (1/1) ... [2025-03-03 14:18:02,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:18:02,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:02,131 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-03 14:18:02,134 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-03 14:18:02,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:18:02,151 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-03 14:18:02,151 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-03 14:18:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-03-03 14:18:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-03-03 14:18:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:18:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:18:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:18:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:18:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-03 14:18:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-03 14:18:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:18:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:18:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-03 14:18:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-03 14:18:02,152 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:18:02,152 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:18:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:18:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:18:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:18:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:18:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:18:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-03 14:18:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-03-03 14:18:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:18:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:18:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-03-03 14:18:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:18:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:18:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:18:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:18:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-03 14:18:02,154 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:18:02,154 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:18:02,154 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:18:02,154 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2025-03-03 14:18:02,154 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2025-03-03 14:18:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:18:02,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:18:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:18:02,155 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:18:02,284 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:18:02,287 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:18:02,345 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1205-1: stopRequestedAtCurrentFloor__wrappee__weight_#res#1 := stopRequestedAtCurrentFloor__wrappee__weight_~retValue_acc~12#1; [2025-03-03 14:18:02,345 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233: #res#1 := ~retValue_acc~13#1; [2025-03-03 14:18:02,348 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: #res := ~retValue_acc~4; [2025-03-03 14:18:02,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2005: #res := ~retValue_acc~19; [2025-03-03 14:18:02,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862: #res := ~retValue_acc~17; [2025-03-03 14:18:02,466 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1086-1: stopRequestedInDirection__wrappee__twothirdsfull_#res#1 := stopRequestedInDirection__wrappee__twothirdsfull_~retValue_acc~9#1; [2025-03-03 14:18:02,466 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1115: #res#1 := ~retValue_acc~10#1; [2025-03-03 14:18:02,467 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1149-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~11#1; [2025-03-03 14:18:02,482 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1278: #res := ~retValue_acc~15; [2025-03-03 14:18:02,684 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~14#1; [2025-03-03 14:18:02,753 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L681-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~6#1; [2025-03-03 14:18:02,754 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L694-1: isIdle_#res#1 := isIdle_~retValue_acc~7#1; [2025-03-03 14:18:02,759 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3496: #res := ~retValue_acc~31; [2025-03-03 14:18:02,770 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2083: #res := ~retValue_acc~21; [2025-03-03 14:18:02,772 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L356: #res := ~retValue_acc~0; [2025-03-03 14:18:02,774 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L509: #res := ~retValue_acc~1; [2025-03-03 14:18:02,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2044: #res := ~retValue_acc~20; [2025-03-03 14:18:02,921 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L552: #res := ~retValue_acc~3; [2025-03-03 14:18:02,987 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3185: #res := ~retValue_acc~30; [2025-03-03 14:18:03,082 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1046: #res := ~retValue_acc~8; [2025-03-03 14:18:03,126 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2121-1: valid_product_#res#1 := valid_product_~retValue_acc~23#1; [2025-03-03 14:18:03,126 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2469-1: main_#res#1 := main_~retValue_acc~25#1; [2025-03-03 14:18:03,134 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2949: #res := ~retValue_acc~29; [2025-03-03 14:18:03,259 INFO L? ?]: Removed 481 outVars from TransFormulas that were not future-live. [2025-03-03 14:18:03,259 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:18:03,278 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:18:03,279 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:18:03,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:18:03 BoogieIcfgContainer [2025-03-03 14:18:03,279 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:18:03,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:18:03,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:18:03,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:18:03,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:18:01" (1/3) ... [2025-03-03 14:18:03,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21545eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:18:03, skipping insertion in model container [2025-03-03 14:18:03,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:01" (2/3) ... [2025-03-03 14:18:03,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21545eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:18:03, skipping insertion in model container [2025-03-03 14:18:03,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:18:03" (3/3) ... [2025-03-03 14:18:03,290 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product23.cil.c [2025-03-03 14:18:03,300 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:18:03,306 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product23.cil.c that has 29 procedures, 611 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:18:03,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:18:03,369 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;@570e242e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:18:03,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:18:03,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 611 states, 468 states have (on average 1.6602564102564104) internal successors, (777), 486 states have internal predecessors, (777), 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-03 14:18:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:18:03,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:03,398 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-03 14:18:03,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:03,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:03,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1550551462, now seen corresponding path program 1 times [2025-03-03 14:18:03,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:03,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689139660] [2025-03-03 14:18:03,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:03,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:03,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:18:03,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:18:03,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:03,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:03,991 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-03 14:18:03,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:03,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689139660] [2025-03-03 14:18:03,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689139660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:03,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:03,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:03,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67593782] [2025-03-03 14:18:03,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:04,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:04,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:04,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:04,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:04,021 INFO L87 Difference]: Start difference. First operand has 611 states, 468 states have (on average 1.6602564102564104) internal successors, (777), 486 states have internal predecessors, (777), 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-03 14:18:04,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:04,208 INFO L93 Difference]: Finished difference Result 1219 states and 2018 transitions. [2025-03-03 14:18:04,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:04,210 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-03 14:18:04,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:04,227 INFO L225 Difference]: With dead ends: 1219 [2025-03-03 14:18:04,227 INFO L226 Difference]: Without dead ends: 616 [2025-03-03 14:18:04,236 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-03 14:18:04,238 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 91 mSDsluCounter, 4854 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5842 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-03 14:18:04,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5842 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:04,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-03-03 14:18:04,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2025-03-03 14:18:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 471 states have (on average 1.653927813163482) internal successors, (779), 489 states have internal predecessors, (779), 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-03 14:18:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1006 transitions. [2025-03-03 14:18:04,324 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1006 transitions. Word has length 115 [2025-03-03 14:18:04,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:04,325 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 1006 transitions. [2025-03-03 14:18:04,325 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-03 14:18:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1006 transitions. [2025-03-03 14:18:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:18:04,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:04,335 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-03 14:18:04,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:18:04,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:04,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1008501857, now seen corresponding path program 1 times [2025-03-03 14:18:04,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:04,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944545427] [2025-03-03 14:18:04,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:04,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:04,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:18:04,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:18:04,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:04,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:04,497 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-03 14:18:04,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:04,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944545427] [2025-03-03 14:18:04,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944545427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:04,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:04,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:04,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748807292] [2025-03-03 14:18:04,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:04,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:04,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:04,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:04,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:04,500 INFO L87 Difference]: Start difference. First operand 614 states and 1006 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-03 14:18:04,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:04,577 INFO L93 Difference]: Finished difference Result 1210 states and 1993 transitions. [2025-03-03 14:18:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:04,578 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-03 14:18:04,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:04,584 INFO L225 Difference]: With dead ends: 1210 [2025-03-03 14:18:04,584 INFO L226 Difference]: Without dead ends: 590 [2025-03-03 14:18:04,587 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-03 14:18:04,588 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 14 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2923 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-03 14:18:04,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2923 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-03 14:18:04,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-03-03 14:18:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 450 states have (on average 1.6444444444444444) internal successors, (740), 466 states have internal predecessors, (740), 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-03 14:18:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 963 transitions. [2025-03-03 14:18:04,626 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 963 transitions. Word has length 116 [2025-03-03 14:18:04,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:04,627 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 963 transitions. [2025-03-03 14:18:04,627 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-03 14:18:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 963 transitions. [2025-03-03 14:18:04,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:18:04,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:04,635 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-03 14:18:04,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:18:04,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:04,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:04,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1595390558, now seen corresponding path program 1 times [2025-03-03 14:18:04,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:04,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550203629] [2025-03-03 14:18:04,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:04,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:04,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:18:04,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:18:04,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:04,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:04,945 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-03 14:18:04,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:04,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550203629] [2025-03-03 14:18:04,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550203629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:04,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:04,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:04,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653847779] [2025-03-03 14:18:04,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:04,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:04,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:04,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:04,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:04,949 INFO L87 Difference]: Start difference. First operand 590 states and 963 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-03 14:18:05,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:05,055 INFO L93 Difference]: Finished difference Result 1173 states and 1925 transitions. [2025-03-03 14:18:05,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:05,056 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-03 14:18:05,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:05,061 INFO L225 Difference]: With dead ends: 1173 [2025-03-03 14:18:05,061 INFO L226 Difference]: Without dead ends: 584 [2025-03-03 14:18:05,065 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-03 14:18:05,067 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 77 mSDsluCounter, 4690 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 5642 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-03 14:18:05,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 5642 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:05,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-03 14:18:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2025-03-03 14:18:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 444 states have (on average 1.6373873873873874) internal successors, (727), 460 states have internal predecessors, (727), 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-03 14:18:05,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 950 transitions. [2025-03-03 14:18:05,101 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 950 transitions. Word has length 116 [2025-03-03 14:18:05,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:05,101 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 950 transitions. [2025-03-03 14:18:05,102 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-03 14:18:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 950 transitions. [2025-03-03 14:18:05,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:18:05,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:05,110 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-03 14:18:05,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:18:05,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:05,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:05,113 INFO L85 PathProgramCache]: Analyzing trace with hash 725589940, now seen corresponding path program 1 times [2025-03-03 14:18:05,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:05,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871577383] [2025-03-03 14:18:05,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:05,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:05,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:18:05,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:18:05,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:05,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:05,321 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-03 14:18:05,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:05,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871577383] [2025-03-03 14:18:05,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871577383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:05,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:05,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:05,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883137389] [2025-03-03 14:18:05,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:05,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:05,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:05,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:05,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:05,323 INFO L87 Difference]: Start difference. First operand 584 states and 950 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-03 14:18:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:05,394 INFO L93 Difference]: Finished difference Result 1161 states and 1899 transitions. [2025-03-03 14:18:05,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:05,394 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-03 14:18:05,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:05,398 INFO L225 Difference]: With dead ends: 1161 [2025-03-03 14:18:05,398 INFO L226 Difference]: Without dead ends: 578 [2025-03-03 14:18:05,400 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-03 14:18:05,401 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 63 mSDsluCounter, 4642 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5582 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-03 14:18:05,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5582 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:05,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-03 14:18:05,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-03-03 14:18:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 438 states have (on average 1.63013698630137) internal successors, (714), 454 states have internal predecessors, (714), 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-03 14:18:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 937 transitions. [2025-03-03 14:18:05,420 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 937 transitions. Word has length 117 [2025-03-03 14:18:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:05,420 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 937 transitions. [2025-03-03 14:18:05,420 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-03 14:18:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 937 transitions. [2025-03-03 14:18:05,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:18:05,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:05,423 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-03 14:18:05,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:18:05,423 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:05,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:05,424 INFO L85 PathProgramCache]: Analyzing trace with hash -922433476, now seen corresponding path program 1 times [2025-03-03 14:18:05,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:05,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40787507] [2025-03-03 14:18:05,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:05,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:05,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:18:05,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:18:05,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:05,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:05,604 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-03 14:18:05,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:05,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40787507] [2025-03-03 14:18:05,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40787507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:05,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:05,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:05,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825034942] [2025-03-03 14:18:05,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:05,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:05,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:05,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:05,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:05,606 INFO L87 Difference]: Start difference. First operand 578 states and 937 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-03 14:18:05,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:05,669 INFO L93 Difference]: Finished difference Result 1149 states and 1873 transitions. [2025-03-03 14:18:05,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:05,670 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-03 14:18:05,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:05,674 INFO L225 Difference]: With dead ends: 1149 [2025-03-03 14:18:05,674 INFO L226 Difference]: Without dead ends: 572 [2025-03-03 14:18:05,677 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-03 14:18:05,678 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 49 mSDsluCounter, 4594 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5522 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-03 14:18:05,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5522 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:05,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-03 14:18:05,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-03-03 14:18:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 432 states have (on average 1.6226851851851851) internal successors, (701), 448 states have internal predecessors, (701), 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-03 14:18:05,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 924 transitions. [2025-03-03 14:18:05,708 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 924 transitions. Word has length 118 [2025-03-03 14:18:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:05,709 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 924 transitions. [2025-03-03 14:18:05,709 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-03 14:18:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 924 transitions. [2025-03-03 14:18:05,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:18:05,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:05,713 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-03 14:18:05,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:18:05,713 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:05,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:05,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1028136844, now seen corresponding path program 1 times [2025-03-03 14:18:05,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:05,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559432563] [2025-03-03 14:18:05,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:05,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:05,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:18:05,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:18:05,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:05,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:05,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-03 14:18:05,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:05,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559432563] [2025-03-03 14:18:05,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559432563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:05,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:05,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:05,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49939566] [2025-03-03 14:18:05,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:05,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:05,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:05,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:05,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:05,889 INFO L87 Difference]: Start difference. First operand 572 states and 924 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-03 14:18:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:05,949 INFO L93 Difference]: Finished difference Result 1137 states and 1847 transitions. [2025-03-03 14:18:05,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:05,950 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-03 14:18:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:05,954 INFO L225 Difference]: With dead ends: 1137 [2025-03-03 14:18:05,955 INFO L226 Difference]: Without dead ends: 572 [2025-03-03 14:18:05,958 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-03 14:18:05,959 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 24 mSDsluCounter, 4558 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5474 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-03 14:18:05,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5474 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:05,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-03 14:18:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-03-03 14:18:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 432 states have (on average 1.6203703703703705) internal successors, (700), 448 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-03 14:18:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 923 transitions. [2025-03-03 14:18:05,981 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 923 transitions. Word has length 118 [2025-03-03 14:18:05,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:05,982 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 923 transitions. [2025-03-03 14:18:05,982 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-03 14:18:05,982 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 923 transitions. [2025-03-03 14:18:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:18:05,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:05,984 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-03 14:18:05,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:18:05,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:05,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:05,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1055526642, now seen corresponding path program 1 times [2025-03-03 14:18:05,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:05,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81680247] [2025-03-03 14:18:05,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:05,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:05,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:18:06,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:18:06,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:06,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:06,099 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-03 14:18:06,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:06,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81680247] [2025-03-03 14:18:06,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81680247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:06,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:06,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:06,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419529329] [2025-03-03 14:18:06,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:06,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:06,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:06,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:06,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:06,101 INFO L87 Difference]: Start difference. First operand 572 states and 923 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-03 14:18:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:06,144 INFO L93 Difference]: Finished difference Result 1128 states and 1832 transitions. [2025-03-03 14:18:06,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:06,145 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-03 14:18:06,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:06,148 INFO L225 Difference]: With dead ends: 1128 [2025-03-03 14:18:06,148 INFO L226 Difference]: Without dead ends: 572 [2025-03-03 14:18:06,151 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-03 14:18:06,151 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 15 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2709 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-03 14:18:06,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2709 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-03 14:18:06,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-03-03 14:18:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 432 states have (on average 1.6180555555555556) internal successors, (699), 448 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-03 14:18:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 922 transitions. [2025-03-03 14:18:06,171 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 922 transitions. Word has length 119 [2025-03-03 14:18:06,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:06,171 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 922 transitions. [2025-03-03 14:18:06,172 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-03 14:18:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 922 transitions. [2025-03-03 14:18:06,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:18:06,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:06,174 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-03 14:18:06,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:18:06,174 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:06,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:06,175 INFO L85 PathProgramCache]: Analyzing trace with hash 941233156, now seen corresponding path program 1 times [2025-03-03 14:18:06,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:06,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392510567] [2025-03-03 14:18:06,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:06,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:06,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:18:06,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:18:06,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:06,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:06,287 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-03 14:18:06,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:06,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392510567] [2025-03-03 14:18:06,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392510567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:06,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:06,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:06,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199111163] [2025-03-03 14:18:06,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:06,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:06,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:06,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:06,289 INFO L87 Difference]: Start difference. First operand 572 states and 922 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-03 14:18:06,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:06,328 INFO L93 Difference]: Finished difference Result 1128 states and 1830 transitions. [2025-03-03 14:18:06,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:06,329 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-03 14:18:06,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:06,333 INFO L225 Difference]: With dead ends: 1128 [2025-03-03 14:18:06,333 INFO L226 Difference]: Without dead ends: 572 [2025-03-03 14:18:06,336 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-03 14:18:06,336 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 14 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2711 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-03 14:18:06,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2711 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-03 14:18:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-03-03 14:18:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 432 states have (on average 1.6157407407407407) internal successors, (698), 448 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-03 14:18:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 921 transitions. [2025-03-03 14:18:06,356 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 921 transitions. Word has length 120 [2025-03-03 14:18:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:06,356 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 921 transitions. [2025-03-03 14:18:06,356 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-03 14:18:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 921 transitions. [2025-03-03 14:18:06,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:18:06,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:06,359 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-03 14:18:06,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:18:06,360 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:06,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:06,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1265316689, now seen corresponding path program 1 times [2025-03-03 14:18:06,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:06,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304446764] [2025-03-03 14:18:06,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:06,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:06,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:18:06,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:18:06,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:06,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:06,486 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-03 14:18:06,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:06,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304446764] [2025-03-03 14:18:06,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304446764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:06,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:06,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:06,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068989690] [2025-03-03 14:18:06,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:06,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:06,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:06,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:06,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:06,488 INFO L87 Difference]: Start difference. First operand 572 states and 921 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-03 14:18:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:06,529 INFO L93 Difference]: Finished difference Result 1128 states and 1828 transitions. [2025-03-03 14:18:06,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:06,530 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-03 14:18:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:06,533 INFO L225 Difference]: With dead ends: 1128 [2025-03-03 14:18:06,533 INFO L226 Difference]: Without dead ends: 572 [2025-03-03 14:18:06,537 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-03 14:18:06,538 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 13 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2713 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-03 14:18:06,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2713 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:06,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-03 14:18:06,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-03-03 14:18:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 432 states have (on average 1.6134259259259258) internal successors, (697), 448 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-03 14:18:06,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 920 transitions. [2025-03-03 14:18:06,562 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 920 transitions. Word has length 121 [2025-03-03 14:18:06,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:06,563 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 920 transitions. [2025-03-03 14:18:06,563 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-03 14:18:06,563 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 920 transitions. [2025-03-03 14:18:06,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:18:06,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:06,565 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-03 14:18:06,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:18:06,566 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:06,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:06,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1276043559, now seen corresponding path program 1 times [2025-03-03 14:18:06,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:06,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11942419] [2025-03-03 14:18:06,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:06,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:06,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:18:06,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:18:06,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:06,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:06,697 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-03 14:18:06,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:06,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11942419] [2025-03-03 14:18:06,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11942419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:06,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:06,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:06,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033370754] [2025-03-03 14:18:06,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:06,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:06,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:06,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:06,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:06,698 INFO L87 Difference]: Start difference. First operand 572 states and 920 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-03 14:18:06,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:06,746 INFO L93 Difference]: Finished difference Result 1128 states and 1826 transitions. [2025-03-03 14:18:06,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:06,747 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-03 14:18:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:06,752 INFO L225 Difference]: With dead ends: 1128 [2025-03-03 14:18:06,752 INFO L226 Difference]: Without dead ends: 572 [2025-03-03 14:18:06,756 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-03 14:18:06,756 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 12 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2715 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-03 14:18:06,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2715 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:06,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-03 14:18:06,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-03-03 14:18:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 432 states have (on average 1.6111111111111112) internal successors, (696), 448 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-03 14:18:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 919 transitions. [2025-03-03 14:18:06,779 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 919 transitions. Word has length 122 [2025-03-03 14:18:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:06,780 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 919 transitions. [2025-03-03 14:18:06,780 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-03 14:18:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 919 transitions. [2025-03-03 14:18:06,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:18:06,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:06,783 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-03 14:18:06,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:18:06,783 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:06,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:06,784 INFO L85 PathProgramCache]: Analyzing trace with hash 162648468, now seen corresponding path program 1 times [2025-03-03 14:18:06,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:06,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207866419] [2025-03-03 14:18:06,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:06,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:06,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:18:06,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:18:06,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:06,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:06,949 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-03 14:18:06,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:06,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207866419] [2025-03-03 14:18:06,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207866419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:18:06,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218710382] [2025-03-03 14:18:06,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:06,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:06,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:06,953 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-03 14:18:06,955 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-03 14:18:07,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:18:07,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:18:07,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:07,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:07,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 1638 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:18:07,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:18:07,361 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-03 14:18:07,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:18:07,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218710382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:07,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:18:07,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:18:07,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133412486] [2025-03-03 14:18:07,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:07,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:18:07,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:07,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:18:07,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:07,364 INFO L87 Difference]: Start difference. First operand 572 states and 919 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-03 14:18:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:07,420 INFO L93 Difference]: Finished difference Result 1627 states and 2645 transitions. [2025-03-03 14:18:07,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:18:07,421 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-03 14:18:07,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:07,427 INFO L225 Difference]: With dead ends: 1627 [2025-03-03 14:18:07,427 INFO L226 Difference]: Without dead ends: 1073 [2025-03-03 14:18:07,430 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-03 14:18:07,431 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 843 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 2388 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-03 14:18:07,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 2388 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:07,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2025-03-03 14:18:07,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1058. [2025-03-03 14:18:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 806 states have (on average 1.6228287841191067) internal successors, (1308), 837 states have internal predecessors, (1308), 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-03 14:18:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1712 transitions. [2025-03-03 14:18:07,474 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1712 transitions. Word has length 123 [2025-03-03 14:18:07,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:07,474 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1712 transitions. [2025-03-03 14:18:07,475 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-03 14:18:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1712 transitions. [2025-03-03 14:18:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:18:07,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:07,479 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-03 14:18:07,489 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-03 14:18:07,683 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-03 14:18:07,683 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:07,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash 249631560, now seen corresponding path program 1 times [2025-03-03 14:18:07,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:07,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863876315] [2025-03-03 14:18:07,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:07,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:07,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:18:07,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:18:07,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:07,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:07,836 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-03 14:18:07,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:07,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863876315] [2025-03-03 14:18:07,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863876315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:18:07,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041989512] [2025-03-03 14:18:07,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:07,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:07,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:07,838 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-03 14:18:07,840 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-03 14:18:07,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:18:08,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:18:08,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:08,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:08,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:18:08,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:18:08,272 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-03 14:18:08,272 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:18:08,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041989512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:08,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:18:08,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:18:08,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951348790] [2025-03-03 14:18:08,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:08,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:18:08,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:08,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:18:08,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:08,275 INFO L87 Difference]: Start difference. First operand 1058 states and 1712 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-03 14:18:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:08,351 INFO L93 Difference]: Finished difference Result 2599 states and 4233 transitions. [2025-03-03 14:18:08,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:18:08,352 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-03 14:18:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:08,363 INFO L225 Difference]: With dead ends: 2599 [2025-03-03 14:18:08,364 INFO L226 Difference]: Without dead ends: 1559 [2025-03-03 14:18:08,370 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-03 14:18:08,372 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 842 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 2450 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-03 14:18:08,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 2450 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2025-03-03 14:18:08,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1511. [2025-03-03 14:18:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1153 states have (on average 1.6339982653946228) internal successors, (1884), 1199 states have internal predecessors, (1884), 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-03 14:18:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2463 transitions. [2025-03-03 14:18:08,438 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2463 transitions. Word has length 124 [2025-03-03 14:18:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:08,439 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 2463 transitions. [2025-03-03 14:18:08,440 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-03 14:18:08,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2463 transitions. [2025-03-03 14:18:08,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:18:08,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:08,447 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-03 14:18:08,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:18:08,647 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-03 14:18:08,648 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:08,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:08,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1833470413, now seen corresponding path program 1 times [2025-03-03 14:18:08,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:08,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82493327] [2025-03-03 14:18:08,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:08,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:08,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:18:08,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:18:08,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:08,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:08,797 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-03 14:18:08,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:08,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82493327] [2025-03-03 14:18:08,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82493327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:08,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:08,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:08,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325005663] [2025-03-03 14:18:08,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:08,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:08,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:08,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:08,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:08,800 INFO L87 Difference]: Start difference. First operand 1511 states and 2463 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-03 14:18:09,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:09,309 INFO L93 Difference]: Finished difference Result 4457 states and 7396 transitions. [2025-03-03 14:18:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:09,310 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-03 14:18:09,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:09,326 INFO L225 Difference]: With dead ends: 4457 [2025-03-03 14:18:09,327 INFO L226 Difference]: Without dead ends: 2964 [2025-03-03 14:18:09,335 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-03 14:18:09,335 INFO L435 NwaCegarLoop]: 1021 mSDtfsCounter, 910 mSDsluCounter, 3671 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 4692 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-03 14:18:09,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 4692 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:18:09,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2025-03-03 14:18:09,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2917. [2025-03-03 14:18:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2917 states, 2227 states have (on average 1.633587786259542) internal successors, (3638), 2315 states have internal predecessors, (3638), 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-03 14:18:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4826 transitions. [2025-03-03 14:18:09,464 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4826 transitions. Word has length 126 [2025-03-03 14:18:09,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:09,464 INFO L471 AbstractCegarLoop]: Abstraction has 2917 states and 4826 transitions. [2025-03-03 14:18:09,465 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-03 14:18:09,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4826 transitions. [2025-03-03 14:18:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:18:09,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:09,471 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-03 14:18:09,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:18:09,471 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:09,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:09,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2106061788, now seen corresponding path program 1 times [2025-03-03 14:18:09,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:09,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371709491] [2025-03-03 14:18:09,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:09,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:09,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:18:09,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:18:09,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:09,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:09,633 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-03 14:18:09,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:09,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371709491] [2025-03-03 14:18:09,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371709491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:18:09,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673952635] [2025-03-03 14:18:09,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:09,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:09,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:09,637 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-03 14:18:09,638 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-03 14:18:09,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:18:09,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:18:09,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:09,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:09,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 1657 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:18:09,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:18:10,063 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-03 14:18:10,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:18:10,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673952635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:10,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:18:10,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-03 14:18:10,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60692927] [2025-03-03 14:18:10,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:10,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:10,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:10,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:10,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:18:10,067 INFO L87 Difference]: Start difference. First operand 2917 states and 4826 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-03 14:18:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:10,820 INFO L93 Difference]: Finished difference Result 7916 states and 13308 transitions. [2025-03-03 14:18:10,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:10,821 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-03 14:18:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:10,852 INFO L225 Difference]: With dead ends: 7916 [2025-03-03 14:18:10,852 INFO L226 Difference]: Without dead ends: 5017 [2025-03-03 14:18:10,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:18:10,880 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 777 mSDsluCounter, 3119 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 4008 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-03 14:18:10,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 4008 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:18:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2025-03-03 14:18:11,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 4974. [2025-03-03 14:18:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4974 states, 3792 states have (on average 1.5864978902953586) internal successors, (6016), 3938 states have internal predecessors, (6016), 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-03 14:18:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4974 states to 4974 states and 8129 transitions. [2025-03-03 14:18:11,117 INFO L78 Accepts]: Start accepts. Automaton has 4974 states and 8129 transitions. Word has length 127 [2025-03-03 14:18:11,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:11,117 INFO L471 AbstractCegarLoop]: Abstraction has 4974 states and 8129 transitions. [2025-03-03 14:18:11,121 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-03 14:18:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 4974 states and 8129 transitions. [2025-03-03 14:18:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:18:11,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:11,126 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-03 14:18:11,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:18:11,326 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-03 14:18:11,327 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:11,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:11,328 INFO L85 PathProgramCache]: Analyzing trace with hash 261750444, now seen corresponding path program 1 times [2025-03-03 14:18:11,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:11,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123124260] [2025-03-03 14:18:11,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:11,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:11,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:18:11,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:18:11,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:11,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:11,411 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-03 14:18:11,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:11,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123124260] [2025-03-03 14:18:11,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123124260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:11,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:11,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123753062] [2025-03-03 14:18:11,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:11,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:11,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:11,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:11,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:11,413 INFO L87 Difference]: Start difference. First operand 4974 states and 8129 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-03 14:18:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:11,650 INFO L93 Difference]: Finished difference Result 9954 states and 16433 transitions. [2025-03-03 14:18:11,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:11,651 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-03 14:18:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:11,685 INFO L225 Difference]: With dead ends: 9954 [2025-03-03 14:18:11,685 INFO L226 Difference]: Without dead ends: 4998 [2025-03-03 14:18:11,708 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-03 14:18:11,709 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 12 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2679 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-03 14:18:11,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2679 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:11,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4998 states. [2025-03-03 14:18:11,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4998 to 4982. [2025-03-03 14:18:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4982 states, 3798 states have (on average 1.5850447604002107) internal successors, (6020), 3944 states have internal predecessors, (6020), 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-03 14:18:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4982 states to 4982 states and 8122 transitions. [2025-03-03 14:18:11,927 INFO L78 Accepts]: Start accepts. Automaton has 4982 states and 8122 transitions. Word has length 127 [2025-03-03 14:18:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:11,928 INFO L471 AbstractCegarLoop]: Abstraction has 4982 states and 8122 transitions. [2025-03-03 14:18:11,928 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-03 14:18:11,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4982 states and 8122 transitions. [2025-03-03 14:18:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 14:18:11,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:11,937 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-03 14:18:11,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:18:11,937 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:11,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:11,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1456592072, now seen corresponding path program 1 times [2025-03-03 14:18:11,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:11,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078267006] [2025-03-03 14:18:11,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:11,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:11,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:18:11,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:18:11,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:11,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:12,065 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-03 14:18:12,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:12,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078267006] [2025-03-03 14:18:12,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078267006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:12,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:12,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:12,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150831227] [2025-03-03 14:18:12,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:12,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:12,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:12,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:12,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:12,068 INFO L87 Difference]: Start difference. First operand 4982 states and 8122 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-03 14:18:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:12,759 INFO L93 Difference]: Finished difference Result 14879 states and 25017 transitions. [2025-03-03 14:18:12,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:12,759 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-03 14:18:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:12,822 INFO L225 Difference]: With dead ends: 14879 [2025-03-03 14:18:12,822 INFO L226 Difference]: Without dead ends: 9915 [2025-03-03 14:18:12,849 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-03 14:18:12,849 INFO L435 NwaCegarLoop]: 989 mSDtfsCounter, 903 mSDsluCounter, 3583 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 4572 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:12,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 4572 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:18:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9915 states. [2025-03-03 14:18:13,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9915 to 9846. [2025-03-03 14:18:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9846 states, 7508 states have (on average 1.5808470964304742) internal successors, (11869), 7794 states have internal predecessors, (11869), 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-03 14:18:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 16427 transitions. [2025-03-03 14:18:13,302 INFO L78 Accepts]: Start accepts. Automaton has 9846 states and 16427 transitions. Word has length 135 [2025-03-03 14:18:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:13,303 INFO L471 AbstractCegarLoop]: Abstraction has 9846 states and 16427 transitions. [2025-03-03 14:18:13,303 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-03 14:18:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 9846 states and 16427 transitions. [2025-03-03 14:18:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:18:13,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:13,308 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-03 14:18:13,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:18:13,308 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:13,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash 355737613, now seen corresponding path program 1 times [2025-03-03 14:18:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:13,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205851884] [2025-03-03 14:18:13,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:13,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:13,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:18:13,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:18:13,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:13,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:13,399 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-03 14:18:13,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:13,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205851884] [2025-03-03 14:18:13,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205851884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:13,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:13,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:13,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046615762] [2025-03-03 14:18:13,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:13,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:13,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:13,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:13,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:13,403 INFO L87 Difference]: Start difference. First operand 9846 states and 16427 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-03 14:18:13,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:13,838 INFO L93 Difference]: Finished difference Result 19746 states and 33427 transitions. [2025-03-03 14:18:13,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:13,839 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-03 14:18:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:13,891 INFO L225 Difference]: With dead ends: 19746 [2025-03-03 14:18:13,892 INFO L226 Difference]: Without dead ends: 9918 [2025-03-03 14:18:13,936 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-03 14:18:13,937 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 12 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2670 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-03 14:18:13,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2670 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:13,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9918 states. [2025-03-03 14:18:14,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9918 to 9886. [2025-03-03 14:18:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9886 states, 7544 states have (on average 1.5786055143160127) internal successors, (11909), 7822 states have internal predecessors, (11909), 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-03 14:18:14,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9886 states to 9886 states and 16451 transitions. [2025-03-03 14:18:14,255 INFO L78 Accepts]: Start accepts. Automaton has 9886 states and 16451 transitions. Word has length 136 [2025-03-03 14:18:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:14,256 INFO L471 AbstractCegarLoop]: Abstraction has 9886 states and 16451 transitions. [2025-03-03 14:18:14,256 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-03 14:18:14,256 INFO L276 IsEmpty]: Start isEmpty. Operand 9886 states and 16451 transitions. [2025-03-03 14:18:14,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 14:18:14,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:14,261 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-03 14:18:14,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:18:14,261 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:14,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:14,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1173756249, now seen corresponding path program 1 times [2025-03-03 14:18:14,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:14,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293172017] [2025-03-03 14:18:14,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:14,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:14,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 14:18:14,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 14:18:14,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:14,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:14,444 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-03 14:18:14,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:14,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293172017] [2025-03-03 14:18:14,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293172017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:14,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:14,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:14,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114295524] [2025-03-03 14:18:14,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:14,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:14,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:14,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:14,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:14,446 INFO L87 Difference]: Start difference. First operand 9886 states and 16451 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-03 14:18:15,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:15,337 INFO L93 Difference]: Finished difference Result 29669 states and 51595 transitions. [2025-03-03 14:18:15,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:15,338 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-03 14:18:15,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:15,452 INFO L225 Difference]: With dead ends: 29669 [2025-03-03 14:18:15,452 INFO L226 Difference]: Without dead ends: 19801 [2025-03-03 14:18:15,511 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-03 14:18:15,512 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 900 mSDsluCounter, 3592 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 4580 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-03 14:18:15,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 4580 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:18:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19801 states. [2025-03-03 14:18:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19801 to 19700. [2025-03-03 14:18:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19700 states, 15036 states have (on average 1.5750864591646714) internal successors, (23683), 15586 states have internal predecessors, (23683), 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-03 14:18:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19700 states to 19700 states and 33936 transitions. [2025-03-03 14:18:16,490 INFO L78 Accepts]: Start accepts. Automaton has 19700 states and 33936 transitions. Word has length 145 [2025-03-03 14:18:16,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:16,492 INFO L471 AbstractCegarLoop]: Abstraction has 19700 states and 33936 transitions. [2025-03-03 14:18:16,492 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-03 14:18:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand 19700 states and 33936 transitions. [2025-03-03 14:18:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 14:18:16,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:16,497 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-03 14:18:16,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:18:16,498 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:16,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:16,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1199598061, now seen corresponding path program 1 times [2025-03-03 14:18:16,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:16,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528573149] [2025-03-03 14:18:16,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:16,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:16,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 14:18:16,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 14:18:16,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:16,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:16,598 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-03 14:18:16,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:16,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528573149] [2025-03-03 14:18:16,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528573149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:16,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:16,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:16,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432190018] [2025-03-03 14:18:16,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:16,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:16,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:16,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:16,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:16,600 INFO L87 Difference]: Start difference. First operand 19700 states and 33936 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-03 14:18:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:17,588 INFO L93 Difference]: Finished difference Result 39526 states and 69656 transitions. [2025-03-03 14:18:17,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:17,588 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-03 14:18:17,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:17,699 INFO L225 Difference]: With dead ends: 39526 [2025-03-03 14:18:17,699 INFO L226 Difference]: Without dead ends: 19844 [2025-03-03 14:18:17,834 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-03 14:18:17,835 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 11 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2670 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:17,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2670 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19844 states. [2025-03-03 14:18:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19844 to 19780. [2025-03-03 14:18:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19780 states, 15108 states have (on average 1.5728752978554408) internal successors, (23763), 15658 states have internal predecessors, (23763), 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-03 14:18:18,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19780 states to 19780 states and 33996 transitions. [2025-03-03 14:18:18,588 INFO L78 Accepts]: Start accepts. Automaton has 19780 states and 33996 transitions. Word has length 146 [2025-03-03 14:18:18,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:18,589 INFO L471 AbstractCegarLoop]: Abstraction has 19780 states and 33996 transitions. [2025-03-03 14:18:18,589 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-03 14:18:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 19780 states and 33996 transitions. [2025-03-03 14:18:18,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 14:18:18,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:18,595 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-03 14:18:18,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:18:18,596 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:18,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:18,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1699975760, now seen corresponding path program 1 times [2025-03-03 14:18:18,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:18,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097015478] [2025-03-03 14:18:18,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:18,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:18,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 14:18:18,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 14:18:18,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:18,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:18,723 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-03 14:18:18,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:18,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097015478] [2025-03-03 14:18:18,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097015478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:18,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:18,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:18,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650037513] [2025-03-03 14:18:18,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:18,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:18,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:18,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:18,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:18,725 INFO L87 Difference]: Start difference. First operand 19780 states and 33996 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-03 14:18:20,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:20,683 INFO L93 Difference]: Finished difference Result 59477 states and 109285 transitions. [2025-03-03 14:18:20,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:20,684 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-03 14:18:20,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:21,017 INFO L225 Difference]: With dead ends: 59477 [2025-03-03 14:18:21,018 INFO L226 Difference]: Without dead ends: 39715 [2025-03-03 14:18:21,215 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-03 14:18:21,216 INFO L435 NwaCegarLoop]: 980 mSDtfsCounter, 896 mSDsluCounter, 3579 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 4559 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:21,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 4559 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:18:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39715 states. [2025-03-03 14:18:22,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39715 to 39550. [2025-03-03 14:18:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39550 states, 30212 states have (on average 1.570402489077188) internal successors, (47445), 31306 states have internal predecessors, (47445), 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-03 14:18:23,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39550 states to 39550 states and 71545 transitions. [2025-03-03 14:18:23,281 INFO L78 Accepts]: Start accepts. Automaton has 39550 states and 71545 transitions. Word has length 156 [2025-03-03 14:18:23,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:23,281 INFO L471 AbstractCegarLoop]: Abstraction has 39550 states and 71545 transitions. [2025-03-03 14:18:23,282 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-03 14:18:23,282 INFO L276 IsEmpty]: Start isEmpty. Operand 39550 states and 71545 transitions. [2025-03-03 14:18:23,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 14:18:23,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:23,288 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-03 14:18:23,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:18:23,288 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:23,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:23,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1582732125, now seen corresponding path program 1 times [2025-03-03 14:18:23,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:23,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099359552] [2025-03-03 14:18:23,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:23,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:23,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 14:18:23,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 14:18:23,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:23,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:23,363 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-03 14:18:23,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:23,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099359552] [2025-03-03 14:18:23,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099359552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:23,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:23,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:23,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3159935] [2025-03-03 14:18:23,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:23,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:23,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:23,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:23,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:23,366 INFO L87 Difference]: Start difference. First operand 39550 states and 71545 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-03 14:18:25,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:25,627 INFO L93 Difference]: Finished difference Result 79402 states and 148817 transitions. [2025-03-03 14:18:25,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:25,628 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-03 14:18:25,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:25,960 INFO L225 Difference]: With dead ends: 79402 [2025-03-03 14:18:25,960 INFO L226 Difference]: Without dead ends: 39870 [2025-03-03 14:18:26,388 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-03 14:18:26,389 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 10 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2670 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-03 14:18:26,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2670 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39870 states. [2025-03-03 14:18:27,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39870 to 39742. [2025-03-03 14:18:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39742 states, 30388 states have (on average 1.5676253784388574) internal successors, (47637), 31482 states have internal predecessors, (47637), 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-03 14:18:28,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39742 states to 39742 states and 71721 transitions. [2025-03-03 14:18:28,171 INFO L78 Accepts]: Start accepts. Automaton has 39742 states and 71721 transitions. Word has length 157 [2025-03-03 14:18:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:28,171 INFO L471 AbstractCegarLoop]: Abstraction has 39742 states and 71721 transitions. [2025-03-03 14:18:28,171 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-03 14:18:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand 39742 states and 71721 transitions. [2025-03-03 14:18:28,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 14:18:28,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:28,178 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-03 14:18:28,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:18:28,178 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:28,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:28,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1376741121, now seen corresponding path program 1 times [2025-03-03 14:18:28,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:28,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910144897] [2025-03-03 14:18:28,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:28,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:28,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 14:18:28,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 14:18:28,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:28,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:28,324 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-03 14:18:28,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:28,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910144897] [2025-03-03 14:18:28,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910144897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:18:28,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009592509] [2025-03-03 14:18:28,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:28,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:28,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:28,327 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-03 14:18:28,329 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-03 14:18:28,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 14:18:28,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 14:18:28,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:28,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:28,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 1750 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:18:28,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:18:28,610 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-03 14:18:28,610 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:18:28,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009592509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:28,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:18:28,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:18:28,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223717331] [2025-03-03 14:18:28,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:28,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:18:28,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:28,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:18:28,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:28,611 INFO L87 Difference]: Start difference. First operand 39742 states and 71721 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-03 14:18:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:32,280 INFO L93 Difference]: Finished difference Result 118063 states and 216639 transitions. [2025-03-03 14:18:32,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:18:32,280 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-03 14:18:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:32,939 INFO L225 Difference]: With dead ends: 118063 [2025-03-03 14:18:32,939 INFO L226 Difference]: Without dead ends: 78370 [2025-03-03 14:18:33,172 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-03 14:18:33,173 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 905 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1823 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.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:33,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1823 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:33,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78370 states. [2025-03-03 14:18:35,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78370 to 77805. [2025-03-03 14:18:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77805 states, 59686 states have (on average 1.5709546627349797) internal successors, (93764), 61759 states have internal predecessors, (93764), 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-03 14:18:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77805 states to 77805 states and 141084 transitions. [2025-03-03 14:18:36,897 INFO L78 Accepts]: Start accepts. Automaton has 77805 states and 141084 transitions. Word has length 168 [2025-03-03 14:18:36,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:36,897 INFO L471 AbstractCegarLoop]: Abstraction has 77805 states and 141084 transitions. [2025-03-03 14:18:36,898 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-03 14:18:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 77805 states and 141084 transitions. [2025-03-03 14:18:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 14:18:36,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:36,904 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-03 14:18:36,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:18:37,104 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-03 14:18:37,105 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:37,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:37,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1083338114, now seen corresponding path program 1 times [2025-03-03 14:18:37,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:37,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994106068] [2025-03-03 14:18:37,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:37,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:37,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 14:18:37,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 14:18:37,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:37,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:37,253 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-03 14:18:37,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:37,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994106068] [2025-03-03 14:18:37,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994106068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:18:37,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866958658] [2025-03-03 14:18:37,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:37,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:37,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:37,256 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-03 14:18:37,258 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-03 14:18:37,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 14:18:37,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 14:18:37,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:37,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:37,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 1749 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:18:37,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:18:37,655 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-03 14:18:37,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:18:37,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866958658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:37,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:18:37,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-03 14:18:37,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758485099] [2025-03-03 14:18:37,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:37,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:37,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:37,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:37,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:18:37,658 INFO L87 Difference]: Start difference. First operand 77805 states and 141084 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-03 14:18:44,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:44,314 INFO L93 Difference]: Finished difference Result 191315 states and 371571 transitions. [2025-03-03 14:18:44,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:44,315 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-03 14:18:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:45,279 INFO L225 Difference]: With dead ends: 191315 [2025-03-03 14:18:45,279 INFO L226 Difference]: Without dead ends: 113480 [2025-03-03 14:18:46,275 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-03 14:18:46,276 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 903 mSDsluCounter, 3192 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 4101 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.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:46,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 4101 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 14:18:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113480 states.