./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c37a0beecaaffccfccd39c8b76dad022f083d470c5665e9f01bdfeab207ad41e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:08:50,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:08:50,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 18:08:50,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:08:50,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:08:50,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:08:50,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:08:50,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:08:50,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:08:50,806 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:08:50,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:08:50,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:08:50,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:08:50,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:08:50,807 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:08:50,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:08:50,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:08:50,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 18:08:50,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:08:50,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:08:50,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:08:50,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:08:50,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:08:50,808 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:08:50,808 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:08:50,808 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:08:50,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:08:50,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:08:50,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:08:50,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:08:50,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:08:50,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:08:50,809 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:08:50,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:08:50,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 18:08:50,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 18:08:50,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:08:50,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:08:50,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:08:50,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:08:50,809 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> c37a0beecaaffccfccd39c8b76dad022f083d470c5665e9f01bdfeab207ad41e [2025-03-08 18:08:51,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:08:51,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:08:51,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:08:51,060 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:08:51,060 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:08:51,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i [2025-03-08 18:08:52,341 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec75714b/7edf37776be44c65bd1d96e5c6f65fc9/FLAGe00c76c30 [2025-03-08 18:08:52,899 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:08:52,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i [2025-03-08 18:08:52,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec75714b/7edf37776be44c65bd1d96e5c6f65fc9/FLAGe00c76c30 [2025-03-08 18:08:52,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec75714b/7edf37776be44c65bd1d96e5c6f65fc9 [2025-03-08 18:08:52,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:08:52,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:08:52,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:08:52,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:08:52,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:08:52,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:08:52" (1/1) ... [2025-03-08 18:08:52,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5f7bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:52, skipping insertion in model container [2025-03-08 18:08:52,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:08:52" (1/1) ... [2025-03-08 18:08:53,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:08:53,228 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4494,4507] [2025-03-08 18:08:53,233 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4554,4567] [2025-03-08 18:08:53,728 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:53,729 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:53,729 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:53,730 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:53,731 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:53,741 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:53,741 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:53,743 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:53,743 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:53,745 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:53,746 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:53,746 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:53,746 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:54,040 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[150277,150290] [2025-03-08 18:08:54,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:08:54,052 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:08:54,063 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4494,4507] [2025-03-08 18:08:54,063 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4554,4567] [2025-03-08 18:08:54,101 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:54,101 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:54,101 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:54,102 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:54,102 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:54,116 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:54,116 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:54,117 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:54,117 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:54,118 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:54,118 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:54,118 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:54,118 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:54,193 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[150277,150290] [2025-03-08 18:08:54,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:08:54,349 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:08:54,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:54 WrapperNode [2025-03-08 18:08:54,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:08:54,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:08:54,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:08:54,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:08:54,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:54" (1/1) ... [2025-03-08 18:08:54,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:54" (1/1) ... [2025-03-08 18:08:54,450 INFO L138 Inliner]: procedures = 668, calls = 1034, calls flagged for inlining = 51, calls inlined = 4, statements flattened = 89 [2025-03-08 18:08:54,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:08:54,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:08:54,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:08:54,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:08:54,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:54" (1/1) ... [2025-03-08 18:08:54,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:54" (1/1) ... [2025-03-08 18:08:54,463 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:54" (1/1) ... [2025-03-08 18:08:54,480 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 13, 5]. 65 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 4 writes are split as follows [0, 4, 0]. [2025-03-08 18:08:54,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:54" (1/1) ... [2025-03-08 18:08:54,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:54" (1/1) ... [2025-03-08 18:08:54,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:54" (1/1) ... [2025-03-08 18:08:54,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:54" (1/1) ... [2025-03-08 18:08:54,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:54" (1/1) ... [2025-03-08 18:08:54,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:54" (1/1) ... [2025-03-08 18:08:54,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:08:54,510 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:08:54,510 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:08:54,510 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:08:54,511 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:54" (1/1) ... [2025-03-08 18:08:54,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:08:54,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:54,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 18:08:54,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 18:08:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2025-03-08 18:08:54,557 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2025-03-08 18:08:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:08:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 18:08:54,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 18:08:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:08:54,557 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:08:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-08 18:08:54,557 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-08 18:08:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:08:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 18:08:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 18:08:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 18:08:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:08:54,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:08:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-03-08 18:08:54,558 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-03-08 18:08:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 18:08:54,558 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 18:08:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:08:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 18:08:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 18:08:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 18:08:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 18:08:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 18:08:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 18:08:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 18:08:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 18:08:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 18:08:54,737 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:08:54,739 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:08:54,769 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-03-08 18:08:54,893 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-08 18:08:54,899 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4685: havoc #t~mem302.base, #t~mem302.offset; [2025-03-08 18:08:54,918 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-08 18:08:54,918 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:08:54,927 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:08:54,928 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:08:54,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:08:54 BoogieIcfgContainer [2025-03-08 18:08:54,929 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:08:54,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:08:54,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:08:54,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:08:54,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:08:52" (1/3) ... [2025-03-08 18:08:54,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552969c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:08:54, skipping insertion in model container [2025-03-08 18:08:54,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:54" (2/3) ... [2025-03-08 18:08:54,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552969c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:08:54, skipping insertion in model container [2025-03-08 18:08:54,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:08:54" (3/3) ... [2025-03-08 18:08:54,936 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_init_harness.i [2025-03-08 18:08:54,947 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:08:54,948 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_init_harness.i that has 7 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 18:08:54,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:08:54,994 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;@27e7c093, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:08:54,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:08:54,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 45 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 18:08:55,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 18:08:55,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:55,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:08:55,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:55,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:55,006 INFO L85 PathProgramCache]: Analyzing trace with hash 149093260, now seen corresponding path program 1 times [2025-03-08 18:08:55,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:55,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967606835] [2025-03-08 18:08:55,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:55,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:55,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 18:08:55,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 18:08:55,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:55,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:08:55,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:55,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967606835] [2025-03-08 18:08:55,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967606835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:55,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:55,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 18:08:55,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430078000] [2025-03-08 18:08:55,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:55,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 18:08:55,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:55,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 18:08:55,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:08:55,257 INFO L87 Difference]: Start difference. First operand has 62 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 45 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 18:08:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:55,275 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2025-03-08 18:08:55,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 18:08:55,278 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-08 18:08:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:55,284 INFO L225 Difference]: With dead ends: 119 [2025-03-08 18:08:55,284 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 18:08:55,287 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-03-08 18:08:55,291 INFO L435 NwaCegarLoop]: 76 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, 76 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-03-08 18:08:55,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:08:55,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 18:08:55,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-08 18:08:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 18:08:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2025-03-08 18:08:55,322 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 27 [2025-03-08 18:08:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:55,323 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2025-03-08 18:08:55,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 18:08:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2025-03-08 18:08:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 18:08:55,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:55,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:08:55,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 18:08:55,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:55,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:55,326 INFO L85 PathProgramCache]: Analyzing trace with hash 360444173, now seen corresponding path program 1 times [2025-03-08 18:08:55,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:55,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196300415] [2025-03-08 18:08:55,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:55,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:55,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 18:08:55,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 18:08:55,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:55,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:08:56,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:56,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196300415] [2025-03-08 18:08:56,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196300415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:56,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:56,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 18:08:56,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593772351] [2025-03-08 18:08:56,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:56,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 18:08:56,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:56,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 18:08:56,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:08:56,268 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand has 9 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 18:08:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:56,460 INFO L93 Difference]: Finished difference Result 113 states and 142 transitions. [2025-03-08 18:08:56,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:08:56,460 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-08 18:08:56,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:56,464 INFO L225 Difference]: With dead ends: 113 [2025-03-08 18:08:56,464 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 18:08:56,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-08 18:08:56,466 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 19 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:56,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 411 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:08:56,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 18:08:56,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-03-08 18:08:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.302325581395349) internal successors, (56), 45 states have internal predecessors, (56), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-08 18:08:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2025-03-08 18:08:56,479 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 27 [2025-03-08 18:08:56,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:56,479 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2025-03-08 18:08:56,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 18:08:56,480 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2025-03-08 18:08:56,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 18:08:56,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:56,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:08:56,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 18:08:56,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:56,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:56,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1447010290, now seen corresponding path program 1 times [2025-03-08 18:08:56,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:56,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105808226] [2025-03-08 18:08:56,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:56,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:56,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 18:08:56,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 18:08:56,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:56,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:08:57,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:57,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105808226] [2025-03-08 18:08:57,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105808226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:57,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:57,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 18:08:57,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603618817] [2025-03-08 18:08:57,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:57,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 18:08:57,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:57,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 18:08:57,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 18:08:57,070 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 18:08:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:57,282 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2025-03-08 18:08:57,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 18:08:57,283 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-08 18:08:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:57,285 INFO L225 Difference]: With dead ends: 144 [2025-03-08 18:08:57,286 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 18:08:57,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-08 18:08:57,287 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 55 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:57,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 474 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:08:57,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 18:08:57,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2025-03-08 18:08:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.375) internal successors, (77), 58 states have internal predecessors, (77), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-08 18:08:57,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2025-03-08 18:08:57,297 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 27 [2025-03-08 18:08:57,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:57,297 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2025-03-08 18:08:57,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 18:08:57,297 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2025-03-08 18:08:57,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 18:08:57,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:57,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:08:57,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 18:08:57,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:57,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:57,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1051005647, now seen corresponding path program 1 times [2025-03-08 18:08:57,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:57,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445153734] [2025-03-08 18:08:57,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:57,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:57,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 18:08:57,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 18:08:57,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:57,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:08:57,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:57,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445153734] [2025-03-08 18:08:57,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445153734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:57,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:57,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 18:08:57,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817088212] [2025-03-08 18:08:57,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:57,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 18:08:57,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:57,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 18:08:57,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 18:08:57,753 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 18:08:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:58,036 INFO L93 Difference]: Finished difference Result 170 states and 229 transitions. [2025-03-08 18:08:58,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 18:08:58,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-08 18:08:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:58,038 INFO L225 Difference]: With dead ends: 170 [2025-03-08 18:08:58,038 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 18:08:58,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:08:58,039 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 38 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:58,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 479 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:08:58,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 18:08:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 81. [2025-03-08 18:08:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 64 states have internal predecessors, (86), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-08 18:08:58,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 108 transitions. [2025-03-08 18:08:58,050 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 108 transitions. Word has length 27 [2025-03-08 18:08:58,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:58,050 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 108 transitions. [2025-03-08 18:08:58,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 18:08:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 108 transitions. [2025-03-08 18:08:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 18:08:58,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:58,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:08:58,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 18:08:58,052 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:58,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:58,052 INFO L85 PathProgramCache]: Analyzing trace with hash 757602640, now seen corresponding path program 1 times [2025-03-08 18:08:58,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:58,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363010449] [2025-03-08 18:08:58,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:58,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:58,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 18:08:58,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 18:08:58,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:58,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:08:58,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:58,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363010449] [2025-03-08 18:08:58,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363010449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:58,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:58,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 18:08:58,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844233478] [2025-03-08 18:08:58,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:58,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 18:08:58,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:58,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 18:08:58,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 18:08:58,845 INFO L87 Difference]: Start difference. First operand 81 states and 108 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 18:08:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:59,293 INFO L93 Difference]: Finished difference Result 182 states and 250 transitions. [2025-03-08 18:08:59,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 18:08:59,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-08 18:08:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:59,294 INFO L225 Difference]: With dead ends: 182 [2025-03-08 18:08:59,294 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 18:08:59,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 18:08:59,299 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 25 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:59,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 519 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:08:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 18:08:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 81. [2025-03-08 18:08:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 64 states have internal predecessors, (86), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-08 18:08:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 108 transitions. [2025-03-08 18:08:59,320 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 108 transitions. Word has length 27 [2025-03-08 18:08:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:59,320 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 108 transitions. [2025-03-08 18:08:59,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 18:08:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 108 transitions. [2025-03-08 18:08:59,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 18:08:59,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:59,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:08:59,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 18:08:59,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:59,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:59,322 INFO L85 PathProgramCache]: Analyzing trace with hash 60541519, now seen corresponding path program 1 times [2025-03-08 18:08:59,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:59,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342539895] [2025-03-08 18:08:59,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:59,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:59,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 18:08:59,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 18:08:59,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:59,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:08:59,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:59,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342539895] [2025-03-08 18:08:59,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342539895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:59,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:59,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:08:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262355316] [2025-03-08 18:08:59,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:59,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:08:59,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:59,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:08:59,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:08:59,399 INFO L87 Difference]: Start difference. First operand 81 states and 108 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 18:08:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:59,423 INFO L93 Difference]: Finished difference Result 153 states and 207 transitions. [2025-03-08 18:08:59,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:08:59,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-08 18:08:59,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:59,424 INFO L225 Difference]: With dead ends: 153 [2025-03-08 18:08:59,425 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 18:08:59,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:08:59,427 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:59,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:08:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 18:08:59,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-08 18:08:59,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 62 states have internal predecessors, (82), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-08 18:08:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2025-03-08 18:08:59,442 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 27 [2025-03-08 18:08:59,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:59,443 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2025-03-08 18:08:59,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 18:08:59,444 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2025-03-08 18:08:59,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 18:08:59,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:59,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:08:59,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 18:08:59,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:59,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:59,447 INFO L85 PathProgramCache]: Analyzing trace with hash -232861488, now seen corresponding path program 1 times [2025-03-08 18:08:59,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:59,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947694128] [2025-03-08 18:08:59,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:59,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:59,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 18:08:59,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 18:08:59,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:59,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:59,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:08:59,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:59,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947694128] [2025-03-08 18:08:59,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947694128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:59,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:59,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:08:59,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851209282] [2025-03-08 18:08:59,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:59,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:08:59,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:59,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:08:59,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:08:59,546 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 18:08:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:59,565 INFO L93 Difference]: Finished difference Result 151 states and 202 transitions. [2025-03-08 18:08:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:08:59,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-08 18:08:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:59,566 INFO L225 Difference]: With dead ends: 151 [2025-03-08 18:08:59,566 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 18:08:59,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:08:59,567 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:59,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:08:59,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 18:08:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-08 18:08:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 62 states have internal predecessors, (80), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-08 18:08:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2025-03-08 18:08:59,591 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 27 [2025-03-08 18:08:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:59,591 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2025-03-08 18:08:59,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 18:08:59,591 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2025-03-08 18:08:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 18:08:59,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:59,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:08:59,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 18:08:59,592 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:59,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2029812847, now seen corresponding path program 1 times [2025-03-08 18:08:59,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:59,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263827687] [2025-03-08 18:08:59,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:59,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:59,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 18:08:59,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 18:08:59,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:59,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:08:59,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:59,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263827687] [2025-03-08 18:08:59,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263827687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:59,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:59,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 18:08:59,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417500229] [2025-03-08 18:08:59,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:59,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:08:59,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:59,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:08:59,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:08:59,725 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 18:09:00,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:00,071 INFO L93 Difference]: Finished difference Result 164 states and 215 transitions. [2025-03-08 18:09:00,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:09:00,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-08 18:09:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:00,076 INFO L225 Difference]: With dead ends: 164 [2025-03-08 18:09:00,076 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 18:09:00,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:09:00,077 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 20 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:00,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 462 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:09:00,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 18:09:00,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-08 18:09:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 54 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-08 18:09:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2025-03-08 18:09:00,107 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 27 [2025-03-08 18:09:00,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:00,107 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2025-03-08 18:09:00,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 18:09:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2025-03-08 18:09:00,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 18:09:00,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:00,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:00,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 18:09:00,108 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:00,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:00,108 INFO L85 PathProgramCache]: Analyzing trace with hash 955943814, now seen corresponding path program 1 times [2025-03-08 18:09:00,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:00,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922285301] [2025-03-08 18:09:00,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:00,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:00,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 18:09:00,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 18:09:00,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:00,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:09:00,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:00,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922285301] [2025-03-08 18:09:00,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922285301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:00,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:09:00,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 18:09:00,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677183714] [2025-03-08 18:09:00,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:00,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:09:00,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:00,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:09:00,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:09:00,344 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 18:09:00,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:00,589 INFO L93 Difference]: Finished difference Result 147 states and 186 transitions. [2025-03-08 18:09:00,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 18:09:00,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-08 18:09:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:00,591 INFO L225 Difference]: With dead ends: 147 [2025-03-08 18:09:00,591 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 18:09:00,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:09:00,592 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 21 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:00,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 366 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:09:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 18:09:00,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-03-08 18:09:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 54 states have internal predecessors, (67), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-08 18:09:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2025-03-08 18:09:00,618 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 28 [2025-03-08 18:09:00,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:00,618 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2025-03-08 18:09:00,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 18:09:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2025-03-08 18:09:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 18:09:00,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:00,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:00,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 18:09:00,619 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:00,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:00,620 INFO L85 PathProgramCache]: Analyzing trace with hash 959059630, now seen corresponding path program 1 times [2025-03-08 18:09:00,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:00,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381323483] [2025-03-08 18:09:00,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:00,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:00,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 18:09:00,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 18:09:00,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:00,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:09:00,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:00,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381323483] [2025-03-08 18:09:00,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381323483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:00,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:09:00,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 18:09:00,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489920870] [2025-03-08 18:09:00,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:00,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 18:09:00,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:00,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 18:09:00,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:09:00,895 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 18:09:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:01,091 INFO L93 Difference]: Finished difference Result 159 states and 202 transitions. [2025-03-08 18:09:01,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 18:09:01,093 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-08 18:09:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:01,094 INFO L225 Difference]: With dead ends: 159 [2025-03-08 18:09:01,095 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 18:09:01,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 18:09:01,097 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 30 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:01,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 344 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:09:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 18:09:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2025-03-08 18:09:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 56 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-08 18:09:01,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2025-03-08 18:09:01,113 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 30 [2025-03-08 18:09:01,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:01,114 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-03-08 18:09:01,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 18:09:01,114 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2025-03-08 18:09:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 18:09:01,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:01,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:01,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 18:09:01,115 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:01,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:01,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1029919960, now seen corresponding path program 1 times [2025-03-08 18:09:01,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:01,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360169022] [2025-03-08 18:09:01,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:01,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:01,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 18:09:01,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 18:09:01,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:01,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:09:01,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:01,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360169022] [2025-03-08 18:09:01,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360169022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:01,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:09:01,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 18:09:01,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337046513] [2025-03-08 18:09:01,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:01,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 18:09:01,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:01,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 18:09:01,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:09:01,280 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 18:09:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:01,456 INFO L93 Difference]: Finished difference Result 161 states and 202 transitions. [2025-03-08 18:09:01,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:09:01,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-03-08 18:09:01,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:01,459 INFO L225 Difference]: With dead ends: 161 [2025-03-08 18:09:01,459 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 18:09:01,459 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-03-08 18:09:01,460 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 27 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:01,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 410 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:09:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 18:09:01,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2025-03-08 18:09:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 58 states have internal predecessors, (71), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-08 18:09:01,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2025-03-08 18:09:01,473 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 31 [2025-03-08 18:09:01,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:01,473 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2025-03-08 18:09:01,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 18:09:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2025-03-08 18:09:01,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 18:09:01,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:01,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:01,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 18:09:01,474 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:01,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:01,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1684418345, now seen corresponding path program 1 times [2025-03-08 18:09:01,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:01,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133146387] [2025-03-08 18:09:01,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:01,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:01,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 18:09:01,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 18:09:01,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:01,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:09:03,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:03,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133146387] [2025-03-08 18:09:03,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133146387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:03,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:09:03,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 18:09:03,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013855845] [2025-03-08 18:09:03,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:03,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 18:09:03,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:03,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 18:09:03,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-08 18:09:03,202 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 18:09:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:03,746 INFO L93 Difference]: Finished difference Result 166 states and 210 transitions. [2025-03-08 18:09:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 18:09:03,746 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2025-03-08 18:09:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:03,748 INFO L225 Difference]: With dead ends: 166 [2025-03-08 18:09:03,748 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 18:09:03,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-03-08 18:09:03,749 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 33 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:03,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 537 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:09:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 18:09:03,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 80. [2025-03-08 18:09:03,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.271186440677966) internal successors, (75), 62 states have internal predecessors, (75), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-08 18:09:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2025-03-08 18:09:03,768 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 39 [2025-03-08 18:09:03,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:03,768 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2025-03-08 18:09:03,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 18:09:03,769 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2025-03-08 18:09:03,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 18:09:03,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:03,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:03,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 18:09:03,770 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:03,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:03,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1555335626, now seen corresponding path program 1 times [2025-03-08 18:09:03,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:03,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467280332] [2025-03-08 18:09:03,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:03,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:03,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 18:09:03,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 18:09:03,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:03,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:09:04,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:04,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467280332] [2025-03-08 18:09:04,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467280332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:04,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:09:04,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 18:09:04,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900338158] [2025-03-08 18:09:04,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:04,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 18:09:04,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:04,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 18:09:04,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-08 18:09:04,270 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 18:09:04,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:04,688 INFO L93 Difference]: Finished difference Result 193 states and 258 transitions. [2025-03-08 18:09:04,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 18:09:04,688 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2025-03-08 18:09:04,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:04,690 INFO L225 Difference]: With dead ends: 193 [2025-03-08 18:09:04,690 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 18:09:04,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-03-08 18:09:04,691 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 44 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:04,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 641 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:09:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 18:09:04,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 85. [2025-03-08 18:09:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 67 states have internal predecessors, (80), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-08 18:09:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2025-03-08 18:09:04,708 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 39 [2025-03-08 18:09:04,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:04,709 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2025-03-08 18:09:04,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 18:09:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2025-03-08 18:09:04,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 18:09:04,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:04,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:04,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 18:09:04,710 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:04,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:04,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2060894251, now seen corresponding path program 1 times [2025-03-08 18:09:04,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:04,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752052291] [2025-03-08 18:09:04,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:04,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:04,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 18:09:04,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 18:09:04,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:04,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:09:05,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:05,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752052291] [2025-03-08 18:09:05,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752052291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:05,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:09:05,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 18:09:05,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002447070] [2025-03-08 18:09:05,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:05,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 18:09:05,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:05,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 18:09:05,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 18:09:05,002 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 18:09:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:05,575 INFO L93 Difference]: Finished difference Result 196 states and 267 transitions. [2025-03-08 18:09:05,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 18:09:05,576 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-03-08 18:09:05,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:05,577 INFO L225 Difference]: With dead ends: 196 [2025-03-08 18:09:05,577 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 18:09:05,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-08 18:09:05,578 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 34 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:05,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 582 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 18:09:05,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 18:09:05,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2025-03-08 18:09:05,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 68 states have internal predecessors, (80), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2025-03-08 18:09:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2025-03-08 18:09:05,594 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 39 [2025-03-08 18:09:05,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:05,594 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2025-03-08 18:09:05,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 18:09:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2025-03-08 18:09:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 18:09:05,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:05,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:05,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 18:09:05,596 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:05,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:05,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1503669757, now seen corresponding path program 1 times [2025-03-08 18:09:05,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:05,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423370144] [2025-03-08 18:09:05,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:05,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:05,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 18:09:05,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 18:09:05,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:05,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:09:05,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:05,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423370144] [2025-03-08 18:09:05,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423370144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:05,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4710687] [2025-03-08 18:09:05,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:05,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:05,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:05,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:09:05,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 18:09:06,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 18:09:06,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 18:09:06,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:06,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:06,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 18:09:06,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:06,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 18:09:06,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 18:09:11,031 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2025-03-08 18:09:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:09:11,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:09:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:09:11,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4710687] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:09:11,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:09:11,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 8] total 24 [2025-03-08 18:09:11,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394891682] [2025-03-08 18:09:11,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:09:11,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 18:09:11,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:11,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 18:09:11,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=449, Unknown=1, NotChecked=42, Total=552 [2025-03-08 18:09:11,469 INFO L87 Difference]: Start difference. First operand 86 states and 112 transitions. Second operand has 24 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 8 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-08 18:09:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:13,483 INFO L93 Difference]: Finished difference Result 230 states and 327 transitions. [2025-03-08 18:09:13,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 18:09:13,484 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 8 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 41 [2025-03-08 18:09:13,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:13,485 INFO L225 Difference]: With dead ends: 230 [2025-03-08 18:09:13,485 INFO L226 Difference]: Without dead ends: 151 [2025-03-08 18:09:13,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=139, Invalid=1054, Unknown=1, NotChecked=66, Total=1260 [2025-03-08 18:09:13,487 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 132 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:13,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 810 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 621 Invalid, 0 Unknown, 342 Unchecked, 1.3s Time] [2025-03-08 18:09:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-08 18:09:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 103. [2025-03-08 18:09:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 83 states have internal predecessors, (100), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (21), 12 states have call predecessors, (21), 13 states have call successors, (21) [2025-03-08 18:09:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 135 transitions. [2025-03-08 18:09:13,534 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 135 transitions. Word has length 41 [2025-03-08 18:09:13,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:13,538 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 135 transitions. [2025-03-08 18:09:13,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 8 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-08 18:09:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 135 transitions. [2025-03-08 18:09:13,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 18:09:13,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:13,539 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:13,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 18:09:13,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 18:09:13,740 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:13,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:13,741 INFO L85 PathProgramCache]: Analyzing trace with hash 732964713, now seen corresponding path program 1 times [2025-03-08 18:09:13,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:13,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119813719] [2025-03-08 18:09:13,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:13,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:13,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 18:09:13,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 18:09:13,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:13,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 18:09:14,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:14,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119813719] [2025-03-08 18:09:14,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119813719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:14,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:09:14,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 18:09:14,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734293542] [2025-03-08 18:09:14,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:14,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:09:14,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:14,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:09:14,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:09:14,386 INFO L87 Difference]: Start difference. First operand 103 states and 135 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 18:09:14,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:14,552 INFO L93 Difference]: Finished difference Result 119 states and 152 transitions. [2025-03-08 18:09:14,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 18:09:14,557 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-03-08 18:09:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:14,558 INFO L225 Difference]: With dead ends: 119 [2025-03-08 18:09:14,558 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 18:09:14,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:09:14,559 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:14,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 461 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:09:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 18:09:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2025-03-08 18:09:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 90 states have internal predecessors, (106), 15 states have call successors, (15), 8 states have call predecessors, (15), 12 states have return successors, (24), 13 states have call predecessors, (24), 14 states have call successors, (24) [2025-03-08 18:09:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 145 transitions. [2025-03-08 18:09:14,595 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 145 transitions. Word has length 42 [2025-03-08 18:09:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:14,596 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 145 transitions. [2025-03-08 18:09:14,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 18:09:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 145 transitions. [2025-03-08 18:09:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 18:09:14,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:14,597 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:14,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 18:09:14,597 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:14,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:14,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1682472344, now seen corresponding path program 1 times [2025-03-08 18:09:14,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:14,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8268017] [2025-03-08 18:09:14,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:14,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:14,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 18:09:14,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 18:09:14,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:14,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 18:09:15,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:15,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8268017] [2025-03-08 18:09:15,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8268017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:15,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524046596] [2025-03-08 18:09:15,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:15,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:15,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:15,406 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:09:15,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 18:09:15,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 18:09:15,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 18:09:15,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:15,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:15,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 18:09:15,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:15,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-03-08 18:09:15,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-03-08 18:09:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 18:09:17,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:09:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 18:09:18,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524046596] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:09:18,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:09:18,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 8] total 30 [2025-03-08 18:09:18,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856909557] [2025-03-08 18:09:18,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:09:18,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 18:09:18,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:18,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 18:09:18,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2025-03-08 18:09:18,264 INFO L87 Difference]: Start difference. First operand 112 states and 145 transitions. Second operand has 30 states, 25 states have (on average 3.6) internal successors, (90), 29 states have internal predecessors, (90), 13 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 18:09:20,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:20,188 INFO L93 Difference]: Finished difference Result 274 states and 369 transitions. [2025-03-08 18:09:20,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 18:09:20,189 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 3.6) internal successors, (90), 29 states have internal predecessors, (90), 13 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Word has length 50 [2025-03-08 18:09:20,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:20,190 INFO L225 Difference]: With dead ends: 274 [2025-03-08 18:09:20,191 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 18:09:20,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=202, Invalid=1438, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 18:09:20,192 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 138 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:20,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 914 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 18:09:20,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 18:09:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 108. [2025-03-08 18:09:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 87 states have internal predecessors, (102), 13 states have call successors, (13), 9 states have call predecessors, (13), 12 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) [2025-03-08 18:09:20,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2025-03-08 18:09:20,241 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 50 [2025-03-08 18:09:20,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:20,241 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2025-03-08 18:09:20,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 3.6) internal successors, (90), 29 states have internal predecessors, (90), 13 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 18:09:20,242 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2025-03-08 18:09:20,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 18:09:20,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:20,242 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:20,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 18:09:20,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 18:09:20,443 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:20,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:20,444 INFO L85 PathProgramCache]: Analyzing trace with hash 993018162, now seen corresponding path program 1 times [2025-03-08 18:09:20,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:20,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895080473] [2025-03-08 18:09:20,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:20,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:20,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 18:09:20,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 18:09:20,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:20,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 18:09:21,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:21,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895080473] [2025-03-08 18:09:21,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895080473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:21,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:09:21,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 18:09:21,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213604938] [2025-03-08 18:09:21,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:21,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 18:09:21,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:21,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 18:09:21,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 18:09:21,579 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 18:09:21,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:21,813 INFO L93 Difference]: Finished difference Result 116 states and 140 transitions. [2025-03-08 18:09:21,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 18:09:21,813 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2025-03-08 18:09:21,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:21,817 INFO L225 Difference]: With dead ends: 116 [2025-03-08 18:09:21,817 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 18:09:21,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-08 18:09:21,818 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 18 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:21,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 531 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:09:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 18:09:21,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2025-03-08 18:09:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 88 states have internal predecessors, (103), 13 states have call successors, (13), 10 states have call predecessors, (13), 12 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) [2025-03-08 18:09:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2025-03-08 18:09:21,853 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 58 [2025-03-08 18:09:21,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:21,853 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2025-03-08 18:09:21,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 18:09:21,854 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2025-03-08 18:09:21,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 18:09:21,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:21,858 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:21,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 18:09:21,859 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:21,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1548496162, now seen corresponding path program 1 times [2025-03-08 18:09:21,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:21,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602711395] [2025-03-08 18:09:21,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:21,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:21,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 18:09:21,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 18:09:21,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:21,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 18:09:22,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:22,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602711395] [2025-03-08 18:09:22,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602711395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:22,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:09:22,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 18:09:22,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263451543] [2025-03-08 18:09:22,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:22,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 18:09:22,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:22,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 18:09:22,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 18:09:22,696 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand has 10 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-08 18:09:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:22,829 INFO L93 Difference]: Finished difference Result 122 states and 147 transitions. [2025-03-08 18:09:22,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:09:22,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 79 [2025-03-08 18:09:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:22,831 INFO L225 Difference]: With dead ends: 122 [2025-03-08 18:09:22,831 INFO L226 Difference]: Without dead ends: 114 [2025-03-08 18:09:22,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-08 18:09:22,833 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 14 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:22,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 302 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:09:22,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-08 18:09:22,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2025-03-08 18:09:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.2093023255813953) internal successors, (104), 90 states have internal predecessors, (104), 13 states have call successors, (13), 10 states have call predecessors, (13), 12 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) [2025-03-08 18:09:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2025-03-08 18:09:22,850 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 79 [2025-03-08 18:09:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:22,851 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2025-03-08 18:09:22,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-08 18:09:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2025-03-08 18:09:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 18:09:22,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:22,852 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:22,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 18:09:22,852 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:22,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:22,852 INFO L85 PathProgramCache]: Analyzing trace with hash -258958301, now seen corresponding path program 1 times [2025-03-08 18:09:22,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:22,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771895867] [2025-03-08 18:09:22,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:22,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:22,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 18:09:22,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 18:09:22,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:22,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 18:09:23,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:23,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771895867] [2025-03-08 18:09:23,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771895867] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:23,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944240275] [2025-03-08 18:09:23,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:23,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:23,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:23,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:09:24,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 18:09:24,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 18:09:24,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 18:09:24,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:24,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:24,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 18:09:24,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:24,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-03-08 18:09:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 18:09:25,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:09:25,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944240275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:25,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:09:25,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 24 [2025-03-08 18:09:25,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134651367] [2025-03-08 18:09:25,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:25,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 18:09:25,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:25,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 18:09:25,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-03-08 18:09:25,630 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 18:09:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:26,440 INFO L93 Difference]: Finished difference Result 208 states and 261 transitions. [2025-03-08 18:09:26,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 18:09:26,442 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 79 [2025-03-08 18:09:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:26,443 INFO L225 Difference]: With dead ends: 208 [2025-03-08 18:09:26,443 INFO L226 Difference]: Without dead ends: 141 [2025-03-08 18:09:26,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 18:09:26,444 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 121 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:26,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 557 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 18:09:26,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-08 18:09:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 127. [2025-03-08 18:09:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 100 states have (on average 1.15) internal successors, (115), 103 states have internal predecessors, (115), 13 states have call successors, (13), 12 states have call predecessors, (13), 13 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-08 18:09:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2025-03-08 18:09:26,529 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 79 [2025-03-08 18:09:26,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:26,529 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2025-03-08 18:09:26,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 18:09:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2025-03-08 18:09:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 18:09:26,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:26,530 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:26,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 18:09:26,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:26,731 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:26,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:26,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2055909660, now seen corresponding path program 1 times [2025-03-08 18:09:26,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:26,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901911474] [2025-03-08 18:09:26,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:26,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:26,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 18:09:26,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 18:09:26,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:26,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:27,872 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 18:09:27,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:27,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901911474] [2025-03-08 18:09:27,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901911474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:27,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896638737] [2025-03-08 18:09:27,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:27,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:27,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:27,875 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:09:27,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 18:09:28,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 18:09:28,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 18:09:28,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:28,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:28,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 18:09:28,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:28,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-03-08 18:09:28,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2025-03-08 18:09:30,295 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 18:09:30,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:09:30,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896638737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:30,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:09:30,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14] total 22 [2025-03-08 18:09:30,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690020933] [2025-03-08 18:09:30,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:30,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 18:09:30,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:30,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 18:09:30,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-03-08 18:09:30,297 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand has 12 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 18:09:30,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:30,873 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2025-03-08 18:09:30,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 18:09:30,874 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 79 [2025-03-08 18:09:30,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:30,875 INFO L225 Difference]: With dead ends: 152 [2025-03-08 18:09:30,875 INFO L226 Difference]: Without dead ends: 126 [2025-03-08 18:09:30,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-03-08 18:09:30,876 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 67 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:30,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 552 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 18:09:30,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-08 18:09:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2025-03-08 18:09:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 97 states have (on average 1.1237113402061856) internal successors, (109), 100 states have internal predecessors, (109), 13 states have call successors, (13), 12 states have call predecessors, (13), 13 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-08 18:09:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 138 transitions. [2025-03-08 18:09:30,904 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 138 transitions. Word has length 79 [2025-03-08 18:09:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:30,904 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 138 transitions. [2025-03-08 18:09:30,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 18:09:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 138 transitions. [2025-03-08 18:09:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 18:09:30,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:30,907 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:30,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 18:09:31,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:31,108 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:31,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:31,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1945654629, now seen corresponding path program 1 times [2025-03-08 18:09:31,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:31,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694225761] [2025-03-08 18:09:31,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:31,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:31,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 18:09:31,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 18:09:31,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:31,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 18:09:31,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:31,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694225761] [2025-03-08 18:09:31,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694225761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:31,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220146975] [2025-03-08 18:09:31,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:31,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:31,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:31,417 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:09:31,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 18:09:31,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 18:09:31,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 18:09:31,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:31,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:31,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 18:09:31,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:31,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-03-08 18:09:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 18:09:32,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:09:32,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220146975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:32,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:09:32,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 25 [2025-03-08 18:09:32,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219511294] [2025-03-08 18:09:32,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:32,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 18:09:32,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:32,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 18:09:32,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2025-03-08 18:09:32,581 INFO L87 Difference]: Start difference. First operand 124 states and 138 transitions. Second operand has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 18:09:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:32,995 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2025-03-08 18:09:32,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 18:09:32,996 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 79 [2025-03-08 18:09:32,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:32,997 INFO L225 Difference]: With dead ends: 139 [2025-03-08 18:09:32,997 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 18:09:32,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 65 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 18:09:32,999 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 113 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:33,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 436 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:09:33,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 18:09:33,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2025-03-08 18:09:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 86 states have internal predecessors, (94), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-08 18:09:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2025-03-08 18:09:33,017 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 79 [2025-03-08 18:09:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:33,018 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2025-03-08 18:09:33,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 18:09:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2025-03-08 18:09:33,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 18:09:33,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:33,021 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:33,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 18:09:33,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 18:09:33,222 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:33,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:33,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1134589292, now seen corresponding path program 1 times [2025-03-08 18:09:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:33,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903978871] [2025-03-08 18:09:33,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:33,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 18:09:33,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 18:09:33,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:33,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 18:09:34,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:34,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903978871] [2025-03-08 18:09:34,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903978871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:34,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728334228] [2025-03-08 18:09:34,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:34,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:34,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:34,239 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:09:34,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 18:09:34,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 18:09:34,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 18:09:34,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:34,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:34,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-03-08 18:09:34,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:34,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:34,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:34,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:34,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-03-08 18:09:34,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:34,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:34,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:34,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2025-03-08 18:09:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 18:09:38,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:09:39,221 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 18:09:39,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30280 treesize of output 1 [2025-03-08 18:09:43,447 WARN L851 $PredicateComparison]: unable to prove that (or (and (forall ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_24| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_24| Int)) (= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_24| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_24|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_24|)) (+ 8 (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_24|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_24|))))) (forall ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_24| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_24| Int)) (= |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_24| (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_24|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_24|)) (+ 8 (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_24|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_24|)))))) (= (+ 16 |c_aws_linked_list_is_valid_#in~list#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))) is different from false [2025-03-08 18:10:08,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728334228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:08,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 18:10:08,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 41 [2025-03-08 18:10:08,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372438322] [2025-03-08 18:10:08,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 18:10:08,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 18:10:08,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:08,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 18:10:08,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2853, Unknown=3, NotChecked=108, Total=3192 [2025-03-08 18:10:08,603 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 41 states, 36 states have (on average 3.25) internal successors, (117), 36 states have internal predecessors, (117), 16 states have call successors, (20), 4 states have call predecessors, (20), 11 states have return successors, (19), 13 states have call predecessors, (19), 15 states have call successors, (19) [2025-03-08 18:10:11,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:11,385 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2025-03-08 18:10:11,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 18:10:11,386 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 36 states have (on average 3.25) internal successors, (117), 36 states have internal predecessors, (117), 16 states have call successors, (20), 4 states have call predecessors, (20), 11 states have return successors, (19), 13 states have call predecessors, (19), 15 states have call successors, (19) Word has length 91 [2025-03-08 18:10:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:11,387 INFO L225 Difference]: With dead ends: 129 [2025-03-08 18:10:11,387 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 18:10:11,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=456, Invalid=4657, Unknown=3, NotChecked=140, Total=5256 [2025-03-08 18:10:11,389 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 104 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:11,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1209 Invalid, 1524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 18:10:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 18:10:11,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2025-03-08 18:10:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.1046511627906976) internal successors, (95), 86 states have internal predecessors, (95), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-08 18:10:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2025-03-08 18:10:11,413 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 91 [2025-03-08 18:10:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:11,414 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2025-03-08 18:10:11,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 36 states have (on average 3.25) internal successors, (117), 36 states have internal predecessors, (117), 16 states have call successors, (20), 4 states have call predecessors, (20), 11 states have return successors, (19), 13 states have call predecessors, (19), 15 states have call successors, (19) [2025-03-08 18:10:11,414 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2025-03-08 18:10:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 18:10:11,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:11,415 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:10:11,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 18:10:11,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:11,616 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:11,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:11,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1263672011, now seen corresponding path program 1 times [2025-03-08 18:10:11,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:11,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349461160] [2025-03-08 18:10:11,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:11,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:11,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 18:10:11,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 18:10:11,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:11,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 18:10:12,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:12,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349461160] [2025-03-08 18:10:12,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349461160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:12,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890719718] [2025-03-08 18:10:12,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:12,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:12,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:12,111 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:10:12,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 18:10:12,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 18:10:12,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 18:10:12,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:12,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:12,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-08 18:10:12,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:12,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-03-08 18:10:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 18:10:13,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:10:13,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890719718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:13,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:10:13,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [18] total 30 [2025-03-08 18:10:13,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201038208] [2025-03-08 18:10:13,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:13,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 18:10:13,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:13,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 18:10:13,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2025-03-08 18:10:13,424 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 16 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 7 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-08 18:10:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:14,041 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2025-03-08 18:10:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 18:10:14,041 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 7 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 91 [2025-03-08 18:10:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:14,042 INFO L225 Difference]: With dead ends: 133 [2025-03-08 18:10:14,042 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 18:10:14,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 75 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=1168, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 18:10:14,043 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 47 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:14,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 523 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 18:10:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 18:10:14,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2025-03-08 18:10:14,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 81 states have internal predecessors, (88), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 18:10:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2025-03-08 18:10:14,059 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 91 [2025-03-08 18:10:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:14,059 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2025-03-08 18:10:14,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 7 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-08 18:10:14,059 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2025-03-08 18:10:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 18:10:14,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:14,060 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:10:14,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 18:10:14,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:14,260 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:14,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:14,261 INFO L85 PathProgramCache]: Analyzing trace with hash -597322444, now seen corresponding path program 1 times [2025-03-08 18:10:14,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:14,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896413081] [2025-03-08 18:10:14,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:14,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:14,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 18:10:14,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 18:10:14,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:14,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 18:10:14,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:14,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896413081] [2025-03-08 18:10:14,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896413081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:14,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:10:14,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 18:10:14,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089545755] [2025-03-08 18:10:14,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:14,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:10:14,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:14,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:10:14,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:10:14,448 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 18:10:14,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:14,491 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2025-03-08 18:10:14,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 18:10:14,491 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2025-03-08 18:10:14,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:14,492 INFO L225 Difference]: With dead ends: 114 [2025-03-08 18:10:14,492 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 18:10:14,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:10:14,493 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:14,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 421 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:10:14,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 18:10:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-08 18:10:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 81 states have (on average 1.0740740740740742) internal successors, (87), 81 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 18:10:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2025-03-08 18:10:14,511 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 94 [2025-03-08 18:10:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:14,511 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2025-03-08 18:10:14,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 18:10:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2025-03-08 18:10:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 18:10:14,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:14,512 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:10:14,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 18:10:14,512 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:14,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:14,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1206962893, now seen corresponding path program 2 times [2025-03-08 18:10:14,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:14,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313879094] [2025-03-08 18:10:14,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 18:10:14,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:14,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-03-08 18:10:14,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 18:10:14,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 18:10:14,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 18:10:15,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:15,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313879094] [2025-03-08 18:10:15,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313879094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:15,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119359108] [2025-03-08 18:10:15,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 18:10:15,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:15,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:15,368 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:10:15,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 18:10:15,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-03-08 18:10:15,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 18:10:15,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 18:10:15,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:15,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 18:10:15,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:15,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-03-08 18:10:15,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-03-08 18:10:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 18:10:17,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:10:17,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 842 treesize of output 834 [2025-03-08 18:10:17,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:17,841 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:17,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 514 treesize of output 498 [2025-03-08 18:10:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 18:10:17,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119359108] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:10:17,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:10:17,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 10] total 37 [2025-03-08 18:10:17,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309264553] [2025-03-08 18:10:17,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:10:17,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 18:10:17,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:17,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 18:10:17,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1210, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 18:10:17,913 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 37 states, 32 states have (on average 5.0625) internal successors, (162), 34 states have internal predecessors, (162), 21 states have call successors, (31), 4 states have call predecessors, (31), 11 states have return successors, (31), 19 states have call predecessors, (31), 20 states have call successors, (31) [2025-03-08 18:10:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:19,798 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2025-03-08 18:10:19,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 18:10:19,798 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 32 states have (on average 5.0625) internal successors, (162), 34 states have internal predecessors, (162), 21 states have call successors, (31), 4 states have call predecessors, (31), 11 states have return successors, (31), 19 states have call predecessors, (31), 20 states have call successors, (31) Word has length 102 [2025-03-08 18:10:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:19,799 INFO L225 Difference]: With dead ends: 122 [2025-03-08 18:10:19,799 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 18:10:19,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 189 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=405, Invalid=3377, Unknown=0, NotChecked=0, Total=3782 [2025-03-08 18:10:19,800 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 116 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:19,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1028 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 18:10:19,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 18:10:19,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 18:10:19,800 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-03-08 18:10:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 18:10:19,801 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2025-03-08 18:10:19,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:19,801 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 18:10:19,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 32 states have (on average 5.0625) internal successors, (162), 34 states have internal predecessors, (162), 21 states have call successors, (31), 4 states have call predecessors, (31), 11 states have return successors, (31), 19 states have call predecessors, (31), 20 states have call successors, (31) [2025-03-08 18:10:19,801 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 18:10:19,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 18:10:19,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 18:10:19,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 18:10:20,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 18:10:20,011 INFO L422 BasicCegarLoop]: Path program histogram: [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] [2025-03-08 18:10:20,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.