./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product30.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3416b3e017f399176a4f7a837e050107ced7390b025fd07360efb8b6075a94d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:36:17,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:36:17,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:36:17,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:36:17,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:36:17,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:36:17,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:36:17,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:36:17,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:36:17,805 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:36:17,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:36:17,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:36:17,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:36:17,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:36:17,806 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:36:17,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:36:17,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:36:17,807 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:36:17,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:36:17,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:36:17,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:36:17,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:36:17,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:36:17,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:36:17,807 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:36:17,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:36:17,807 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:36:17,808 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:36:17,808 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:36:17,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:36:17,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:36:17,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:36:17,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:36:17,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:36:17,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:36:17,809 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:36:17,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:36:17,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:36:17,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:36:17,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:36:17,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:36:17,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:36:17,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:36:17,809 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3416b3e017f399176a4f7a837e050107ced7390b025fd07360efb8b6075a94d [2025-02-05 15:36:18,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:36:18,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:36:18,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:36:18,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:36:18,062 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:36:18,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product30.cil.c [2025-02-05 15:36:19,392 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f7b39733d/e20639e5c6074cf7b91d15e29b3677cf/FLAG4e7ff59f4 [2025-02-05 15:36:19,795 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:36:19,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product30.cil.c [2025-02-05 15:36:19,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f7b39733d/e20639e5c6074cf7b91d15e29b3677cf/FLAG4e7ff59f4 [2025-02-05 15:36:19,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f7b39733d/e20639e5c6074cf7b91d15e29b3677cf [2025-02-05 15:36:19,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:36:19,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:36:19,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:36:19,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:36:19,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:36:19,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:36:19" (1/1) ... [2025-02-05 15:36:19,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3febd2c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:19, skipping insertion in model container [2025-02-05 15:36:19,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:36:19" (1/1) ... [2025-02-05 15:36:20,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:36:20,280 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product30.cil.c[10611,10624] [2025-02-05 15:36:20,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:36:20,492 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:36:20,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [48] [2025-02-05 15:36:20,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [169] [2025-02-05 15:36:20,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [532] [2025-02-05 15:36:20,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [627] [2025-02-05 15:36:20,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [636] [2025-02-05 15:36:20,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1303] [2025-02-05 15:36:20,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1338] [2025-02-05 15:36:20,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [1350] [2025-02-05 15:36:20,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1533] [2025-02-05 15:36:20,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3112] [2025-02-05 15:36:20,526 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product30.cil.c[10611,10624] [2025-02-05 15:36:20,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:36:20,632 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:36:20,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:20 WrapperNode [2025-02-05 15:36:20,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:36:20,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:36:20,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:36:20,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:36:20,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:20" (1/1) ... [2025-02-05 15:36:20,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:20" (1/1) ... [2025-02-05 15:36:20,704 INFO L138 Inliner]: procedures = 95, calls = 347, calls flagged for inlining = 28, calls inlined = 24, statements flattened = 916 [2025-02-05 15:36:20,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:36:20,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:36:20,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:36:20,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:36:20,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:20" (1/1) ... [2025-02-05 15:36:20,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:20" (1/1) ... [2025-02-05 15:36:20,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:20" (1/1) ... [2025-02-05 15:36:20,749 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-02-05 15:36:20,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:20" (1/1) ... [2025-02-05 15:36:20,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:20" (1/1) ... [2025-02-05 15:36:20,773 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:20" (1/1) ... [2025-02-05 15:36:20,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:20" (1/1) ... [2025-02-05 15:36:20,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:20" (1/1) ... [2025-02-05 15:36:20,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:20" (1/1) ... [2025-02-05 15:36:20,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:36:20,800 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:36:20,800 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:36:20,800 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:36:20,801 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:20" (1/1) ... [2025-02-05 15:36:20,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:36:20,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:20,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:36:20,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:36:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:36:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-02-05 15:36:20,856 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-02-05 15:36:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-02-05 15:36:20,856 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-02-05 15:36:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:36:20,856 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:36:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:36:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:36:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:36:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:36:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-02-05 15:36:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-02-05 15:36:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:36:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:36:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:36:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:36:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-02-05 15:36:20,858 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-02-05 15:36:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:36:20,858 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:36:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:36:20,858 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:36:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:36:20,858 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:36:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:36:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:36:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-02-05 15:36:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-02-05 15:36:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:36:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:36:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:36:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:36:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:36:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:36:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:36:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:36:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:36:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:36:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:36:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:36:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:36:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-02-05 15:36:20,861 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:36:20,861 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:36:20,861 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:36:20,861 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2025-02-05 15:36:20,861 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:36:20,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:36:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:36:20,861 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:36:21,014 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:36:21,015 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:36:21,059 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: #res := ~retValue_acc~2; [2025-02-05 15:36:21,081 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L88: #res := ~retValue_acc~0; [2025-02-05 15:36:21,085 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1605: #res := ~retValue_acc~10; [2025-02-05 15:36:21,108 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1782: #res := ~retValue_acc~11; [2025-02-05 15:36:21,243 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358: #res#1 := ~retValue_acc~19#1; [2025-02-05 15:36:21,244 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2392-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~20#1; [2025-02-05 15:36:21,301 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490: #res := ~retValue_acc~23; [2025-02-05 15:36:21,312 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: #res := ~retValue_acc~1; [2025-02-05 15:36:21,497 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2319: #res := ~retValue_acc~18; [2025-02-05 15:36:21,512 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825: #res := ~retValue_acc~13; [2025-02-05 15:36:21,582 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1874-1: isEmpty_#res#1 := isEmpty_~retValue_acc~15#1; [2025-02-05 15:36:21,647 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1954-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~16#1; [2025-02-05 15:36:21,648 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1967-1: isIdle_#res#1 := isIdle_~retValue_acc~17#1; [2025-02-05 15:36:21,747 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L989: #res := ~retValue_acc~6; [2025-02-05 15:36:21,864 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2448-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~21#1; [2025-02-05 15:36:21,865 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~22#1; [2025-02-05 15:36:21,933 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L529-1: main_#res#1 := main_~retValue_acc~4#1; [2025-02-05 15:36:21,933 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1335-1: valid_product_#res#1 := valid_product_~retValue_acc~9#1; [2025-02-05 15:36:21,942 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L753: #res := ~retValue_acc~5; [2025-02-05 15:36:21,943 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1791: #res := ~retValue_acc~12; [2025-02-05 15:36:21,947 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1300: #res := ~retValue_acc~7; [2025-02-05 15:36:22,066 INFO L? ?]: Removed 462 outVars from TransFormulas that were not future-live. [2025-02-05 15:36:22,066 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:36:22,083 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:36:22,084 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:36:22,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:36:22 BoogieIcfgContainer [2025-02-05 15:36:22,084 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:36:22,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:36:22,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:36:22,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:36:22,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:36:19" (1/3) ... [2025-02-05 15:36:22,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e60bd1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:36:22, skipping insertion in model container [2025-02-05 15:36:22,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:20" (2/3) ... [2025-02-05 15:36:22,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e60bd1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:36:22, skipping insertion in model container [2025-02-05 15:36:22,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:36:22" (3/3) ... [2025-02-05 15:36:22,126 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product30.cil.c [2025-02-05 15:36:22,140 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:36:22,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product30.cil.c that has 26 procedures, 581 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:36:22,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:36:22,201 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;@7e0bb07d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:36:22,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:36:22,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 581 states, 455 states have (on average 1.6923076923076923) internal successors, (770), 479 states have internal predecessors, (770), 98 states have call successors, (98), 25 states have call predecessors, (98), 25 states have return successors, (98), 91 states have call predecessors, (98), 98 states have call successors, (98) [2025-02-05 15:36:22,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 15:36:22,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:22,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:22,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:22,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:22,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1378991143, now seen corresponding path program 1 times [2025-02-05 15:36:22,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:22,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032352753] [2025-02-05 15:36:22,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:22,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:22,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 15:36:22,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 15:36:22,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:22,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:22,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:22,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032352753] [2025-02-05 15:36:22,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032352753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:22,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:22,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:22,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563977397] [2025-02-05 15:36:22,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:22,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:22,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:22,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:22,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:22,691 INFO L87 Difference]: Start difference. First operand has 581 states, 455 states have (on average 1.6923076923076923) internal successors, (770), 479 states have internal predecessors, (770), 98 states have call successors, (98), 25 states have call predecessors, (98), 25 states have return successors, (98), 91 states have call predecessors, (98), 98 states have call successors, (98) Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:22,839 INFO L93 Difference]: Finished difference Result 1142 states and 1906 transitions. [2025-02-05 15:36:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:22,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 78 [2025-02-05 15:36:22,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:22,868 INFO L225 Difference]: With dead ends: 1142 [2025-02-05 15:36:22,868 INFO L226 Difference]: Without dead ends: 572 [2025-02-05 15:36:22,877 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-02-05 15:36:22,882 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 5 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:22,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2834 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-05 15:36:22,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-05 15:36:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 449 states have (on average 1.6859688195991092) internal successors, (757), 470 states have internal predecessors, (757), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-05 15:36:22,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 948 transitions. [2025-02-05 15:36:22,985 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 948 transitions. Word has length 78 [2025-02-05 15:36:22,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:22,987 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 948 transitions. [2025-02-05 15:36:22,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 948 transitions. [2025-02-05 15:36:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 15:36:22,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:22,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:22,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:36:22,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:22,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:22,997 INFO L85 PathProgramCache]: Analyzing trace with hash -428655324, now seen corresponding path program 1 times [2025-02-05 15:36:22,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:22,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915138914] [2025-02-05 15:36:22,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:22,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:23,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 15:36:23,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 15:36:23,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:23,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:23,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:23,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915138914] [2025-02-05 15:36:23,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915138914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:23,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:23,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:23,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080425645] [2025-02-05 15:36:23,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:23,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:23,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:23,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:23,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:23,221 INFO L87 Difference]: Start difference. First operand 572 states and 948 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:23,286 INFO L93 Difference]: Finished difference Result 1126 states and 1873 transitions. [2025-02-05 15:36:23,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:23,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2025-02-05 15:36:23,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:23,290 INFO L225 Difference]: With dead ends: 1126 [2025-02-05 15:36:23,291 INFO L226 Difference]: Without dead ends: 572 [2025-02-05 15:36:23,293 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-02-05 15:36:23,294 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 4 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:23,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2807 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-05 15:36:23,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-05 15:36:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 449 states have (on average 1.6837416481069043) internal successors, (756), 470 states have internal predecessors, (756), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-05 15:36:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 947 transitions. [2025-02-05 15:36:23,330 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 947 transitions. Word has length 79 [2025-02-05 15:36:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:23,330 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 947 transitions. [2025-02-05 15:36:23,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 947 transitions. [2025-02-05 15:36:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 15:36:23,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:23,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:23,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:36:23,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:23,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:23,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1964637654, now seen corresponding path program 1 times [2025-02-05 15:36:23,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:23,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904742694] [2025-02-05 15:36:23,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:23,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 15:36:23,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 15:36:23,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:23,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:23,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:23,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904742694] [2025-02-05 15:36:23,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904742694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:23,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:23,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:23,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371908047] [2025-02-05 15:36:23,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:23,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:23,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:23,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:23,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:23,516 INFO L87 Difference]: Start difference. First operand 572 states and 947 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:23,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:23,575 INFO L93 Difference]: Finished difference Result 1126 states and 1872 transitions. [2025-02-05 15:36:23,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:23,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2025-02-05 15:36:23,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:23,582 INFO L225 Difference]: With dead ends: 1126 [2025-02-05 15:36:23,582 INFO L226 Difference]: Without dead ends: 572 [2025-02-05 15:36:23,585 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-02-05 15:36:23,587 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 3 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2807 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-02-05 15:36:23,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2807 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:23,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-05 15:36:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-05 15:36:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 449 states have (on average 1.6815144766146994) internal successors, (755), 470 states have internal predecessors, (755), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-05 15:36:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 946 transitions. [2025-02-05 15:36:23,616 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 946 transitions. Word has length 80 [2025-02-05 15:36:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:23,618 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 946 transitions. [2025-02-05 15:36:23,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 946 transitions. [2025-02-05 15:36:23,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 15:36:23,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:23,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:23,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:36:23,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:23,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:23,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1844962305, now seen corresponding path program 1 times [2025-02-05 15:36:23,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:23,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269530519] [2025-02-05 15:36:23,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:23,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:23,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 15:36:23,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 15:36:23,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:23,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:23,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:23,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269530519] [2025-02-05 15:36:23,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269530519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:23,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:23,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:23,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507583831] [2025-02-05 15:36:23,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:23,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:23,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:23,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:23,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:23,778 INFO L87 Difference]: Start difference. First operand 572 states and 946 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:23,832 INFO L93 Difference]: Finished difference Result 1126 states and 1871 transitions. [2025-02-05 15:36:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:23,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2025-02-05 15:36:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:23,837 INFO L225 Difference]: With dead ends: 1126 [2025-02-05 15:36:23,837 INFO L226 Difference]: Without dead ends: 572 [2025-02-05 15:36:23,840 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-02-05 15:36:23,841 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 2 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:23,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2807 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:23,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-05 15:36:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-05 15:36:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 449 states have (on average 1.6792873051224944) internal successors, (754), 470 states have internal predecessors, (754), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-05 15:36:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 945 transitions. [2025-02-05 15:36:23,869 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 945 transitions. Word has length 81 [2025-02-05 15:36:23,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:23,869 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 945 transitions. [2025-02-05 15:36:23,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 945 transitions. [2025-02-05 15:36:23,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 15:36:23,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:23,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:23,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:36:23,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:23,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:23,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1132680147, now seen corresponding path program 1 times [2025-02-05 15:36:23,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:23,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870422549] [2025-02-05 15:36:23,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:23,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:23,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 15:36:23,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 15:36:23,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:23,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:24,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:24,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870422549] [2025-02-05 15:36:24,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870422549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:24,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:24,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:24,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362168464] [2025-02-05 15:36:24,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:24,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:24,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:24,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:24,013 INFO L87 Difference]: Start difference. First operand 572 states and 945 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:24,056 INFO L93 Difference]: Finished difference Result 1126 states and 1870 transitions. [2025-02-05 15:36:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:24,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 82 [2025-02-05 15:36:24,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:24,061 INFO L225 Difference]: With dead ends: 1126 [2025-02-05 15:36:24,061 INFO L226 Difference]: Without dead ends: 572 [2025-02-05 15:36:24,063 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-02-05 15:36:24,063 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 1 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:24,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2807 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-05 15:36:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-05 15:36:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 449 states have (on average 1.6770601336302895) internal successors, (753), 470 states have internal predecessors, (753), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-05 15:36:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 944 transitions. [2025-02-05 15:36:24,087 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 944 transitions. Word has length 82 [2025-02-05 15:36:24,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:24,088 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 944 transitions. [2025-02-05 15:36:24,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:24,088 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 944 transitions. [2025-02-05 15:36:24,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 15:36:24,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:24,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:24,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:36:24,091 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:24,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:24,091 INFO L85 PathProgramCache]: Analyzing trace with hash -770543906, now seen corresponding path program 1 times [2025-02-05 15:36:24,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:24,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705043232] [2025-02-05 15:36:24,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:24,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:24,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 15:36:24,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 15:36:24,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:24,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:24,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:24,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705043232] [2025-02-05 15:36:24,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705043232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:24,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:24,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:36:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146190765] [2025-02-05 15:36:24,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:24,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:36:24,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:24,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:36:24,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:24,283 INFO L87 Difference]: Start difference. First operand 572 states and 944 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:36:24,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:24,369 INFO L93 Difference]: Finished difference Result 1092 states and 1802 transitions. [2025-02-05 15:36:24,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:24,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 83 [2025-02-05 15:36:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:24,375 INFO L225 Difference]: With dead ends: 1092 [2025-02-05 15:36:24,375 INFO L226 Difference]: Without dead ends: 587 [2025-02-05 15:36:24,377 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-02-05 15:36:24,378 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 91 mSDsluCounter, 4589 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5523 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:24,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5523 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-02-05 15:36:24,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2025-02-05 15:36:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 459 states have (on average 1.673202614379085) internal successors, (768), 482 states have internal predecessors, (768), 99 states have call successors, (99), 25 states have call predecessors, (99), 26 states have return successors, (96), 91 states have call predecessors, (96), 94 states have call successors, (96) [2025-02-05 15:36:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 963 transitions. [2025-02-05 15:36:24,404 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 963 transitions. Word has length 83 [2025-02-05 15:36:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:24,404 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 963 transitions. [2025-02-05 15:36:24,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:36:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 963 transitions. [2025-02-05 15:36:24,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 15:36:24,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:24,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:24,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:36:24,410 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:24,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1010956029, now seen corresponding path program 1 times [2025-02-05 15:36:24,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:24,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396625684] [2025-02-05 15:36:24,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:24,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:24,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 15:36:24,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 15:36:24,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:24,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:24,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:24,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396625684] [2025-02-05 15:36:24,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396625684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:24,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:24,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:24,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478359560] [2025-02-05 15:36:24,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:24,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:24,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:24,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:24,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:24,502 INFO L87 Difference]: Start difference. First operand 585 states and 963 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:24,560 INFO L93 Difference]: Finished difference Result 1144 states and 1896 transitions. [2025-02-05 15:36:24,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:24,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2025-02-05 15:36:24,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:24,564 INFO L225 Difference]: With dead ends: 1144 [2025-02-05 15:36:24,564 INFO L226 Difference]: Without dead ends: 566 [2025-02-05 15:36:24,566 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-02-05 15:36:24,566 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 0 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:24,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2809 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-02-05 15:36:24,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-02-05 15:36:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 443 states have (on average 1.6681715575620768) internal successors, (739), 464 states have internal predecessors, (739), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-05 15:36:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 930 transitions. [2025-02-05 15:36:24,585 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 930 transitions. Word has length 83 [2025-02-05 15:36:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:24,586 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 930 transitions. [2025-02-05 15:36:24,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 930 transitions. [2025-02-05 15:36:24,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 15:36:24,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:24,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:24,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:36:24,589 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:24,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:24,590 INFO L85 PathProgramCache]: Analyzing trace with hash -670546755, now seen corresponding path program 1 times [2025-02-05 15:36:24,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:24,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057588734] [2025-02-05 15:36:24,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:24,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:24,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 15:36:24,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 15:36:24,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:24,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:24,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:24,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057588734] [2025-02-05 15:36:24,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057588734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:24,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:24,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:24,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470392846] [2025-02-05 15:36:24,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:24,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:24,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:24,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:24,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:24,694 INFO L87 Difference]: Start difference. First operand 566 states and 930 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:24,860 INFO L93 Difference]: Finished difference Result 1089 states and 1794 transitions. [2025-02-05 15:36:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:24,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-02-05 15:36:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:24,865 INFO L225 Difference]: With dead ends: 1089 [2025-02-05 15:36:24,865 INFO L226 Difference]: Without dead ends: 575 [2025-02-05 15:36:24,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:24,868 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 55 mSDsluCounter, 3519 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4406 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:24,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4406 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:24,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-02-05 15:36:24,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 566. [2025-02-05 15:36:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 443 states have (on average 1.6591422121896162) internal successors, (735), 464 states have internal predecessors, (735), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-05 15:36:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 926 transitions. [2025-02-05 15:36:24,888 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 926 transitions. Word has length 84 [2025-02-05 15:36:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:24,889 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 926 transitions. [2025-02-05 15:36:24,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 926 transitions. [2025-02-05 15:36:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 15:36:24,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:24,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:24,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:36:24,892 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:24,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1673747051, now seen corresponding path program 1 times [2025-02-05 15:36:24,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:24,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094263574] [2025-02-05 15:36:24,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:24,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:24,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 15:36:24,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 15:36:24,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:24,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:25,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:25,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094263574] [2025-02-05 15:36:25,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094263574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:25,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:25,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:25,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046425449] [2025-02-05 15:36:25,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:25,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:25,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:25,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:25,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:25,011 INFO L87 Difference]: Start difference. First operand 566 states and 926 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:25,152 INFO L93 Difference]: Finished difference Result 1089 states and 1790 transitions. [2025-02-05 15:36:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:25,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2025-02-05 15:36:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:25,156 INFO L225 Difference]: With dead ends: 1089 [2025-02-05 15:36:25,157 INFO L226 Difference]: Without dead ends: 575 [2025-02-05 15:36:25,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:25,161 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 54 mSDsluCounter, 3519 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4406 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:25,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4406 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-02-05 15:36:25,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 566. [2025-02-05 15:36:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 443 states have (on average 1.6501128668171559) internal successors, (731), 464 states have internal predecessors, (731), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-05 15:36:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 922 transitions. [2025-02-05 15:36:25,180 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 922 transitions. Word has length 85 [2025-02-05 15:36:25,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:25,180 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 922 transitions. [2025-02-05 15:36:25,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:25,180 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 922 transitions. [2025-02-05 15:36:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 15:36:25,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:25,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:25,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:36:25,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:25,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1665308096, now seen corresponding path program 1 times [2025-02-05 15:36:25,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:25,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827285280] [2025-02-05 15:36:25,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:25,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:25,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 15:36:25,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 15:36:25,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:25,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:25,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:25,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827285280] [2025-02-05 15:36:25,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827285280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:25,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:25,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:25,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760110638] [2025-02-05 15:36:25,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:25,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:25,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:25,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:25,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:25,305 INFO L87 Difference]: Start difference. First operand 566 states and 922 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:25,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:25,438 INFO L93 Difference]: Finished difference Result 1089 states and 1786 transitions. [2025-02-05 15:36:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:25,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2025-02-05 15:36:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:25,445 INFO L225 Difference]: With dead ends: 1089 [2025-02-05 15:36:25,445 INFO L226 Difference]: Without dead ends: 575 [2025-02-05 15:36:25,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:25,448 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 53 mSDsluCounter, 3502 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4388 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:25,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4388 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:25,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-02-05 15:36:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 566. [2025-02-05 15:36:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 443 states have (on average 1.6410835214446953) internal successors, (727), 464 states have internal predecessors, (727), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-05 15:36:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 918 transitions. [2025-02-05 15:36:25,467 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 918 transitions. Word has length 86 [2025-02-05 15:36:25,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:25,468 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 918 transitions. [2025-02-05 15:36:25,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 918 transitions. [2025-02-05 15:36:25,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 15:36:25,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:25,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:25,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:36:25,471 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:25,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:25,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1765178321, now seen corresponding path program 1 times [2025-02-05 15:36:25,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:25,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17450829] [2025-02-05 15:36:25,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:25,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:25,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 15:36:25,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 15:36:25,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:25,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:25,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:25,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17450829] [2025-02-05 15:36:25,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17450829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:25,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:25,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:36:25,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781995937] [2025-02-05 15:36:25,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:25,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:36:25,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:25,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:36:25,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:25,594 INFO L87 Difference]: Start difference. First operand 566 states and 918 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:36:25,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:25,655 INFO L93 Difference]: Finished difference Result 1080 states and 1768 transitions. [2025-02-05 15:36:25,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:25,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 86 [2025-02-05 15:36:25,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:25,661 INFO L225 Difference]: With dead ends: 1080 [2025-02-05 15:36:25,661 INFO L226 Difference]: Without dead ends: 545 [2025-02-05 15:36:25,663 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-02-05 15:36:25,664 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 84 mSDsluCounter, 4462 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5369 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:25,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5369 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-05 15:36:25,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-02-05 15:36:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 422 states have (on average 1.6421800947867298) internal successors, (693), 443 states have internal predecessors, (693), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-05 15:36:25,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 884 transitions. [2025-02-05 15:36:25,680 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 884 transitions. Word has length 86 [2025-02-05 15:36:25,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:25,680 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 884 transitions. [2025-02-05 15:36:25,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:36:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 884 transitions. [2025-02-05 15:36:25,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 15:36:25,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:25,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:25,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:36:25,684 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:25,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:25,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2119638792, now seen corresponding path program 1 times [2025-02-05 15:36:25,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:25,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968189266] [2025-02-05 15:36:25,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:25,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:25,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 15:36:25,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:36:25,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:25,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:25,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:25,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968189266] [2025-02-05 15:36:25,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968189266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:25,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:25,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:25,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049777874] [2025-02-05 15:36:25,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:25,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:25,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:25,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:25,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:25,805 INFO L87 Difference]: Start difference. First operand 545 states and 884 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:25,867 INFO L93 Difference]: Finished difference Result 1059 states and 1734 transitions. [2025-02-05 15:36:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:25,867 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 87 [2025-02-05 15:36:25,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:25,872 INFO L225 Difference]: With dead ends: 1059 [2025-02-05 15:36:25,872 INFO L226 Difference]: Without dead ends: 545 [2025-02-05 15:36:25,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:25,875 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 17 mSDsluCounter, 3459 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4326 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:25,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4326 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-05 15:36:25,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-02-05 15:36:25,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 422 states have (on average 1.6398104265402844) internal successors, (692), 443 states have internal predecessors, (692), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-05 15:36:25,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 883 transitions. [2025-02-05 15:36:25,891 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 883 transitions. Word has length 87 [2025-02-05 15:36:25,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:25,891 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 883 transitions. [2025-02-05 15:36:25,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:25,892 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 883 transitions. [2025-02-05 15:36:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 15:36:25,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:25,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:25,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:36:25,894 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:25,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:25,895 INFO L85 PathProgramCache]: Analyzing trace with hash 884617923, now seen corresponding path program 1 times [2025-02-05 15:36:25,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:25,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042057813] [2025-02-05 15:36:25,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:25,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:25,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 15:36:25,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 15:36:25,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:25,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:26,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:26,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042057813] [2025-02-05 15:36:26,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042057813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:26,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:26,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:26,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022965497] [2025-02-05 15:36:26,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:26,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:26,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:26,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:26,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:26,004 INFO L87 Difference]: Start difference. First operand 545 states and 883 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:26,064 INFO L93 Difference]: Finished difference Result 1059 states and 1733 transitions. [2025-02-05 15:36:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:26,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2025-02-05 15:36:26,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:26,068 INFO L225 Difference]: With dead ends: 1059 [2025-02-05 15:36:26,068 INFO L226 Difference]: Without dead ends: 545 [2025-02-05 15:36:26,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:26,071 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 16 mSDsluCounter, 3459 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4326 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:26,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4326 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-05 15:36:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-02-05 15:36:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 422 states have (on average 1.6374407582938388) internal successors, (691), 443 states have internal predecessors, (691), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-05 15:36:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 882 transitions. [2025-02-05 15:36:26,088 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 882 transitions. Word has length 88 [2025-02-05 15:36:26,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:26,088 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 882 transitions. [2025-02-05 15:36:26,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 882 transitions. [2025-02-05 15:36:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 15:36:26,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:26,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:26,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:36:26,091 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:26,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:26,091 INFO L85 PathProgramCache]: Analyzing trace with hash -394178469, now seen corresponding path program 1 times [2025-02-05 15:36:26,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:26,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962193177] [2025-02-05 15:36:26,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:26,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:26,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 15:36:26,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 15:36:26,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:26,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:26,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:26,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:26,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962193177] [2025-02-05 15:36:26,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962193177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:26,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:26,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:26,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001565181] [2025-02-05 15:36:26,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:26,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:26,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:26,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:26,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:26,186 INFO L87 Difference]: Start difference. First operand 545 states and 882 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:26,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:26,218 INFO L93 Difference]: Finished difference Result 1053 states and 1721 transitions. [2025-02-05 15:36:26,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:26,218 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-02-05 15:36:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:26,222 INFO L225 Difference]: With dead ends: 1053 [2025-02-05 15:36:26,223 INFO L226 Difference]: Without dead ends: 545 [2025-02-05 15:36:26,225 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-02-05 15:36:26,225 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 5 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:26,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2600 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:26,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-05 15:36:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-02-05 15:36:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 422 states have (on average 1.6350710900473933) internal successors, (690), 443 states have internal predecessors, (690), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-05 15:36:26,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 881 transitions. [2025-02-05 15:36:26,242 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 881 transitions. Word has length 89 [2025-02-05 15:36:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:26,243 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 881 transitions. [2025-02-05 15:36:26,243 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:36:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 881 transitions. [2025-02-05 15:36:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 15:36:26,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:26,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:26,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:36:26,246 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:26,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:26,246 INFO L85 PathProgramCache]: Analyzing trace with hash 124850166, now seen corresponding path program 1 times [2025-02-05 15:36:26,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:26,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988354081] [2025-02-05 15:36:26,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:26,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:26,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 15:36:26,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 15:36:26,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:26,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:26,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:26,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988354081] [2025-02-05 15:36:26,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988354081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:26,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:26,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:26,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444995502] [2025-02-05 15:36:26,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:26,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:26,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:26,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:26,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:26,455 INFO L87 Difference]: Start difference. First operand 545 states and 881 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-05 15:36:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:28,370 INFO L93 Difference]: Finished difference Result 1684 states and 2784 transitions. [2025-02-05 15:36:28,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:28,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 90 [2025-02-05 15:36:28,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:28,378 INFO L225 Difference]: With dead ends: 1684 [2025-02-05 15:36:28,379 INFO L226 Difference]: Without dead ends: 1184 [2025-02-05 15:36:28,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:36:28,381 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 1988 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 2417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:28,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2055 Valid, 1364 Invalid, 2417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 15:36:28,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2025-02-05 15:36:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1062. [2025-02-05 15:36:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 827 states have (on average 1.6541717049576783) internal successors, (1368), 857 states have internal predecessors, (1368), 190 states have call successors, (190), 43 states have call predecessors, (190), 44 states have return successors, (192), 174 states have call predecessors, (192), 185 states have call successors, (192) [2025-02-05 15:36:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1750 transitions. [2025-02-05 15:36:28,433 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1750 transitions. Word has length 90 [2025-02-05 15:36:28,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:28,434 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1750 transitions. [2025-02-05 15:36:28,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-05 15:36:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1750 transitions. [2025-02-05 15:36:28,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 15:36:28,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:28,437 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:28,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:36:28,438 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:28,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1090214251, now seen corresponding path program 1 times [2025-02-05 15:36:28,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:28,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541465230] [2025-02-05 15:36:28,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:28,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:28,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:36:28,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:36:28,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:28,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:28,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:28,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541465230] [2025-02-05 15:36:28,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541465230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:28,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:28,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 15:36:28,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601275754] [2025-02-05 15:36:28,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:28,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:36:28,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:28,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:36:28,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:36:28,793 INFO L87 Difference]: Start difference. First operand 1062 states and 1750 transitions. Second operand has 14 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 7 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-05 15:36:34,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:34,076 INFO L93 Difference]: Finished difference Result 3868 states and 6393 transitions. [2025-02-05 15:36:34,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 15:36:34,077 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 7 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 128 [2025-02-05 15:36:34,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:34,094 INFO L225 Difference]: With dead ends: 3868 [2025-02-05 15:36:34,094 INFO L226 Difference]: Without dead ends: 2851 [2025-02-05 15:36:34,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 15:36:34,101 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 2279 mSDsluCounter, 6542 mSDsCounter, 0 mSdLazyCounter, 13423 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2357 SdHoareTripleChecker+Valid, 7296 SdHoareTripleChecker+Invalid, 14067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 13423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:34,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2357 Valid, 7296 Invalid, 14067 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [644 Valid, 13423 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-02-05 15:36:34,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2025-02-05 15:36:34,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2757. [2025-02-05 15:36:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2757 states, 2074 states have (on average 1.6210221793635486) internal successors, (3362), 2150 states have internal predecessors, (3362), 566 states have call successors, (566), 99 states have call predecessors, (566), 116 states have return successors, (599), 540 states have call predecessors, (599), 561 states have call successors, (599) [2025-02-05 15:36:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 4527 transitions. [2025-02-05 15:36:34,245 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 4527 transitions. Word has length 128 [2025-02-05 15:36:34,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:34,246 INFO L471 AbstractCegarLoop]: Abstraction has 2757 states and 4527 transitions. [2025-02-05 15:36:34,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 7 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-05 15:36:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 4527 transitions. [2025-02-05 15:36:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:36:34,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:34,250 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:34,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:36:34,251 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:34,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:34,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1934020543, now seen corresponding path program 1 times [2025-02-05 15:36:34,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:34,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341848451] [2025-02-05 15:36:34,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:34,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:34,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:36:34,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:36:34,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:34,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:36:34,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:34,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341848451] [2025-02-05 15:36:34,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341848451] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:34,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436442313] [2025-02-05 15:36:34,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:34,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:34,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:34,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:36:34,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:36:34,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:36:34,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:36:34,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:34,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:34,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 1719 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:36:34,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:34,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:34,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436442313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:34,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:34,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:36:34,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106843234] [2025-02-05 15:36:34,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:34,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:36:34,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:34,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:36:34,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:36:34,841 INFO L87 Difference]: Start difference. First operand 2757 states and 4527 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:36:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:35,036 INFO L93 Difference]: Finished difference Result 8147 states and 13571 transitions. [2025-02-05 15:36:35,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:36:35,036 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2025-02-05 15:36:35,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:35,060 INFO L225 Difference]: With dead ends: 8147 [2025-02-05 15:36:35,060 INFO L226 Difference]: Without dead ends: 5437 [2025-02-05 15:36:35,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:36:35,072 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 822 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:35,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 2438 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:35,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5437 states. [2025-02-05 15:36:35,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5437 to 5392. [2025-02-05 15:36:35,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5392 states, 4065 states have (on average 1.6255842558425584) internal successors, (6608), 4208 states have internal predecessors, (6608), 1098 states have call successors, (1098), 187 states have call predecessors, (1098), 228 states have return successors, (1226), 1062 states have call predecessors, (1226), 1093 states have call successors, (1226) [2025-02-05 15:36:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5392 states to 5392 states and 8932 transitions. [2025-02-05 15:36:35,329 INFO L78 Accepts]: Start accepts. Automaton has 5392 states and 8932 transitions. Word has length 129 [2025-02-05 15:36:35,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:35,331 INFO L471 AbstractCegarLoop]: Abstraction has 5392 states and 8932 transitions. [2025-02-05 15:36:35,331 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:36:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 5392 states and 8932 transitions. [2025-02-05 15:36:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:36:35,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:35,336 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:35,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:36:35,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 15:36:35,539 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:35,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash 233280064, now seen corresponding path program 1 times [2025-02-05 15:36:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:35,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072385616] [2025-02-05 15:36:35,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:35,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:35,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:36:35,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:36:35,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:35,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:35,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:36:35,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:35,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072385616] [2025-02-05 15:36:35,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072385616] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:35,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340251840] [2025-02-05 15:36:35,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:35,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:35,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:35,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:36:35,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:36:35,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:36:36,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:36:36,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:36,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:36,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 1718 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:36:36,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:36,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:36,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340251840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:36,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:36,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:36:36,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055225074] [2025-02-05 15:36:36,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:36,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:36:36,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:36,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:36:36,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:36:36,159 INFO L87 Difference]: Start difference. First operand 5392 states and 8932 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:36:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:36,324 INFO L93 Difference]: Finished difference Result 10773 states and 17938 transitions. [2025-02-05 15:36:36,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:36,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2025-02-05 15:36:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:36,358 INFO L225 Difference]: With dead ends: 10773 [2025-02-05 15:36:36,359 INFO L226 Difference]: Without dead ends: 5428 [2025-02-05 15:36:36,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:36:36,407 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 0 mSDsluCounter, 2626 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3504 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:36,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3504 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:36,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5428 states. [2025-02-05 15:36:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5428 to 5428. [2025-02-05 15:36:36,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5428 states, 4101 states have (on average 1.6200926603267496) internal successors, (6644), 4244 states have internal predecessors, (6644), 1098 states have call successors, (1098), 187 states have call predecessors, (1098), 228 states have return successors, (1226), 1062 states have call predecessors, (1226), 1093 states have call successors, (1226) [2025-02-05 15:36:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5428 states to 5428 states and 8968 transitions. [2025-02-05 15:36:36,626 INFO L78 Accepts]: Start accepts. Automaton has 5428 states and 8968 transitions. Word has length 129 [2025-02-05 15:36:36,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:36,626 INFO L471 AbstractCegarLoop]: Abstraction has 5428 states and 8968 transitions. [2025-02-05 15:36:36,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:36:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand 5428 states and 8968 transitions. [2025-02-05 15:36:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:36:36,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:36,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:36,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:36:36,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 15:36:36,831 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:36,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:36,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1165323551, now seen corresponding path program 1 times [2025-02-05 15:36:36,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:36,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405286893] [2025-02-05 15:36:36,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:36,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:36,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:36:36,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:36:36,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:36,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:36:37,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:37,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405286893] [2025-02-05 15:36:37,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405286893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:37,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:37,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:37,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986762090] [2025-02-05 15:36:37,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:37,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:37,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:37,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:37,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:37,019 INFO L87 Difference]: Start difference. First operand 5428 states and 8968 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-05 15:36:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:39,441 INFO L93 Difference]: Finished difference Result 15915 states and 26871 transitions. [2025-02-05 15:36:39,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:39,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 132 [2025-02-05 15:36:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:39,488 INFO L225 Difference]: With dead ends: 15915 [2025-02-05 15:36:39,489 INFO L226 Difference]: Without dead ends: 10534 [2025-02-05 15:36:39,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:39,508 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 3457 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 3472 mSolverCounterSat, 1069 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3493 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 4541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1069 IncrementalHoareTripleChecker+Valid, 3472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:39,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3493 Valid, 2202 Invalid, 4541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1069 Valid, 3472 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 15:36:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10534 states. [2025-02-05 15:36:39,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10534 to 9133. [2025-02-05 15:36:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9133 states, 6650 states have (on average 1.5998496240601503) internal successors, (10639), 6983 states have internal predecessors, (10639), 2112 states have call successors, (2112), 286 states have call predecessors, (2112), 370 states have return successors, (2442), 2097 states have call predecessors, (2442), 2107 states have call successors, (2442) [2025-02-05 15:36:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9133 states to 9133 states and 15193 transitions. [2025-02-05 15:36:39,902 INFO L78 Accepts]: Start accepts. Automaton has 9133 states and 15193 transitions. Word has length 132 [2025-02-05 15:36:39,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:39,903 INFO L471 AbstractCegarLoop]: Abstraction has 9133 states and 15193 transitions. [2025-02-05 15:36:39,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-05 15:36:39,903 INFO L276 IsEmpty]: Start isEmpty. Operand 9133 states and 15193 transitions. [2025-02-05 15:36:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:36:39,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:39,908 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:39,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:36:39,908 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:39,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:39,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1570005514, now seen corresponding path program 1 times [2025-02-05 15:36:39,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:39,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938048993] [2025-02-05 15:36:39,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:39,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:39,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:36:39,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:36:39,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:39,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:36:40,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:40,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938048993] [2025-02-05 15:36:40,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938048993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:40,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:40,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:40,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347019367] [2025-02-05 15:36:40,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:40,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:40,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:40,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:40,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:40,047 INFO L87 Difference]: Start difference. First operand 9133 states and 15193 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-05 15:36:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:42,673 INFO L93 Difference]: Finished difference Result 31255 states and 53518 transitions. [2025-02-05 15:36:42,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:42,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 133 [2025-02-05 15:36:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:42,815 INFO L225 Difference]: With dead ends: 31255 [2025-02-05 15:36:42,815 INFO L226 Difference]: Without dead ends: 22170 [2025-02-05 15:36:42,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:42,863 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 3470 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 3437 mSolverCounterSat, 1091 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3507 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 4528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1091 IncrementalHoareTripleChecker+Valid, 3437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:42,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3507 Valid, 2215 Invalid, 4528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1091 Valid, 3437 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 15:36:42,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22170 states. [2025-02-05 15:36:43,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22170 to 19481. [2025-02-05 15:36:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19481 states, 13448 states have (on average 1.5794913741820344) internal successors, (21241), 14337 states have internal predecessors, (21241), 5304 states have call successors, (5304), 484 states have call predecessors, (5304), 728 states have return successors, (6446), 5403 states have call predecessors, (6446), 5299 states have call successors, (6446) [2025-02-05 15:36:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19481 states to 19481 states and 32991 transitions. [2025-02-05 15:36:43,932 INFO L78 Accepts]: Start accepts. Automaton has 19481 states and 32991 transitions. Word has length 133 [2025-02-05 15:36:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:43,932 INFO L471 AbstractCegarLoop]: Abstraction has 19481 states and 32991 transitions. [2025-02-05 15:36:43,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-05 15:36:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 19481 states and 32991 transitions. [2025-02-05 15:36:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:36:43,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:43,937 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:43,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:36:43,938 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:43,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:43,938 INFO L85 PathProgramCache]: Analyzing trace with hash 581431910, now seen corresponding path program 1 times [2025-02-05 15:36:43,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:43,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232039394] [2025-02-05 15:36:43,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:43,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:43,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:36:43,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:36:43,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:43,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:36:44,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:44,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232039394] [2025-02-05 15:36:44,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232039394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:44,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:44,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:44,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488809196] [2025-02-05 15:36:44,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:44,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:44,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:44,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:44,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:44,120 INFO L87 Difference]: Start difference. First operand 19481 states and 32991 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-05 15:36:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:48,758 INFO L93 Difference]: Finished difference Result 77487 states and 135568 transitions. [2025-02-05 15:36:48,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:48,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 134 [2025-02-05 15:36:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:49,202 INFO L225 Difference]: With dead ends: 77487 [2025-02-05 15:36:49,202 INFO L226 Difference]: Without dead ends: 58056 [2025-02-05 15:36:49,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:49,333 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 3482 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 3446 mSolverCounterSat, 1093 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3520 SdHoareTripleChecker+Valid, 2236 SdHoareTripleChecker+Invalid, 4539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1093 IncrementalHoareTripleChecker+Valid, 3446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:49,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3520 Valid, 2236 Invalid, 4539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1093 Valid, 3446 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 15:36:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58056 states. [2025-02-05 15:36:52,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58056 to 51207. [2025-02-05 15:36:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51207 states, 33534 states have (on average 1.5633983419812727) internal successors, (52427), 36157 states have internal predecessors, (52427), 15936 states have call successors, (15936), 880 states have call predecessors, (15936), 1736 states have return successors, (20550), 16551 states have call predecessors, (20550), 15931 states have call successors, (20550) [2025-02-05 15:36:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51207 states to 51207 states and 88913 transitions. [2025-02-05 15:36:52,907 INFO L78 Accepts]: Start accepts. Automaton has 51207 states and 88913 transitions. Word has length 134 [2025-02-05 15:36:52,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:52,908 INFO L471 AbstractCegarLoop]: Abstraction has 51207 states and 88913 transitions. [2025-02-05 15:36:52,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-05 15:36:52,908 INFO L276 IsEmpty]: Start isEmpty. Operand 51207 states and 88913 transitions. [2025-02-05 15:36:52,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:36:52,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:52,913 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:52,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:36:52,913 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:52,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:52,913 INFO L85 PathProgramCache]: Analyzing trace with hash 368191707, now seen corresponding path program 1 times [2025-02-05 15:36:52,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:52,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473186216] [2025-02-05 15:36:52,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:52,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:52,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:36:52,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:36:52,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:52,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:36:53,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:53,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473186216] [2025-02-05 15:36:53,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473186216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:53,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:53,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:53,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132151249] [2025-02-05 15:36:53,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:53,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:53,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:53,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:53,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:53,046 INFO L87 Difference]: Start difference. First operand 51207 states and 88913 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-05 15:37:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:04,599 INFO L93 Difference]: Finished difference Result 227575 states and 407234 transitions. [2025-02-05 15:37:04,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:04,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 135 [2025-02-05 15:37:04,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:05,870 INFO L225 Difference]: With dead ends: 227575 [2025-02-05 15:37:05,870 INFO L226 Difference]: Without dead ends: 176422 [2025-02-05 15:37:06,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:37:06,184 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 3494 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 3455 mSolverCounterSat, 1095 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3533 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 4550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1095 IncrementalHoareTripleChecker+Valid, 3455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:06,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3533 Valid, 2257 Invalid, 4550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1095 Valid, 3455 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 15:37:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176422 states. [2025-02-05 15:37:16,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176422 to 156129. [2025-02-05 15:37:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156129 states, 98632 states have (on average 1.5547185497607268) internal successors, (153345), 106885 states have internal predecessors, (153345), 52584 states have call successors, (52584), 1672 states have call predecessors, (52584), 4912 states have return successors, (72074), 55383 states have call predecessors, (72074), 52579 states have call successors, (72074)