./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product21.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_spec3_product21.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 5c2801af81eeb5fcd439b1a1907444cd22ba07dc03ae6cb195ad73614e32dad5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:37:26,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:37:26,536 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:37:26,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:37:26,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:37:26,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:37:26,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:37:26,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:37:26,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:37:26,566 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:37:26,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:37:26,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:37:26,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:37:26,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:37:26,566 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:37:26,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:37:26,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:37:26,567 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:37:26,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:37:26,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:37:26,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:37:26,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:37:26,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:37:26,568 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:37:26,568 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:37:26,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:37:26,568 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:37:26,568 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:37:26,569 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:37:26,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:37:26,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:37:26,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:37:26,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:37:26,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:37:26,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:37:26,570 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:37:26,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:37:26,570 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:37:26,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:37:26,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:37:26,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:37:26,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:37:26,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:37:26,571 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 -> 5c2801af81eeb5fcd439b1a1907444cd22ba07dc03ae6cb195ad73614e32dad5 [2025-02-05 15:37:26,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:37:26,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:37:26,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:37:26,869 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:37:26,870 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:37:26,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product21.cil.c [2025-02-05 15:37:28,147 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b43809b2/2a25c62725eb48d188ca4be87513a5bc/FLAGacc68c591 [2025-02-05 15:37:28,607 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:37:28,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product21.cil.c [2025-02-05 15:37:28,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b43809b2/2a25c62725eb48d188ca4be87513a5bc/FLAGacc68c591 [2025-02-05 15:37:28,721 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b43809b2/2a25c62725eb48d188ca4be87513a5bc [2025-02-05 15:37:28,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:37:28,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:37:28,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:37:28,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:37:28,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:37:28,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:37:28" (1/1) ... [2025-02-05 15:37:28,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c952fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:28, skipping insertion in model container [2025-02-05 15:37:28,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:37:28" (1/1) ... [2025-02-05 15:37:28,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:37:29,308 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_spec3_product21.cil.c[62420,62433] [2025-02-05 15:37:29,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:37:29,384 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:37:29,391 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-02-05 15:37:29,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [408] [2025-02-05 15:37:29,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [528] [2025-02-05 15:37:29,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [622] [2025-02-05 15:37:29,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2141] [2025-02-05 15:37:29,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2802] [2025-02-05 15:37:29,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [2817] [2025-02-05 15:37:29,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3004] [2025-02-05 15:37:29,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3013] [2025-02-05 15:37:29,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3379] [2025-02-05 15:37:29,510 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_spec3_product21.cil.c[62420,62433] [2025-02-05 15:37:29,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:37:29,552 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:37:29,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:29 WrapperNode [2025-02-05 15:37:29,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:37:29,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:37:29,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:37:29,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:37:29,561 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:37:29" (1/1) ... [2025-02-05 15:37:29,584 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:37:29" (1/1) ... [2025-02-05 15:37:29,625 INFO L138 Inliner]: procedures = 90, calls = 345, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 880 [2025-02-05 15:37:29,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:37:29,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:37:29,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:37:29,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:37:29,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:29" (1/1) ... [2025-02-05 15:37:29,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:29" (1/1) ... [2025-02-05 15:37:29,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:29" (1/1) ... [2025-02-05 15:37:29,691 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:37:29,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:29" (1/1) ... [2025-02-05 15:37:29,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:29" (1/1) ... [2025-02-05 15:37:29,721 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:29" (1/1) ... [2025-02-05 15:37:29,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:29" (1/1) ... [2025-02-05 15:37:29,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:29" (1/1) ... [2025-02-05 15:37:29,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:29" (1/1) ... [2025-02-05 15:37:29,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:37:29,750 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:37:29,750 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:37:29,750 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:37:29,751 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:29" (1/1) ... [2025-02-05 15:37:29,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:37:29,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:29,784 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:37:29,791 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:37:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:37:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-02-05 15:37:29,810 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-02-05 15:37:29,811 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-02-05 15:37:29,811 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-02-05 15:37:29,811 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:37:29,811 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:37:29,811 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:37:29,811 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:37:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-02-05 15:37:29,812 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-02-05 15:37:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:37:29,812 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:37:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:37:29,812 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:37:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:37:29,812 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:37:29,813 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:37:29,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:37:29,813 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:37:29,813 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:37:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:37:29,814 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:37:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:37:29,814 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:37:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-02-05 15:37:29,814 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-02-05 15:37:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-02-05 15:37:29,814 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-02-05 15:37:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:37:29,814 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:37:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-02-05 15:37:29,815 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-02-05 15:37:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:37:29,817 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:37:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:37:29,817 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:37:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:37:29,817 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:37:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:37:29,817 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:37:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:37:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:37:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:37:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:37:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:37:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:37:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:37:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:37:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:37:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-02-05 15:37:29,818 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:37:29,818 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:37:29,818 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:37:29,818 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2025-02-05 15:37:29,818 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:37:29,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:37:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:37:29,818 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:37:29,998 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:37:30,001 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:37:30,038 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L907: #res := ~retValue_acc~9; [2025-02-05 15:37:30,075 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L525: #res := ~retValue_acc~4; [2025-02-05 15:37:30,105 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L447: #res := ~retValue_acc~2; [2025-02-05 15:37:30,109 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L702: #res := ~retValue_acc~5; [2025-02-05 15:37:30,113 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L855: #res := ~retValue_acc~6; [2025-02-05 15:37:30,409 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1431: #res#1 := ~retValue_acc~14#1; [2025-02-05 15:37:30,410 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1465-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~15#1; [2025-02-05 15:37:30,496 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1563: #res := ~retValue_acc~18; [2025-02-05 15:37:30,514 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L486: #res := ~retValue_acc~3; [2025-02-05 15:37:30,539 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L898: #res := ~retValue_acc~8; [2025-02-05 15:37:30,644 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1027-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~11#1; [2025-02-05 15:37:30,644 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1040-1: isIdle_#res#1 := isIdle_~retValue_acc~12#1; [2025-02-05 15:37:30,858 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1549-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~17#1; [2025-02-05 15:37:30,858 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1521-1: stopRequestedAtCurrentFloor__wrappee__weight_#res#1 := stopRequestedAtCurrentFloor__wrappee__weight_~retValue_acc~16#1; [2025-02-05 15:37:30,924 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2488: #res := ~retValue_acc~21; [2025-02-05 15:37:31,060 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1392: #res := ~retValue_acc~13; [2025-02-05 15:37:31,150 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L405-1: main_#res#1 := main_~retValue_acc~1#1; [2025-02-05 15:37:31,150 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3411-1: valid_product_#res#1 := valid_product_~retValue_acc~27#1; [2025-02-05 15:37:31,165 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2252: #res := ~retValue_acc~20; [2025-02-05 15:37:31,171 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2799: #res := ~retValue_acc~22; [2025-02-05 15:37:31,401 INFO L? ?]: Removed 458 outVars from TransFormulas that were not future-live. [2025-02-05 15:37:31,401 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:37:31,438 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:37:31,438 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:37:31,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:37:31 BoogieIcfgContainer [2025-02-05 15:37:31,439 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:37:31,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:37:31,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:37:31,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:37:31,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:37:28" (1/3) ... [2025-02-05 15:37:31,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1703b605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:37:31, skipping insertion in model container [2025-02-05 15:37:31,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:29" (2/3) ... [2025-02-05 15:37:31,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1703b605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:37:31, skipping insertion in model container [2025-02-05 15:37:31,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:37:31" (3/3) ... [2025-02-05 15:37:31,448 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product21.cil.c [2025-02-05 15:37:31,460 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:37:31,462 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product21.cil.c that has 27 procedures, 588 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:37:31,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:37:31,552 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;@143b7b9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:37:31,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:37:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 588 states, 453 states have (on average 1.6754966887417218) internal successors, (759), 472 states have internal predecessors, (759), 106 states have call successors, (106), 26 states have call predecessors, (106), 26 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-05 15:37:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 15:37:31,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:31,586 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:31,586 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:31,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:31,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1465989718, now seen corresponding path program 1 times [2025-02-05 15:37:31,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:31,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725009603] [2025-02-05 15:37:31,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:31,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:31,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:37:31,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:37:31,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:31,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:32,501 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:37:32,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:32,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725009603] [2025-02-05 15:37:32,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725009603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:32,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:32,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:32,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395610314] [2025-02-05 15:37:32,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:32,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:32,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:32,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:32,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:32,535 INFO L87 Difference]: Start difference. First operand has 588 states, 453 states have (on average 1.6754966887417218) internal successors, (759), 472 states have internal predecessors, (759), 106 states have call successors, (106), 26 states have call predecessors, (106), 26 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) Second operand has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:37:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:32,799 INFO L93 Difference]: Finished difference Result 1173 states and 1954 transitions. [2025-02-05 15:37:32,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:32,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 99 [2025-02-05 15:37:32,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:32,821 INFO L225 Difference]: With dead ends: 1173 [2025-02-05 15:37:32,821 INFO L226 Difference]: Without dead ends: 592 [2025-02-05 15:37:32,831 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:37:32,835 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 91 mSDsluCounter, 4690 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5645 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:32,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5645 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:37:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-05 15:37:32,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 590. [2025-02-05 15:37:32,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 456 states have (on average 1.668859649122807) internal successors, (761), 474 states have internal predecessors, (761), 107 states have call successors, (107), 26 states have call predecessors, (107), 26 states have return successors, (106), 102 states have call predecessors, (106), 104 states have call successors, (106) [2025-02-05 15:37:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 974 transitions. [2025-02-05 15:37:32,944 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 974 transitions. Word has length 99 [2025-02-05 15:37:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:32,945 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 974 transitions. [2025-02-05 15:37:32,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:37:32,945 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 974 transitions. [2025-02-05 15:37:32,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 15:37:32,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:32,951 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:32,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:37:32,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:32,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:32,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1665804298, now seen corresponding path program 1 times [2025-02-05 15:37:32,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:32,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304953175] [2025-02-05 15:37:32,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:32,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:32,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 15:37:33,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 15:37:33,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:33,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:33,343 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:37:33,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:33,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304953175] [2025-02-05 15:37:33,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304953175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:33,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:33,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:33,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63627988] [2025-02-05 15:37:33,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:33,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:33,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:33,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:33,346 INFO L87 Difference]: Start difference. First operand 590 states and 974 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:37:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:33,529 INFO L93 Difference]: Finished difference Result 1175 states and 1951 transitions. [2025-02-05 15:37:33,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:33,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2025-02-05 15:37:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:33,537 INFO L225 Difference]: With dead ends: 1175 [2025-02-05 15:37:33,539 INFO L226 Difference]: Without dead ends: 601 [2025-02-05 15:37:33,542 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:37:33,544 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 90 mSDsluCounter, 4684 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 5640 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:33,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 5640 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:37:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-02-05 15:37:33,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 590. [2025-02-05 15:37:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 456 states have (on average 1.668859649122807) internal successors, (761), 474 states have internal predecessors, (761), 107 states have call successors, (107), 26 states have call predecessors, (107), 26 states have return successors, (106), 102 states have call predecessors, (106), 104 states have call successors, (106) [2025-02-05 15:37:33,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 974 transitions. [2025-02-05 15:37:33,595 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 974 transitions. Word has length 100 [2025-02-05 15:37:33,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:33,596 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 974 transitions. [2025-02-05 15:37:33,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:37:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 974 transitions. [2025-02-05 15:37:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 15:37:33,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:33,602 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:33,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:37:33,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:33,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:33,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1225651811, now seen corresponding path program 1 times [2025-02-05 15:37:33,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:33,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817631682] [2025-02-05 15:37:33,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:33,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:33,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 15:37:33,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 15:37:33,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:33,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:33,796 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:37:33,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:33,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817631682] [2025-02-05 15:37:33,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817631682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:33,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:33,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:33,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263151902] [2025-02-05 15:37:33,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:33,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:33,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:33,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:33,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:33,801 INFO L87 Difference]: Start difference. First operand 590 states and 974 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:37:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:33,875 INFO L93 Difference]: Finished difference Result 1162 states and 1929 transitions. [2025-02-05 15:37:33,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:33,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2025-02-05 15:37:33,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:33,881 INFO L225 Difference]: With dead ends: 1162 [2025-02-05 15:37:33,882 INFO L226 Difference]: Without dead ends: 560 [2025-02-05 15:37:33,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:37:33,886 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 14 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2827 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:33,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2827 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:33,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-02-05 15:37:33,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-02-05 15:37:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 429 states have (on average 1.6526806526806528) internal successors, (709), 445 states have internal predecessors, (709), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-02-05 15:37:33,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 918 transitions. [2025-02-05 15:37:33,912 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 918 transitions. Word has length 100 [2025-02-05 15:37:33,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:33,913 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 918 transitions. [2025-02-05 15:37:33,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:37:33,913 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 918 transitions. [2025-02-05 15:37:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 15:37:33,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:33,916 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:33,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:37:33,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:33,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:33,918 INFO L85 PathProgramCache]: Analyzing trace with hash 232932228, now seen corresponding path program 1 times [2025-02-05 15:37:33,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:33,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24159870] [2025-02-05 15:37:33,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:33,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:33,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 15:37:33,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 15:37:33,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:33,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:34,180 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:37:34,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:34,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24159870] [2025-02-05 15:37:34,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24159870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:34,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:34,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:34,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026427596] [2025-02-05 15:37:34,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:34,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:34,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:34,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:34,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:34,185 INFO L87 Difference]: Start difference. First operand 560 states and 918 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:37:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:34,288 INFO L93 Difference]: Finished difference Result 1113 states and 1835 transitions. [2025-02-05 15:37:34,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:34,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 101 [2025-02-05 15:37:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:34,294 INFO L225 Difference]: With dead ends: 1113 [2025-02-05 15:37:34,295 INFO L226 Difference]: Without dead ends: 554 [2025-02-05 15:37:34,298 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:37:34,300 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 63 mSDsluCounter, 4482 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5390 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:34,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5390 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:34,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-05 15:37:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-02-05 15:37:34,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 423 states have (on average 1.6453900709219857) internal successors, (696), 439 states have internal predecessors, (696), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-02-05 15:37:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 905 transitions. [2025-02-05 15:37:34,334 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 905 transitions. Word has length 101 [2025-02-05 15:37:34,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:34,334 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 905 transitions. [2025-02-05 15:37:34,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:37:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 905 transitions. [2025-02-05 15:37:34,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 15:37:34,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:34,338 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:34,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:37:34,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:34,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:34,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1532723696, now seen corresponding path program 1 times [2025-02-05 15:37:34,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:34,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750033533] [2025-02-05 15:37:34,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:34,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:34,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 15:37:34,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 15:37:34,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:34,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:34,593 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:37:34,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:34,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750033533] [2025-02-05 15:37:34,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750033533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:34,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:34,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:34,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326150679] [2025-02-05 15:37:34,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:34,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:34,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:34,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:34,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:34,596 INFO L87 Difference]: Start difference. First operand 554 states and 905 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:37:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:34,674 INFO L93 Difference]: Finished difference Result 1101 states and 1809 transitions. [2025-02-05 15:37:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:34,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 102 [2025-02-05 15:37:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:34,679 INFO L225 Difference]: With dead ends: 1101 [2025-02-05 15:37:34,679 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 15:37:34,682 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:37:34,684 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 49 mSDsluCounter, 4434 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5330 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:34,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5330 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 15:37:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-02-05 15:37:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 417 states have (on average 1.6378896882494005) internal successors, (683), 433 states have internal predecessors, (683), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-02-05 15:37:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 892 transitions. [2025-02-05 15:37:34,716 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 892 transitions. Word has length 102 [2025-02-05 15:37:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:34,717 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 892 transitions. [2025-02-05 15:37:34,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:37:34,717 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 892 transitions. [2025-02-05 15:37:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 15:37:34,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:34,720 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:34,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:37:34,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:34,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:34,721 INFO L85 PathProgramCache]: Analyzing trace with hash 792659528, now seen corresponding path program 1 times [2025-02-05 15:37:34,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:34,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705472688] [2025-02-05 15:37:34,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:34,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:34,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 15:37:34,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 15:37:34,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:34,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:34,953 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:37:34,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:34,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705472688] [2025-02-05 15:37:34,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705472688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:34,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:34,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:34,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733543182] [2025-02-05 15:37:34,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:34,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:34,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:34,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:34,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:34,957 INFO L87 Difference]: Start difference. First operand 548 states and 892 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:37:35,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:35,030 INFO L93 Difference]: Finished difference Result 1089 states and 1783 transitions. [2025-02-05 15:37:35,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:35,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 102 [2025-02-05 15:37:35,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:35,038 INFO L225 Difference]: With dead ends: 1089 [2025-02-05 15:37:35,038 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 15:37:35,042 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:37:35,043 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 24 mSDsluCounter, 4398 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5282 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:35,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5282 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:35,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 15:37:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-02-05 15:37:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 417 states have (on average 1.6354916067146283) internal successors, (682), 433 states have internal predecessors, (682), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-02-05 15:37:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 891 transitions. [2025-02-05 15:37:35,075 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 891 transitions. Word has length 102 [2025-02-05 15:37:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:35,075 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 891 transitions. [2025-02-05 15:37:35,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:37:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 891 transitions. [2025-02-05 15:37:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 15:37:35,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:35,079 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:35,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:37:35,083 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:35,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:35,083 INFO L85 PathProgramCache]: Analyzing trace with hash -930428578, now seen corresponding path program 1 times [2025-02-05 15:37:35,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:35,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178530012] [2025-02-05 15:37:35,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:35,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:35,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 15:37:35,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:37:35,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:35,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:35,246 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:37:35,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:35,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178530012] [2025-02-05 15:37:35,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178530012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:35,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:35,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:35,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952451667] [2025-02-05 15:37:35,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:35,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:35,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:35,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:35,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:35,250 INFO L87 Difference]: Start difference. First operand 548 states and 891 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:37:35,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:35,303 INFO L93 Difference]: Finished difference Result 1080 states and 1768 transitions. [2025-02-05 15:37:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:35,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-02-05 15:37:35,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:35,309 INFO L225 Difference]: With dead ends: 1080 [2025-02-05 15:37:35,309 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 15:37:35,312 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:37:35,314 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 15 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2613 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:35,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2613 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 15:37:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-02-05 15:37:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 417 states have (on average 1.6330935251798562) internal successors, (681), 433 states have internal predecessors, (681), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-02-05 15:37:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 890 transitions. [2025-02-05 15:37:35,339 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 890 transitions. Word has length 103 [2025-02-05 15:37:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:35,339 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 890 transitions. [2025-02-05 15:37:35,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:37:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 890 transitions. [2025-02-05 15:37:35,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 15:37:35,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:35,342 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] [2025-02-05 15:37:35,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:37:35,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:35,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:35,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1161680552, now seen corresponding path program 1 times [2025-02-05 15:37:35,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:35,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454132854] [2025-02-05 15:37:35,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:35,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:35,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:37:35,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:37:35,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:35,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:35,484 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:37:35,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:35,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454132854] [2025-02-05 15:37:35,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454132854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:35,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:35,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:35,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077335641] [2025-02-05 15:37:35,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:35,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:35,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:35,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:35,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:35,486 INFO L87 Difference]: Start difference. First operand 548 states and 890 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:37:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:35,544 INFO L93 Difference]: Finished difference Result 1080 states and 1766 transitions. [2025-02-05 15:37:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:35,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-02-05 15:37:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:35,549 INFO L225 Difference]: With dead ends: 1080 [2025-02-05 15:37:35,549 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 15:37:35,553 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:37:35,553 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 14 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2615 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:35,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2615 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:35,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 15:37:35,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-02-05 15:37:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 417 states have (on average 1.630695443645084) internal successors, (680), 433 states have internal predecessors, (680), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-02-05 15:37:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 889 transitions. [2025-02-05 15:37:35,578 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 889 transitions. Word has length 104 [2025-02-05 15:37:35,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:35,579 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 889 transitions. [2025-02-05 15:37:35,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:37:35,579 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 889 transitions. [2025-02-05 15:37:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 15:37:35,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:35,582 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] [2025-02-05 15:37:35,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:37:35,582 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:35,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:35,583 INFO L85 PathProgramCache]: Analyzing trace with hash -301133279, now seen corresponding path program 1 times [2025-02-05 15:37:35,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:35,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534949169] [2025-02-05 15:37:35,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:35,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:35,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 15:37:35,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 15:37:35,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:35,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:35,745 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:37:35,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:35,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534949169] [2025-02-05 15:37:35,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534949169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:35,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:35,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:35,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974241654] [2025-02-05 15:37:35,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:35,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:35,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:35,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:35,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:35,747 INFO L87 Difference]: Start difference. First operand 548 states and 889 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:37:35,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:35,793 INFO L93 Difference]: Finished difference Result 1080 states and 1764 transitions. [2025-02-05 15:37:35,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:35,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-02-05 15:37:35,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:35,798 INFO L225 Difference]: With dead ends: 1080 [2025-02-05 15:37:35,798 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 15:37:35,801 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:37:35,802 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 13 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2617 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:37:35,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2617 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:35,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 15:37:35,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-02-05 15:37:35,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 417 states have (on average 1.6282973621103118) internal successors, (679), 433 states have internal predecessors, (679), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-02-05 15:37:35,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 888 transitions. [2025-02-05 15:37:35,825 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 888 transitions. Word has length 105 [2025-02-05 15:37:35,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:35,825 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 888 transitions. [2025-02-05 15:37:35,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:37:35,826 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 888 transitions. [2025-02-05 15:37:35,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 15:37:35,828 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:35,828 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] [2025-02-05 15:37:35,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:37:35,829 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:35,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:35,829 INFO L85 PathProgramCache]: Analyzing trace with hash 45452283, now seen corresponding path program 1 times [2025-02-05 15:37:35,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:35,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077647674] [2025-02-05 15:37:35,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:35,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:35,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 15:37:35,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 15:37:35,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:35,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:35,962 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:37:35,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:35,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077647674] [2025-02-05 15:37:35,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077647674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:35,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:35,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:35,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103504944] [2025-02-05 15:37:35,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:35,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:35,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:35,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:35,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:35,965 INFO L87 Difference]: Start difference. First operand 548 states and 888 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:37:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:36,010 INFO L93 Difference]: Finished difference Result 1080 states and 1762 transitions. [2025-02-05 15:37:36,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:36,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2025-02-05 15:37:36,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:36,016 INFO L225 Difference]: With dead ends: 1080 [2025-02-05 15:37:36,016 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 15:37:36,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:36,020 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 12 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2619 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:36,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2619 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 15:37:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-02-05 15:37:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 417 states have (on average 1.6258992805755397) internal successors, (678), 433 states have internal predecessors, (678), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-02-05 15:37:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 887 transitions. [2025-02-05 15:37:36,043 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 887 transitions. Word has length 106 [2025-02-05 15:37:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:36,043 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 887 transitions. [2025-02-05 15:37:36,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:37:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 887 transitions. [2025-02-05 15:37:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 15:37:36,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:36,047 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:36,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:37:36,047 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:36,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:36,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1639093988, now seen corresponding path program 1 times [2025-02-05 15:37:36,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:36,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709323167] [2025-02-05 15:37:36,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:36,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:36,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:37:36,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:37:36,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:36,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:37:36,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:36,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709323167] [2025-02-05 15:37:36,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709323167] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:36,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996090858] [2025-02-05 15:37:36,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:36,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:36,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:36,349 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:37:36,352 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:37:36,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:37:36,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:37:36,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:36,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:36,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 1612 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:37:36,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:36,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:37:36,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:36,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996090858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:36,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:36,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-02-05 15:37:36,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428500116] [2025-02-05 15:37:36,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:36,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:37:36,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:36,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:37:36,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:37:36,886 INFO L87 Difference]: Start difference. First operand 548 states and 887 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:37:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:36,980 INFO L93 Difference]: Finished difference Result 1555 states and 2549 transitions. [2025-02-05 15:37:36,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:37:36,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 107 [2025-02-05 15:37:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:36,991 INFO L225 Difference]: With dead ends: 1555 [2025-02-05 15:37:36,991 INFO L226 Difference]: Without dead ends: 1025 [2025-02-05 15:37:36,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:37:36,998 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 815 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:36,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1681 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:37,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2025-02-05 15:37:37,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1010. [2025-02-05 15:37:37,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 776 states have (on average 1.6391752577319587) internal successors, (1272), 807 states have internal predecessors, (1272), 187 states have call successors, (187), 47 states have call predecessors, (187), 46 states have return successors, (189), 181 states have call predecessors, (189), 184 states have call successors, (189) [2025-02-05 15:37:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1648 transitions. [2025-02-05 15:37:37,061 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1648 transitions. Word has length 107 [2025-02-05 15:37:37,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:37,061 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1648 transitions. [2025-02-05 15:37:37,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:37:37,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1648 transitions. [2025-02-05 15:37:37,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:37:37,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:37,067 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] [2025-02-05 15:37:37,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:37:37,268 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,SelfDestructingSolverStorable10 [2025-02-05 15:37:37,269 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:37,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:37,269 INFO L85 PathProgramCache]: Analyzing trace with hash -85276979, now seen corresponding path program 1 times [2025-02-05 15:37:37,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:37,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581917550] [2025-02-05 15:37:37,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:37,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:37,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:37:37,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:37:37,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:37,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:37:37,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:37,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581917550] [2025-02-05 15:37:37,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581917550] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:37,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492843313] [2025-02-05 15:37:37,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:37,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:37,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:37,568 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:37:37,590 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:37:37,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:37:37,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:37:37,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:37,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:37,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 1613 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:37:37,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:37:38,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:38,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492843313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:38,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:38,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-02-05 15:37:38,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460081083] [2025-02-05 15:37:38,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:38,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:37:38,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:38,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:37:38,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:37:38,058 INFO L87 Difference]: Start difference. First operand 1010 states and 1648 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:37:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:38,147 INFO L93 Difference]: Finished difference Result 2479 states and 4073 transitions. [2025-02-05 15:37:38,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:37:38,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-02-05 15:37:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:38,159 INFO L225 Difference]: With dead ends: 2479 [2025-02-05 15:37:38,159 INFO L226 Difference]: Without dead ends: 1487 [2025-02-05 15:37:38,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:37:38,166 INFO L435 NwaCegarLoop]: 947 mSDtfsCounter, 817 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:38,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1727 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:38,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2025-02-05 15:37:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1439. [2025-02-05 15:37:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1108 states have (on average 1.651624548736462) internal successors, (1830), 1154 states have internal predecessors, (1830), 265 states have call successors, (265), 65 states have call predecessors, (265), 65 states have return successors, (272), 258 states have call predecessors, (272), 262 states have call successors, (272) [2025-02-05 15:37:38,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2367 transitions. [2025-02-05 15:37:38,241 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2367 transitions. Word has length 108 [2025-02-05 15:37:38,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:38,242 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 2367 transitions. [2025-02-05 15:37:38,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:37:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2367 transitions. [2025-02-05 15:37:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:37:38,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:38,248 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] [2025-02-05 15:37:38,258 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:37:38,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:38,449 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:38,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:38,450 INFO L85 PathProgramCache]: Analyzing trace with hash 925344249, now seen corresponding path program 1 times [2025-02-05 15:37:38,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:38,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125717132] [2025-02-05 15:37:38,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:38,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:38,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:37:38,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:37:38,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:38,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:38,661 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:37:38,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:38,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125717132] [2025-02-05 15:37:38,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125717132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:38,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:38,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:38,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854394938] [2025-02-05 15:37:38,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:38,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:38,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:38,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:38,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:38,664 INFO L87 Difference]: Start difference. First operand 1439 states and 2367 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:37:39,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:39,307 INFO L93 Difference]: Finished difference Result 4241 states and 7108 transitions. [2025-02-05 15:37:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:39,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-02-05 15:37:39,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:39,330 INFO L225 Difference]: With dead ends: 4241 [2025-02-05 15:37:39,330 INFO L226 Difference]: Without dead ends: 2820 [2025-02-05 15:37:39,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:37:39,342 INFO L435 NwaCegarLoop]: 994 mSDtfsCounter, 875 mSDsluCounter, 3569 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 4563 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:39,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 4563 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:37:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2025-02-05 15:37:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2773. [2025-02-05 15:37:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2773 states, 2137 states have (on average 1.6518483855872719) internal successors, (3530), 2225 states have internal predecessors, (3530), 509 states have call successors, (509), 124 states have call predecessors, (509), 126 states have return successors, (595), 501 states have call predecessors, (595), 505 states have call successors, (595) [2025-02-05 15:37:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 4634 transitions. [2025-02-05 15:37:39,523 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 4634 transitions. Word has length 110 [2025-02-05 15:37:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:39,523 INFO L471 AbstractCegarLoop]: Abstraction has 2773 states and 4634 transitions. [2025-02-05 15:37:39,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:37:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 4634 transitions. [2025-02-05 15:37:39,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 15:37:39,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:39,531 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] [2025-02-05 15:37:39,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:37:39,532 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:39,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:39,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1242960209, now seen corresponding path program 1 times [2025-02-05 15:37:39,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:39,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69069041] [2025-02-05 15:37:39,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:39,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:39,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 15:37:39,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 15:37:39,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:39,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:37:39,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:39,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69069041] [2025-02-05 15:37:39,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69069041] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:39,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192675591] [2025-02-05 15:37:39,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:39,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:39,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:39,799 INFO L229 MonitoredProcess]: Starting monitored process 4 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:37:39,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:37:39,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 15:37:40,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 15:37:40,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:40,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:40,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:37:40,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:40,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:37:40,294 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:40,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192675591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:40,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:40,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-02-05 15:37:40,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045732873] [2025-02-05 15:37:40,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:40,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:37:40,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:40,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:37:40,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:37:40,296 INFO L87 Difference]: Start difference. First operand 2773 states and 4634 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:37:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:40,707 INFO L93 Difference]: Finished difference Result 8029 states and 13688 transitions. [2025-02-05 15:37:40,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:37:40,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2025-02-05 15:37:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:40,749 INFO L225 Difference]: With dead ends: 8029 [2025-02-05 15:37:40,749 INFO L226 Difference]: Without dead ends: 5275 [2025-02-05 15:37:40,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:37:40,775 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 728 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:40,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1706 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:37:40,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5275 states. [2025-02-05 15:37:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5275 to 5238. [2025-02-05 15:37:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5238 states, 4024 states have (on average 1.6197813121272366) internal successors, (6518), 4198 states have internal predecessors, (6518), 966 states have call successors, (966), 242 states have call predecessors, (966), 247 states have return successors, (1262), 953 states have call predecessors, (1262), 960 states have call successors, (1262) [2025-02-05 15:37:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5238 states to 5238 states and 8746 transitions. [2025-02-05 15:37:41,138 INFO L78 Accepts]: Start accepts. Automaton has 5238 states and 8746 transitions. Word has length 112 [2025-02-05 15:37:41,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:41,139 INFO L471 AbstractCegarLoop]: Abstraction has 5238 states and 8746 transitions. [2025-02-05 15:37:41,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:37:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 5238 states and 8746 transitions. [2025-02-05 15:37:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:37:41,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:41,146 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] [2025-02-05 15:37:41,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:37:41,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:41,347 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:41,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:41,347 INFO L85 PathProgramCache]: Analyzing trace with hash 868971991, now seen corresponding path program 1 times [2025-02-05 15:37:41,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:41,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829082439] [2025-02-05 15:37:41,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:41,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:41,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:37:41,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:37:41,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:41,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:37:41,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:41,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829082439] [2025-02-05 15:37:41,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829082439] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:41,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669756542] [2025-02-05 15:37:41,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:41,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:41,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:41,594 INFO L229 MonitoredProcess]: Starting monitored process 5 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:37:41,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:37:41,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:37:41,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:37:41,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:41,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:41,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 1648 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:37:41,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:37:41,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:41,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669756542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:41,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:41,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2025-02-05 15:37:41,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508013611] [2025-02-05 15:37:41,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:41,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:37:41,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:41,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:37:41,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:37:41,973 INFO L87 Difference]: Start difference. First operand 5238 states and 8746 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:37:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:42,461 INFO L93 Difference]: Finished difference Result 15600 states and 26371 transitions. [2025-02-05 15:37:42,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:37:42,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2025-02-05 15:37:42,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:42,555 INFO L225 Difference]: With dead ends: 15600 [2025-02-05 15:37:42,555 INFO L226 Difference]: Without dead ends: 10383 [2025-02-05 15:37:42,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:37:42,683 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 870 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:42,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1753 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:42,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10383 states. [2025-02-05 15:37:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10383 to 10280. [2025-02-05 15:37:43,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10280 states, 7924 states have (on average 1.623296314992428) internal successors, (12863), 8252 states have internal predecessors, (12863), 1872 states have call successors, (1872), 466 states have call predecessors, (1872), 483 states have return successors, (2518), 1867 states have call predecessors, (2518), 1862 states have call successors, (2518) [2025-02-05 15:37:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10280 states to 10280 states and 17253 transitions. [2025-02-05 15:37:43,326 INFO L78 Accepts]: Start accepts. Automaton has 10280 states and 17253 transitions. Word has length 118 [2025-02-05 15:37:43,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:43,327 INFO L471 AbstractCegarLoop]: Abstraction has 10280 states and 17253 transitions. [2025-02-05 15:37:43,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:37:43,327 INFO L276 IsEmpty]: Start isEmpty. Operand 10280 states and 17253 transitions. [2025-02-05 15:37:43,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:37:43,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:43,334 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] [2025-02-05 15:37:43,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:37:43,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 15:37:43,535 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:43,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:43,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1473599689, now seen corresponding path program 1 times [2025-02-05 15:37:43,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:43,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931641412] [2025-02-05 15:37:43,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:43,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:43,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:37:43,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:37:43,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:43,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:37:43,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:43,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931641412] [2025-02-05 15:37:43,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931641412] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:43,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915749320] [2025-02-05 15:37:43,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:43,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:43,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:43,822 INFO L229 MonitoredProcess]: Starting monitored process 6 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:37:43,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:37:43,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:37:44,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:37:44,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:44,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:44,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 1646 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:37:44,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:44,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:37:44,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:44,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915749320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:44,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:44,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-02-05 15:37:44,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486547517] [2025-02-05 15:37:44,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:44,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:44,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:44,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:44,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:37:44,330 INFO L87 Difference]: Start difference. First operand 10280 states and 17253 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:37:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:45,407 INFO L93 Difference]: Finished difference Result 19433 states and 32712 transitions. [2025-02-05 15:37:45,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:45,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 118 [2025-02-05 15:37:45,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:45,485 INFO L225 Difference]: With dead ends: 19433 [2025-02-05 15:37:45,486 INFO L226 Difference]: Without dead ends: 9171 [2025-02-05 15:37:45,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:37:45,537 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 747 mSDsluCounter, 3165 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 4104 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:45,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 4104 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 15:37:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9171 states. [2025-02-05 15:37:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9171 to 9149. [2025-02-05 15:37:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9149 states, 7073 states have (on average 1.6110561289410434) internal successors, (11395), 7348 states have internal predecessors, (11395), 1638 states have call successors, (1638), 422 states have call predecessors, (1638), 437 states have return successors, (2192), 1634 states have call predecessors, (2192), 1628 states have call successors, (2192) [2025-02-05 15:37:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9149 states to 9149 states and 15225 transitions. [2025-02-05 15:37:46,075 INFO L78 Accepts]: Start accepts. Automaton has 9149 states and 15225 transitions. Word has length 118 [2025-02-05 15:37:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:46,075 INFO L471 AbstractCegarLoop]: Abstraction has 9149 states and 15225 transitions. [2025-02-05 15:37:46,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:37:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 9149 states and 15225 transitions. [2025-02-05 15:37:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:37:46,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:46,082 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] [2025-02-05 15:37:46,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:37:46,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 15:37:46,287 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:46,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:46,288 INFO L85 PathProgramCache]: Analyzing trace with hash -628099964, now seen corresponding path program 1 times [2025-02-05 15:37:46,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:46,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283876432] [2025-02-05 15:37:46,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:46,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:46,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:37:46,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:37:46,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:46,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:46,387 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:37:46,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:46,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283876432] [2025-02-05 15:37:46,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283876432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:46,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:46,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:46,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117272637] [2025-02-05 15:37:46,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:46,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:46,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:46,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:46,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:46,389 INFO L87 Difference]: Start difference. First operand 9149 states and 15225 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:37:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:46,889 INFO L93 Difference]: Finished difference Result 18328 states and 30865 transitions. [2025-02-05 15:37:46,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:46,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2025-02-05 15:37:46,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:46,955 INFO L225 Difference]: With dead ends: 18328 [2025-02-05 15:37:46,955 INFO L226 Difference]: Without dead ends: 9197 [2025-02-05 15:37:46,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:37:46,999 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 12 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2583 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:46,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2583 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:37:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9197 states. [2025-02-05 15:37:47,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9197 to 9165. [2025-02-05 15:37:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9165 states, 7085 states have (on average 1.609456598447424) internal successors, (11403), 7360 states have internal predecessors, (11403), 1638 states have call successors, (1638), 430 states have call predecessors, (1638), 441 states have return successors, (2170), 1630 states have call predecessors, (2170), 1628 states have call successors, (2170) [2025-02-05 15:37:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9165 states to 9165 states and 15211 transitions. [2025-02-05 15:37:47,349 INFO L78 Accepts]: Start accepts. Automaton has 9165 states and 15211 transitions. Word has length 118 [2025-02-05 15:37:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:47,349 INFO L471 AbstractCegarLoop]: Abstraction has 9165 states and 15211 transitions. [2025-02-05 15:37:47,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:37:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 9165 states and 15211 transitions. [2025-02-05 15:37:47,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 15:37:47,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:47,356 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:47,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:37:47,356 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:47,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:47,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1691587964, now seen corresponding path program 1 times [2025-02-05 15:37:47,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:47,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144238665] [2025-02-05 15:37:47,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:47,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:47,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:37:47,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:37:47,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:47,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 15:37:47,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:47,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144238665] [2025-02-05 15:37:47,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144238665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:47,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:47,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:47,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088035010] [2025-02-05 15:37:47,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:47,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:47,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:47,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:47,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:47,584 INFO L87 Difference]: Start difference. First operand 9165 states and 15211 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:48,891 INFO L93 Difference]: Finished difference Result 27405 states and 47037 transitions. [2025-02-05 15:37:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:48,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 126 [2025-02-05 15:37:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:49,054 INFO L225 Difference]: With dead ends: 27405 [2025-02-05 15:37:49,054 INFO L226 Difference]: Without dead ends: 18258 [2025-02-05 15:37:49,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:37:49,137 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 871 mSDsluCounter, 3557 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:49,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 4543 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:37:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18258 states. [2025-02-05 15:37:49,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18258 to 18157. [2025-02-05 15:37:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18157 states, 14040 states have (on average 1.604131054131054) internal successors, (22522), 14581 states have internal predecessors, (22522), 3231 states have call successors, (3231), 854 states have call predecessors, (3231), 885 states have return successors, (5111), 3233 states have call predecessors, (5111), 3213 states have call successors, (5111) [2025-02-05 15:37:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18157 states to 18157 states and 30864 transitions. [2025-02-05 15:37:50,154 INFO L78 Accepts]: Start accepts. Automaton has 18157 states and 30864 transitions. Word has length 126 [2025-02-05 15:37:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:50,155 INFO L471 AbstractCegarLoop]: Abstraction has 18157 states and 30864 transitions. [2025-02-05 15:37:50,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 18157 states and 30864 transitions. [2025-02-05 15:37:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:37:50,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:50,162 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:50,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:37:50,163 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:50,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:50,163 INFO L85 PathProgramCache]: Analyzing trace with hash 817282082, now seen corresponding path program 1 times [2025-02-05 15:37:50,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:50,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586155177] [2025-02-05 15:37:50,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:50,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:50,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:37:50,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:37:50,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:50,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:37:50,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:50,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586155177] [2025-02-05 15:37:50,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586155177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:50,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:50,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:50,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120867592] [2025-02-05 15:37:50,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:50,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:50,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:50,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:50,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:50,261 INFO L87 Difference]: Start difference. First operand 18157 states and 30864 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:37:51,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:51,168 INFO L93 Difference]: Finished difference Result 36440 states and 62983 transitions. [2025-02-05 15:37:51,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:51,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-02-05 15:37:51,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:51,328 INFO L225 Difference]: With dead ends: 36440 [2025-02-05 15:37:51,329 INFO L226 Difference]: Without dead ends: 18301 [2025-02-05 15:37:51,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:37:51,452 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 12 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:51,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2574 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:37:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18301 states. [2025-02-05 15:37:52,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18301 to 18237. [2025-02-05 15:37:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18237 states, 14112 states have (on average 1.6016156462585034) internal successors, (22602), 14637 states have internal predecessors, (22602), 3231 states have call successors, (3231), 886 states have call predecessors, (3231), 893 states have return successors, (5079), 3225 states have call predecessors, (5079), 3213 states have call successors, (5079) [2025-02-05 15:37:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18237 states to 18237 states and 30912 transitions. [2025-02-05 15:37:52,306 INFO L78 Accepts]: Start accepts. Automaton has 18237 states and 30912 transitions. Word has length 127 [2025-02-05 15:37:52,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:52,307 INFO L471 AbstractCegarLoop]: Abstraction has 18237 states and 30912 transitions. [2025-02-05 15:37:52,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:37:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 18237 states and 30912 transitions. [2025-02-05 15:37:52,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:37:52,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:52,315 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1] [2025-02-05 15:37:52,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:37:52,316 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:52,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:52,317 INFO L85 PathProgramCache]: Analyzing trace with hash 112186375, now seen corresponding path program 1 times [2025-02-05 15:37:52,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:52,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838153713] [2025-02-05 15:37:52,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:52,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:52,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:37:52,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:37:52,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:52,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:37:52,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:52,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838153713] [2025-02-05 15:37:52,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838153713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:52,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:52,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:52,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447746531] [2025-02-05 15:37:52,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:52,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:52,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:52,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:52,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:52,503 INFO L87 Difference]: Start difference. First operand 18237 states and 30912 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:37:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:54,638 INFO L93 Difference]: Finished difference Result 54773 states and 97358 transitions. [2025-02-05 15:37:54,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:54,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 137 [2025-02-05 15:37:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:55,002 INFO L225 Difference]: With dead ends: 54773 [2025-02-05 15:37:55,002 INFO L226 Difference]: Without dead ends: 36554 [2025-02-05 15:37:55,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:37:55,314 INFO L435 NwaCegarLoop]: 984 mSDtfsCounter, 868 mSDsluCounter, 3561 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 4545 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:55,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 4545 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:37:55,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36554 states. [2025-02-05 15:37:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36554 to 36389. [2025-02-05 15:37:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36389 states, 28163 states have (on average 1.5973795405319036) internal successors, (44987), 29204 states have internal predecessors, (44987), 6428 states have call successors, (6428), 1766 states have call predecessors, (6428), 1797 states have return successors, (12517), 6442 states have call predecessors, (12517), 6394 states have call successors, (12517) [2025-02-05 15:37:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36389 states to 36389 states and 63932 transitions. [2025-02-05 15:37:56,960 INFO L78 Accepts]: Start accepts. Automaton has 36389 states and 63932 transitions. Word has length 137 [2025-02-05 15:37:56,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:56,960 INFO L471 AbstractCegarLoop]: Abstraction has 36389 states and 63932 transitions. [2025-02-05 15:37:56,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:37:56,961 INFO L276 IsEmpty]: Start isEmpty. Operand 36389 states and 63932 transitions. [2025-02-05 15:37:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:37:56,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:56,968 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2025-02-05 15:37:56,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:37:56,968 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:56,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:56,969 INFO L85 PathProgramCache]: Analyzing trace with hash 708389364, now seen corresponding path program 1 times [2025-02-05 15:37:56,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:56,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236165029] [2025-02-05 15:37:56,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:56,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:56,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:37:56,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:37:56,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:56,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 15:37:57,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:57,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236165029] [2025-02-05 15:37:57,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236165029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:57,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:57,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:57,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716122768] [2025-02-05 15:37:57,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:57,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:57,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:57,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:57,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:57,072 INFO L87 Difference]: Start difference. First operand 36389 states and 63932 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:37:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:59,411 INFO L93 Difference]: Finished difference Result 73048 states and 131600 transitions. [2025-02-05 15:37:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:59,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2025-02-05 15:37:59,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:59,753 INFO L225 Difference]: With dead ends: 73048 [2025-02-05 15:37:59,753 INFO L226 Difference]: Without dead ends: 36677 [2025-02-05 15:38:00,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:38:00,148 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 11 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2577 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:00,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2577 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:38:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36677 states. [2025-02-05 15:38:01,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36677 to 36549. [2025-02-05 15:38:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36549 states, 28307 states have (on average 1.5949058536757692) internal successors, (45147), 29348 states have internal predecessors, (45147), 6428 states have call successors, (6428), 1798 states have call predecessors, (6428), 1813 states have return successors, (12477), 6426 states have call predecessors, (12477), 6394 states have call successors, (12477) [2025-02-05 15:38:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36549 states to 36549 states and 64052 transitions. [2025-02-05 15:38:01,824 INFO L78 Accepts]: Start accepts. Automaton has 36549 states and 64052 transitions. Word has length 138 [2025-02-05 15:38:01,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:01,825 INFO L471 AbstractCegarLoop]: Abstraction has 36549 states and 64052 transitions. [2025-02-05 15:38:01,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:38:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 36549 states and 64052 transitions. [2025-02-05 15:38:01,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:38:01,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:01,832 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:01,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:38:01,832 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:01,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:01,833 INFO L85 PathProgramCache]: Analyzing trace with hash 849055450, now seen corresponding path program 1 times [2025-02-05 15:38:01,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:01,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081908889] [2025-02-05 15:38:01,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:01,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:01,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:38:01,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:38:01,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:01,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:38:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:01,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081908889] [2025-02-05 15:38:01,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081908889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:01,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:01,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:01,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155554511] [2025-02-05 15:38:01,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:01,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:01,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:01,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:01,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:01,991 INFO L87 Difference]: Start difference. First operand 36549 states and 64052 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:38:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:06,155 INFO L93 Difference]: Finished difference Result 109957 states and 206920 transitions. [2025-02-05 15:38:06,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:38:06,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 149 [2025-02-05 15:38:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:06,778 INFO L225 Difference]: With dead ends: 109957 [2025-02-05 15:38:06,778 INFO L226 Difference]: Without dead ends: 73426 [2025-02-05 15:38:07,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:38:07,197 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 863 mSDsluCounter, 3575 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 4560 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:07,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 4560 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:38:07,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73426 states. [2025-02-05 15:38:09,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73426 to 73133. [2025-02-05 15:38:09,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73133 states, 56646 states have (on average 1.5919923736892279) internal successors, (90180), 58719 states have internal predecessors, (90180), 12833 states have call successors, (12833), 3590 states have call predecessors, (12833), 3653 states have return successors, (32087), 12871 states have call predecessors, (32087), 12767 states have call successors, (32087) [2025-02-05 15:38:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73133 states to 73133 states and 135100 transitions. [2025-02-05 15:38:10,749 INFO L78 Accepts]: Start accepts. Automaton has 73133 states and 135100 transitions. Word has length 149 [2025-02-05 15:38:10,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:10,749 INFO L471 AbstractCegarLoop]: Abstraction has 73133 states and 135100 transitions. [2025-02-05 15:38:10,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:38:10,750 INFO L276 IsEmpty]: Start isEmpty. Operand 73133 states and 135100 transitions. [2025-02-05 15:38:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 15:38:10,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:10,757 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:10,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:38:10,758 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:10,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:10,758 INFO L85 PathProgramCache]: Analyzing trace with hash 606684418, now seen corresponding path program 1 times [2025-02-05 15:38:10,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:10,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125974510] [2025-02-05 15:38:10,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:10,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:10,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 15:38:10,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:38:10,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:10,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:38:10,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:10,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125974510] [2025-02-05 15:38:10,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125974510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:10,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:10,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:10,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717942496] [2025-02-05 15:38:10,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:10,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:10,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:10,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:10,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:10,850 INFO L87 Difference]: Start difference. First operand 73133 states and 135100 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:38:15,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:15,414 INFO L93 Difference]: Finished difference Result 146888 states and 281797 transitions. [2025-02-05 15:38:15,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:38:15,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 151 [2025-02-05 15:38:15,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:16,108 INFO L225 Difference]: With dead ends: 146888 [2025-02-05 15:38:16,108 INFO L226 Difference]: Without dead ends: 73773 [2025-02-05 15:38:16,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:38:16,883 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 9 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:16,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2574 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:38:16,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73773 states. [2025-02-05 15:38:19,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73773 to 73517. [2025-02-05 15:38:19,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73517 states, 56998 states have (on average 1.588897856065125) internal successors, (90564), 59071 states have internal predecessors, (90564), 12833 states have call successors, (12833), 3654 states have call predecessors, (12833), 3685 states have return successors, (32055), 12839 states have call predecessors, (32055), 12767 states have call successors, (32055) [2025-02-05 15:38:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73517 states to 73517 states and 135452 transitions. [2025-02-05 15:38:20,308 INFO L78 Accepts]: Start accepts. Automaton has 73517 states and 135452 transitions. Word has length 151 [2025-02-05 15:38:20,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:20,309 INFO L471 AbstractCegarLoop]: Abstraction has 73517 states and 135452 transitions. [2025-02-05 15:38:20,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:38:20,309 INFO L276 IsEmpty]: Start isEmpty. Operand 73517 states and 135452 transitions. [2025-02-05 15:38:20,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 15:38:20,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:20,316 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:20,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 15:38:20,316 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:20,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:20,316 INFO L85 PathProgramCache]: Analyzing trace with hash 414287989, now seen corresponding path program 1 times [2025-02-05 15:38:20,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:20,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659067324] [2025-02-05 15:38:20,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:20,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:20,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 15:38:20,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 15:38:20,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:20,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:20,516 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-05 15:38:20,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:20,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659067324] [2025-02-05 15:38:20,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659067324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:20,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:20,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:20,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280952903] [2025-02-05 15:38:20,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:20,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:20,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:20,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:20,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:20,519 INFO L87 Difference]: Start difference. First operand 73517 states and 135452 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-05 15:38:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:25,134 INFO L93 Difference]: Finished difference Result 150015 states and 279104 transitions. [2025-02-05 15:38:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:38:25,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) Word has length 161 [2025-02-05 15:38:25,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:25,692 INFO L225 Difference]: With dead ends: 150015 [2025-02-05 15:38:25,692 INFO L226 Difference]: Without dead ends: 76468 [2025-02-05 15:38:26,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:38:26,216 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 732 mSDsluCounter, 3409 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 4349 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:26,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 4349 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:38:26,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76468 states.