./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/aws-c-common/aws_linked_list_next_harness.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash b9d976a5c157b7db1e6b0f8b3d73c13a2dd8a00281a198d3aafefb7aed58d842 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:52:34,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:52:34,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:52:34,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:52:34,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:52:34,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:52:34,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:52:34,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:52:34,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:52:34,802 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:52:34,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:52:34,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:52:34,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:52:34,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:52:34,803 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:52:34,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:52:34,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:52:34,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:52:34,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:52:34,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:52:34,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:52:34,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:52:34,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:52:34,805 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:52:34,805 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:52:34,805 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:52:34,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:52:34,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:52:34,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:52:34,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:52:34,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:52:34,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:52:34,806 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:52:34,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:52:34,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:52:34,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:52:34,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:52:34,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:52:34,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:52:34,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:52:34,806 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9d976a5c157b7db1e6b0f8b3d73c13a2dd8a00281a198d3aafefb7aed58d842 [2025-02-08 01:52:35,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:52:35,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:52:35,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:52:35,171 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:52:35,172 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:52:35,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i [2025-02-08 01:52:36,445 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37be30420/4a7cf83606c34b0cbb4e153f192b872a/FLAG6840b9e49 [2025-02-08 01:52:36,877 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:52:36,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i [2025-02-08 01:52:36,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37be30420/4a7cf83606c34b0cbb4e153f192b872a/FLAG6840b9e49 [2025-02-08 01:52:37,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37be30420/4a7cf83606c34b0cbb4e153f192b872a [2025-02-08 01:52:37,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:52:37,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:52:37,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:52:37,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:52:37,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:52:37,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:52:37" (1/1) ... [2025-02-08 01:52:37,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5434dba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:37, skipping insertion in model container [2025-02-08 01:52:37,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:52:37" (1/1) ... [2025-02-08 01:52:37,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:52:37,278 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/aws-c-common/aws_linked_list_next_harness.i[4494,4507] [2025-02-08 01:52:37,285 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/aws-c-common/aws_linked_list_next_harness.i[4554,4567] [2025-02-08 01:52:37,750 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:37,751 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:37,751 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:37,752 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:37,752 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:37,760 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:37,764 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:37,765 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:37,765 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:37,766 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:37,767 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:37,771 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:37,771 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:38,089 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/aws-c-common/aws_linked_list_next_harness.i[150474,150487] [2025-02-08 01:52:38,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:52:38,110 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:52:38,126 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/aws-c-common/aws_linked_list_next_harness.i[4494,4507] [2025-02-08 01:52:38,128 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/aws-c-common/aws_linked_list_next_harness.i[4554,4567] [2025-02-08 01:52:38,180 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:38,181 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:38,181 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:38,183 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:38,183 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:38,193 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:38,193 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:38,194 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:38,194 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:38,195 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:38,196 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:38,196 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:38,196 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:38,328 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/aws-c-common/aws_linked_list_next_harness.i[150474,150487] [2025-02-08 01:52:38,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:52:38,543 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:52:38,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:38 WrapperNode [2025-02-08 01:52:38,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:52:38,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:52:38,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:52:38,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:52:38,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:38" (1/1) ... [2025-02-08 01:52:38,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:38" (1/1) ... [2025-02-08 01:52:38,698 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 51, calls inlined = 4, statements flattened = 56 [2025-02-08 01:52:38,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:52:38,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:52:38,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:52:38,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:52:38,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:38" (1/1) ... [2025-02-08 01:52:38,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:38" (1/1) ... [2025-02-08 01:52:38,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:38" (1/1) ... [2025-02-08 01:52:38,755 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 6, 5, 4]. 35 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5, 0]. The 2 writes are split as follows [0, 1, 0, 1]. [2025-02-08 01:52:38,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:38" (1/1) ... [2025-02-08 01:52:38,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:38" (1/1) ... [2025-02-08 01:52:38,779 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:38" (1/1) ... [2025-02-08 01:52:38,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:38" (1/1) ... [2025-02-08 01:52:38,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:38" (1/1) ... [2025-02-08 01:52:38,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:38" (1/1) ... [2025-02-08 01:52:38,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:52:38,802 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:52:38,802 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:52:38,802 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:52:38,803 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:38" (1/1) ... [2025-02-08 01:52:38,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:52:38,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:38,844 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-08 01:52:38,850 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-08 01:52:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:52:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:52:38,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:52:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:52:38,866 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:52:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:52:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:52:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:52:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:52:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 01:52:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:52:38,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:52:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:52:38,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:52:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:52:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:52:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:52:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:52:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 01:52:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:52:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:52:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:52:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 01:52:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:52:38,867 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:52:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:52:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:52:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:52:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 01:52:39,005 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:52:39,006 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:52:39,051 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4720: havoc #t~mem308.base, #t~mem308.offset;havoc #t~short309;havoc #t~mem310.base, #t~mem310.offset;havoc #t~mem311.base, #t~mem311.offset;havoc #t~short312; [2025-02-08 01:52:39,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4731: havoc #t~mem313.base, #t~mem313.offset;havoc #t~short314;havoc #t~mem315.base, #t~mem315.offset;havoc #t~mem316.base, #t~mem316.offset;havoc #t~short317; [2025-02-08 01:52:39,116 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-02-08 01:52:39,116 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:52:39,122 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:52:39,122 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:52:39,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:52:39 BoogieIcfgContainer [2025-02-08 01:52:39,122 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:52:39,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:52:39,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:52:39,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:52:39,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:52:37" (1/3) ... [2025-02-08 01:52:39,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2ad3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:52:39, skipping insertion in model container [2025-02-08 01:52:39,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:38" (2/3) ... [2025-02-08 01:52:39,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2ad3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:52:39, skipping insertion in model container [2025-02-08 01:52:39,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:52:39" (3/3) ... [2025-02-08 01:52:39,129 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_next_harness.i [2025-02-08 01:52:39,139 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:52:39,142 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_next_harness.i that has 5 procedures, 46 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-08 01:52:39,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:52:39,178 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;@4364e4f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:52:39,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:52:39,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 01:52:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 01:52:39,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:39,185 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:39,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:39,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:39,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1932416387, now seen corresponding path program 1 times [2025-02-08 01:52:39,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:39,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053517441] [2025-02-08 01:52:39,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:39,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:39,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:52:39,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:52:39,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:39,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:52:39,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:39,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053517441] [2025-02-08 01:52:39,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053517441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:39,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:39,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:52:39,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046939597] [2025-02-08 01:52:39,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:39,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:52:39,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:39,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:52:39,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:52:39,413 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 01:52:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:39,428 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2025-02-08 01:52:39,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:52:39,430 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-02-08 01:52:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:39,435 INFO L225 Difference]: With dead ends: 87 [2025-02-08 01:52:39,435 INFO L226 Difference]: Without dead ends: 43 [2025-02-08 01:52:39,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:52:39,440 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:39,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:39,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-08 01:52:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-08 01:52:39,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 01:52:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2025-02-08 01:52:39,468 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 27 [2025-02-08 01:52:39,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:39,468 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2025-02-08 01:52:39,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 01:52:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2025-02-08 01:52:39,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 01:52:39,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:39,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:39,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:52:39,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:39,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1421882210, now seen corresponding path program 1 times [2025-02-08 01:52:39,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:39,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301037233] [2025-02-08 01:52:39,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:39,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:39,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:52:39,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:52:39,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:39,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:52:40,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:40,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301037233] [2025-02-08 01:52:40,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301037233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:40,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:40,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:52:40,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481512124] [2025-02-08 01:52:40,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:40,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:52:40,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:40,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:52:40,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:52:40,568 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 01:52:40,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:40,860 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2025-02-08 01:52:40,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:52:40,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-02-08 01:52:40,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:40,862 INFO L225 Difference]: With dead ends: 54 [2025-02-08 01:52:40,862 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 01:52:40,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:52:40,863 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 9 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:40,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 296 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 01:52:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 01:52:40,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-02-08 01:52:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-02-08 01:52:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2025-02-08 01:52:40,873 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 27 [2025-02-08 01:52:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:40,873 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2025-02-08 01:52:40,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 01:52:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2025-02-08 01:52:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 01:52:40,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:40,874 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:40,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:52:40,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:40,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1130274751, now seen corresponding path program 1 times [2025-02-08 01:52:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:40,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474005087] [2025-02-08 01:52:40,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:40,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:40,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:52:40,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:52:40,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:40,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:52:41,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:41,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474005087] [2025-02-08 01:52:41,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474005087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:41,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:41,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:52:41,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758057228] [2025-02-08 01:52:41,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:41,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:52:41,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:41,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:52:41,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:52:41,053 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 01:52:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:41,152 INFO L93 Difference]: Finished difference Result 105 states and 132 transitions. [2025-02-08 01:52:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:52:41,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-02-08 01:52:41,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:41,154 INFO L225 Difference]: With dead ends: 105 [2025-02-08 01:52:41,154 INFO L226 Difference]: Without dead ends: 56 [2025-02-08 01:52:41,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:52:41,155 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 11 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:41,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 191 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:52:41,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-08 01:52:41,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-08 01:52:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 38 states have internal predecessors, (41), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 01:52:41,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-02-08 01:52:41,162 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 27 [2025-02-08 01:52:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:41,162 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-02-08 01:52:41,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 01:52:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2025-02-08 01:52:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 01:52:41,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:41,163 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] [2025-02-08 01:52:41,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:52:41,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:41,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:41,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1326788256, now seen corresponding path program 1 times [2025-02-08 01:52:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:41,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835686168] [2025-02-08 01:52:41,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:41,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:41,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:52:41,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:52:41,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:41,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:52:41,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:41,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835686168] [2025-02-08 01:52:41,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835686168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:41,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:41,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:52:41,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993501519] [2025-02-08 01:52:41,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:41,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:52:41,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:41,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:52:41,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:52:41,258 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 01:52:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:41,282 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2025-02-08 01:52:41,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:52:41,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-02-08 01:52:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:41,283 INFO L225 Difference]: With dead ends: 112 [2025-02-08 01:52:41,283 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 01:52:41,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:52:41,284 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 3 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:41,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 145 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:41,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 01:52:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2025-02-08 01:52:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2025-02-08 01:52:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2025-02-08 01:52:41,290 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 27 [2025-02-08 01:52:41,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:41,290 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2025-02-08 01:52:41,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 01:52:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2025-02-08 01:52:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 01:52:41,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:41,291 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:41,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:52:41,291 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:41,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:41,292 INFO L85 PathProgramCache]: Analyzing trace with hash -3037131, now seen corresponding path program 1 times [2025-02-08 01:52:41,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:41,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682940554] [2025-02-08 01:52:41,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:41,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:41,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 01:52:41,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 01:52:41,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:41,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:52:42,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:42,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682940554] [2025-02-08 01:52:42,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682940554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:42,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:42,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 01:52:42,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812174792] [2025-02-08 01:52:42,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:42,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:52:42,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:42,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:52:42,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:52:42,030 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 01:52:42,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:42,216 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2025-02-08 01:52:42,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:52:42,216 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2025-02-08 01:52:42,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:42,217 INFO L225 Difference]: With dead ends: 63 [2025-02-08 01:52:42,217 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 01:52:42,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:52:42,218 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 10 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:42,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 342 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:52:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 01:52:42,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-02-08 01:52:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 41 states have internal predecessors, (44), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-02-08 01:52:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2025-02-08 01:52:42,226 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 41 [2025-02-08 01:52:42,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:42,226 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2025-02-08 01:52:42,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 01:52:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2025-02-08 01:52:42,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 01:52:42,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:42,227 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:42,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:52:42,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:42,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:42,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1739773204, now seen corresponding path program 1 times [2025-02-08 01:52:42,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:42,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086832530] [2025-02-08 01:52:42,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:42,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:42,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 01:52:42,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 01:52:42,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:42,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:52:42,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:42,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086832530] [2025-02-08 01:52:42,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086832530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:42,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:42,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:52:42,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575379666] [2025-02-08 01:52:42,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:42,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:52:42,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:42,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:52:42,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:52:42,623 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 01:52:42,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:42,799 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2025-02-08 01:52:42,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:52:42,801 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2025-02-08 01:52:42,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:42,802 INFO L225 Difference]: With dead ends: 104 [2025-02-08 01:52:42,802 INFO L226 Difference]: Without dead ends: 65 [2025-02-08 01:52:42,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:52:42,803 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 13 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:42,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 213 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:52:42,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-08 01:52:42,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-08 01:52:42,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 46 states have internal predecessors, (49), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-08 01:52:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2025-02-08 01:52:42,823 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 41 [2025-02-08 01:52:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:42,824 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2025-02-08 01:52:42,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 01:52:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2025-02-08 01:52:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 01:52:42,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:42,825 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:42,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:52:42,826 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:42,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:42,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1543259699, now seen corresponding path program 1 times [2025-02-08 01:52:42,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:42,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423692356] [2025-02-08 01:52:42,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:42,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:42,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 01:52:42,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 01:52:42,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:42,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:52:42,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:42,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423692356] [2025-02-08 01:52:42,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423692356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:42,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:42,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:52:42,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871741472] [2025-02-08 01:52:42,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:42,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:52:42,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:42,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:52:42,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:52:42,947 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 01:52:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:42,997 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2025-02-08 01:52:42,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:52:42,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2025-02-08 01:52:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:42,998 INFO L225 Difference]: With dead ends: 116 [2025-02-08 01:52:42,998 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 01:52:42,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:52:42,999 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:42,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 181 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 01:52:43,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2025-02-08 01:52:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-08 01:52:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-02-08 01:52:43,006 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 41 [2025-02-08 01:52:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:43,006 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-02-08 01:52:43,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 01:52:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2025-02-08 01:52:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 01:52:43,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:43,007 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:43,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:52:43,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:43,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:43,008 INFO L85 PathProgramCache]: Analyzing trace with hash -792529683, now seen corresponding path program 1 times [2025-02-08 01:52:43,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:43,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468415856] [2025-02-08 01:52:43,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:43,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:43,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 01:52:43,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 01:52:43,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:43,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 01:52:43,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:43,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468415856] [2025-02-08 01:52:43,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468415856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:43,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:43,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:52:43,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896521423] [2025-02-08 01:52:43,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:43,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:52:43,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:43,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:52:43,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:52:43,148 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 01:52:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:43,196 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2025-02-08 01:52:43,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:52:43,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2025-02-08 01:52:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:43,197 INFO L225 Difference]: With dead ends: 67 [2025-02-08 01:52:43,197 INFO L226 Difference]: Without dead ends: 65 [2025-02-08 01:52:43,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:52:43,198 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:43,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 229 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:43,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-08 01:52:43,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-08 01:52:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 46 states have internal predecessors, (50), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-08 01:52:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2025-02-08 01:52:43,204 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 47 [2025-02-08 01:52:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:43,205 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2025-02-08 01:52:43,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 01:52:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2025-02-08 01:52:43,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 01:52:43,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:43,206 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:52:43,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:52:43,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:43,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:43,206 INFO L85 PathProgramCache]: Analyzing trace with hash -941037529, now seen corresponding path program 1 times [2025-02-08 01:52:43,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:43,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346870421] [2025-02-08 01:52:43,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:43,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:43,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 01:52:43,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 01:52:43,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:43,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:43,816 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-08 01:52:43,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:43,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346870421] [2025-02-08 01:52:43,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346870421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:43,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:43,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:52:43,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389542034] [2025-02-08 01:52:43,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:43,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:52:43,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:43,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:52:43,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:52:43,818 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-08 01:52:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:44,010 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2025-02-08 01:52:44,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:52:44,011 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2025-02-08 01:52:44,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:44,011 INFO L225 Difference]: With dead ends: 76 [2025-02-08 01:52:44,012 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 01:52:44,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:52:44,012 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 10 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:44,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 286 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 01:52:44,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 01:52:44,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2025-02-08 01:52:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-02-08 01:52:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2025-02-08 01:52:44,020 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 61 [2025-02-08 01:52:44,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:44,021 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2025-02-08 01:52:44,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-08 01:52:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2025-02-08 01:52:44,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 01:52:44,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:44,022 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 01:52:44,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:52:44,022 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:44,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:44,022 INFO L85 PathProgramCache]: Analyzing trace with hash 801772806, now seen corresponding path program 1 times [2025-02-08 01:52:44,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:44,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637220601] [2025-02-08 01:52:44,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:44,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:44,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 01:52:44,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 01:52:44,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:44,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-08 01:52:44,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:44,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637220601] [2025-02-08 01:52:44,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637220601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:44,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:44,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:52:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066529036] [2025-02-08 01:52:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:44,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:52:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:44,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:52:44,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:52:44,193 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-08 01:52:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:44,303 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2025-02-08 01:52:44,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:52:44,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2025-02-08 01:52:44,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:44,304 INFO L225 Difference]: With dead ends: 100 [2025-02-08 01:52:44,304 INFO L226 Difference]: Without dead ends: 73 [2025-02-08 01:52:44,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:52:44,305 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 12 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:44,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 183 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:52:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-08 01:52:44,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-02-08 01:52:44,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.125) internal successors, (54), 52 states have internal predecessors, (54), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-02-08 01:52:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2025-02-08 01:52:44,313 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 61 [2025-02-08 01:52:44,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:44,313 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2025-02-08 01:52:44,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-08 01:52:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2025-02-08 01:52:44,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 01:52:44,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:44,314 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 01:52:44,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:52:44,314 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:44,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:44,314 INFO L85 PathProgramCache]: Analyzing trace with hash 605259301, now seen corresponding path program 1 times [2025-02-08 01:52:44,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:44,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618574215] [2025-02-08 01:52:44,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:44,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:44,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 01:52:44,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 01:52:44,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:44,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-08 01:52:44,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:44,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618574215] [2025-02-08 01:52:44,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618574215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:44,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:44,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:52:44,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315462717] [2025-02-08 01:52:44,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:44,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:52:44,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:44,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:52:44,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:52:44,388 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-08 01:52:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:44,405 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2025-02-08 01:52:44,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:52:44,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2025-02-08 01:52:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:44,407 INFO L225 Difference]: With dead ends: 101 [2025-02-08 01:52:44,409 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 01:52:44,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:52:44,409 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:44,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 01:52:44,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-08 01:52:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 44 states have internal predecessors, (46), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2025-02-08 01:52:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2025-02-08 01:52:44,421 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 61 [2025-02-08 01:52:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:44,421 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2025-02-08 01:52:44,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-08 01:52:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2025-02-08 01:52:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-08 01:52:44,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:44,421 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:44,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:52:44,421 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:44,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:44,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1522262138, now seen corresponding path program 1 times [2025-02-08 01:52:44,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:44,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343473430] [2025-02-08 01:52:44,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:44,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:44,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 01:52:44,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 01:52:44,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:44,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:52:45,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:45,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343473430] [2025-02-08 01:52:45,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343473430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:45,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:45,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 01:52:45,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668568210] [2025-02-08 01:52:45,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:45,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:52:45,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:45,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:52:45,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:52:45,261 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-08 01:52:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:45,460 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2025-02-08 01:52:45,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:52:45,460 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 75 [2025-02-08 01:52:45,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:45,461 INFO L225 Difference]: With dead ends: 75 [2025-02-08 01:52:45,461 INFO L226 Difference]: Without dead ends: 73 [2025-02-08 01:52:45,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-08 01:52:45,462 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:45,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 336 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 01:52:45,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-08 01:52:45,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2025-02-08 01:52:45,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 50 states have internal predecessors, (51), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-02-08 01:52:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2025-02-08 01:52:45,474 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 75 [2025-02-08 01:52:45,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:45,474 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2025-02-08 01:52:45,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-08 01:52:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2025-02-08 01:52:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-08 01:52:45,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:45,475 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:45,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 01:52:45,475 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:45,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:45,476 INFO L85 PathProgramCache]: Analyzing trace with hash 220548197, now seen corresponding path program 1 times [2025-02-08 01:52:45,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:45,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578341192] [2025-02-08 01:52:45,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:45,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:45,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 01:52:45,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 01:52:45,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:45,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:52:46,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:46,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578341192] [2025-02-08 01:52:46,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578341192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:46,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:46,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:52:46,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419370600] [2025-02-08 01:52:46,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:46,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:52:46,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:46,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:52:46,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:52:46,255 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-08 01:52:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:46,469 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2025-02-08 01:52:46,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:52:46,469 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 75 [2025-02-08 01:52:46,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:46,470 INFO L225 Difference]: With dead ends: 84 [2025-02-08 01:52:46,470 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 01:52:46,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-08 01:52:46,471 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 13 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:46,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 230 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:52:46,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 01:52:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-08 01:52:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 50 states have internal predecessors, (50), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-02-08 01:52:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2025-02-08 01:52:46,484 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 75 [2025-02-08 01:52:46,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:46,485 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2025-02-08 01:52:46,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-08 01:52:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2025-02-08 01:52:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-08 01:52:46,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:46,488 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 01:52:46,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 01:52:46,489 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:46,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:46,490 INFO L85 PathProgramCache]: Analyzing trace with hash 24034692, now seen corresponding path program 1 times [2025-02-08 01:52:46,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:46,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402332698] [2025-02-08 01:52:46,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:46,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:46,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 01:52:46,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 01:52:46,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:46,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:52:46,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:46,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402332698] [2025-02-08 01:52:46,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402332698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:46,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:46,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:52:46,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967060770] [2025-02-08 01:52:46,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:46,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:52:46,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:46,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:52:46,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:52:46,676 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-08 01:52:46,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:46,741 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2025-02-08 01:52:46,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:52:46,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 75 [2025-02-08 01:52:46,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:46,742 INFO L225 Difference]: With dead ends: 85 [2025-02-08 01:52:46,742 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 01:52:46,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:52:46,743 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:46,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 255 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:46,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 01:52:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-08 01:52:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.0) internal successors, (40), 40 states have internal predecessors, (40), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 01:52:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2025-02-08 01:52:46,749 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 75 [2025-02-08 01:52:46,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:46,749 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2025-02-08 01:52:46,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-08 01:52:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2025-02-08 01:52:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 01:52:46,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:46,750 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:46,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 01:52:46,750 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:46,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:46,751 INFO L85 PathProgramCache]: Analyzing trace with hash -913101430, now seen corresponding path program 1 times [2025-02-08 01:52:46,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:46,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653495238] [2025-02-08 01:52:46,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:46,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:46,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 01:52:46,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 01:52:46,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:46,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-08 01:52:47,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:47,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653495238] [2025-02-08 01:52:47,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653495238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:47,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:47,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:52:47,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905890400] [2025-02-08 01:52:47,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:47,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:52:47,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:47,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:52:47,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:52:47,024 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-08 01:52:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:47,109 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2025-02-08 01:52:47,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:52:47,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 81 [2025-02-08 01:52:47,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:47,110 INFO L225 Difference]: With dead ends: 61 [2025-02-08 01:52:47,110 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 01:52:47,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:52:47,111 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:47,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 212 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:52:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 01:52:47,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 01:52:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:52:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 01:52:47,112 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2025-02-08 01:52:47,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:47,112 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 01:52:47,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-08 01:52:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 01:52:47,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 01:52:47,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 01:52:47,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 01:52:47,117 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:47,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 01:52:47,796 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:52:47,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:52:47 BoogieIcfgContainer [2025-02-08 01:52:47,801 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:52:47,802 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:52:47,802 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:52:47,802 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:52:47,802 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:52:39" (3/4) ... [2025-02-08 01:52:47,804 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 01:52:47,808 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2025-02-08 01:52:47,808 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:52:47,808 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-08 01:52:47,808 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 01:52:47,810 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-02-08 01:52:47,811 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 01:52:47,811 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 01:52:47,811 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 01:52:47,900 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:52:47,903 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:52:47,903 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:52:47,904 INFO L158 Benchmark]: Toolchain (without parser) took 10880.31ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 106.1MB in the beginning and 294.0MB in the end (delta: -187.9MB). Peak memory consumption was 144.9MB. Max. memory is 16.1GB. [2025-02-08 01:52:47,904 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 226.5MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:52:47,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1520.80ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 47.9MB in the end (delta: 58.2MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2025-02-08 01:52:47,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 153.06ms. Allocated memory is still 142.6MB. Free memory was 47.9MB in the beginning and 99.9MB in the end (delta: -52.0MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2025-02-08 01:52:47,906 INFO L158 Benchmark]: Boogie Preprocessor took 98.56ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 96.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:52:47,906 INFO L158 Benchmark]: IcfgBuilder took 320.20ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 76.4MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 01:52:47,906 INFO L158 Benchmark]: TraceAbstraction took 8678.01ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 75.6MB in the beginning and 302.2MB in the end (delta: -226.5MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. [2025-02-08 01:52:47,906 INFO L158 Benchmark]: Witness Printer took 100.91ms. Allocated memory is still 478.2MB. Free memory was 302.2MB in the beginning and 294.0MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:52:47,907 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 226.5MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1520.80ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 47.9MB in the end (delta: 58.2MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 153.06ms. Allocated memory is still 142.6MB. Free memory was 47.9MB in the beginning and 99.9MB in the end (delta: -52.0MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.56ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 96.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 320.20ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 76.4MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8678.01ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 75.6MB in the beginning and 302.2MB in the end (delta: -226.5MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. * Witness Printer took 100.91ms. Allocated memory is still 478.2MB. Free memory was 302.2MB in the beginning and 294.0MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 3295 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2542 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1510 IncrementalHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 753 mSDtfsCounter, 1510 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=9, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 16 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 767 NumberOfCodeBlocks, 767 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 752 ConstructedInterpolants, 0 QuantifiedInterpolants, 3936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 445/445 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 01:52:47,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE