./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 17:34:54,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 17:34:54,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 17:34:54,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 17:34:54,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 17:34:54,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 17:34:54,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 17:34:54,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 17:34:54,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 17:34:54,638 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 17:34:54,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 17:34:54,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 17:34:54,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 17:34:54,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 17:34:54,639 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 17:34:54,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 17:34:54,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 17:34:54,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 17:34:54,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 17:34:54,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 17:34:54,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 17:34:54,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 17:34:54,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 17:34:54,640 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 17:34:54,640 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 17:34:54,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 17:34:54,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:34:54,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:34:54,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:34:54,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:34:54,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 17:34:54,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:34:54,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:34:54,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:34:54,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:34:54,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 17:34:54,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 17:34:54,641 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 17:34:54,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 17:34:54,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 17:34:54,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 17:34:54,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 17:34:54,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 17:34:54,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 17:34:54,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 17:34:54,641 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a [2025-01-09 17:34:54,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 17:34:54,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 17:34:54,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 17:34:54,857 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 17:34:54,857 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 17:34:54,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2025-01-09 17:34:56,009 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/614d6c107/a9a3663e02af4a88a128961b8912e076/FLAG873e19839 [2025-01-09 17:34:56,456 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 17:34:56,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2025-01-09 17:34:56,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/614d6c107/a9a3663e02af4a88a128961b8912e076/FLAG873e19839 [2025-01-09 17:34:56,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/614d6c107/a9a3663e02af4a88a128961b8912e076 [2025-01-09 17:34:56,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 17:34:56,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 17:34:56,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 17:34:56,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 17:34:56,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 17:34:56,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:34:56" (1/1) ... [2025-01-09 17:34:56,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19319135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:34:56, skipping insertion in model container [2025-01-09 17:34:56,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:34:56" (1/1) ... [2025-01-09 17:34:56,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 17:34:57,055 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2025-01-09 17:34:57,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:34:57,114 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 17:34:57,249 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2025-01-09 17:34:57,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:34:57,326 INFO L204 MainTranslator]: Completed translation [2025-01-09 17:34:57,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:34:57 WrapperNode [2025-01-09 17:34:57,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 17:34:57,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 17:34:57,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 17:34:57,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 17:34:57,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:34:57" (1/1) ... [2025-01-09 17:34:57,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:34:57" (1/1) ... [2025-01-09 17:34:57,405 INFO L138 Inliner]: procedures = 78, calls = 266, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 1011 [2025-01-09 17:34:57,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 17:34:57,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 17:34:57,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 17:34:57,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 17:34:57,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:34:57" (1/1) ... [2025-01-09 17:34:57,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:34:57" (1/1) ... [2025-01-09 17:34:57,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:34:57" (1/1) ... [2025-01-09 17:34:57,481 INFO L175 MemorySlicer]: Split 160 memory accesses to 6 slices as follows [2, 6, 8, 82, 42, 20]. 51 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 6, 8, 6, 0, 1]. The 103 writes are split as follows [0, 0, 0, 42, 42, 19]. [2025-01-09 17:34:57,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:34:57" (1/1) ... [2025-01-09 17:34:57,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:34:57" (1/1) ... [2025-01-09 17:34:57,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:34:57" (1/1) ... [2025-01-09 17:34:57,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:34:57" (1/1) ... [2025-01-09 17:34:57,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:34:57" (1/1) ... [2025-01-09 17:34:57,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:34:57" (1/1) ... [2025-01-09 17:34:57,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:34:57" (1/1) ... [2025-01-09 17:34:57,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 17:34:57,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 17:34:57,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 17:34:57,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 17:34:57,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:34:57" (1/1) ... [2025-01-09 17:34:57,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:34:57,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:34:57,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 17:34:57,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 17:34:57,606 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2025-01-09 17:34:57,607 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2025-01-09 17:34:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 17:34:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-01-09 17:34:57,607 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-01-09 17:34:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 17:34:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 17:34:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 17:34:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 17:34:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 17:34:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 17:34:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 17:34:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 17:34:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 17:34:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 17:34:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 17:34:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 17:34:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2025-01-09 17:34:57,609 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2025-01-09 17:34:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2025-01-09 17:34:57,609 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2025-01-09 17:34:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 17:34:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 17:34:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 17:34:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 17:34:57,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 17:34:57,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 17:34:57,610 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-01-09 17:34:57,610 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-01-09 17:34:57,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 17:34:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 17:34:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 17:34:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 17:34:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 17:34:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 17:34:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 17:34:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 17:34:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 17:34:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 17:34:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 17:34:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 17:34:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-01-09 17:34:57,611 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-01-09 17:34:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 17:34:57,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 17:34:57,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2025-01-09 17:34:57,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2025-01-09 17:34:57,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 17:34:57,613 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-01-09 17:34:57,613 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-01-09 17:34:57,613 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 17:34:57,613 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 17:34:57,613 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 17:34:57,613 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 17:34:57,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 17:34:57,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 17:34:57,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 17:34:57,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 17:34:57,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 17:34:57,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 17:34:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-01-09 17:34:57,614 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-01-09 17:34:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2025-01-09 17:34:57,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2025-01-09 17:34:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-01-09 17:34:57,614 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-01-09 17:34:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2025-01-09 17:34:57,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2025-01-09 17:34:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 17:34:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 17:34:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 17:34:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 17:34:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 17:34:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 17:34:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 17:34:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 17:34:57,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 17:34:57,808 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 17:34:57,811 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 17:34:57,947 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2025-01-09 17:34:57,964 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-09 17:35:02,792 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2025-01-09 17:35:02,793 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2025-01-09 17:35:02,833 INFO L? ?]: Removed 279 outVars from TransFormulas that were not future-live. [2025-01-09 17:35:02,834 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 17:35:02,842 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 17:35:02,843 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2025-01-09 17:35:02,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:35:02 BoogieIcfgContainer [2025-01-09 17:35:02,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 17:35:02,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 17:35:02,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 17:35:02,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 17:35:02,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:34:56" (1/3) ... [2025-01-09 17:35:02,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70558174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:35:02, skipping insertion in model container [2025-01-09 17:35:02,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:34:57" (2/3) ... [2025-01-09 17:35:02,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70558174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:35:02, skipping insertion in model container [2025-01-09 17:35:02,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:35:02" (3/3) ... [2025-01-09 17:35:02,850 INFO L128 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2025-01-09 17:35:02,861 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 17:35:02,863 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i that has 16 procedures, 202 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 17:35:02,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 17:35:02,913 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;@7e563926, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 17:35:02,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 17:35:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 157 states have (on average 1.3248407643312101) internal successors, (208), 163 states have internal predecessors, (208), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 17:35:02,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 17:35:02,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:02,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:35:02,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:02,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:02,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1608068654, now seen corresponding path program 1 times [2025-01-09 17:35:02,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:02,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741812230] [2025-01-09 17:35:02,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:02,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:04,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 17:35:04,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 17:35:04,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:04,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:35:04,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:04,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741812230] [2025-01-09 17:35:04,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741812230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:04,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:04,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 17:35:04,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992787241] [2025-01-09 17:35:04,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:04,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:35:04,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:04,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:35:04,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:35:04,599 INFO L87 Difference]: Start difference. First operand has 201 states, 157 states have (on average 1.3248407643312101) internal successors, (208), 163 states have internal predecessors, (208), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 17:35:04,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:04,710 INFO L93 Difference]: Finished difference Result 551 states and 754 transitions. [2025-01-09 17:35:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:35:04,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-09 17:35:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:04,724 INFO L225 Difference]: With dead ends: 551 [2025-01-09 17:35:04,724 INFO L226 Difference]: Without dead ends: 358 [2025-01-09 17:35:04,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:35:04,731 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 235 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:04,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 548 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:35:04,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-01-09 17:35:04,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 354. [2025-01-09 17:35:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 279 states have (on average 1.2580645161290323) internal successors, (351), 283 states have internal predecessors, (351), 50 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 17:35:04,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 447 transitions. [2025-01-09 17:35:04,794 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 447 transitions. Word has length 17 [2025-01-09 17:35:04,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:04,795 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 447 transitions. [2025-01-09 17:35:04,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 17:35:04,795 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 447 transitions. [2025-01-09 17:35:04,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 17:35:04,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:04,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:35:04,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 17:35:04,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:04,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:04,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1689371892, now seen corresponding path program 1 times [2025-01-09 17:35:04,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:04,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780539528] [2025-01-09 17:35:04,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:04,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:05,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 17:35:05,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 17:35:05,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:05,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:35:06,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:06,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780539528] [2025-01-09 17:35:06,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780539528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:06,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:06,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 17:35:06,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330903623] [2025-01-09 17:35:06,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:06,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:35:06,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:06,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:35:06,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:35:06,039 INFO L87 Difference]: Start difference. First operand 354 states and 447 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 17:35:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:06,095 INFO L93 Difference]: Finished difference Result 1023 states and 1302 transitions. [2025-01-09 17:35:06,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:35:06,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-01-09 17:35:06,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:06,098 INFO L225 Difference]: With dead ends: 1023 [2025-01-09 17:35:06,098 INFO L226 Difference]: Without dead ends: 679 [2025-01-09 17:35:06,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:35:06,100 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 225 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:06,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 546 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:35:06,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-01-09 17:35:06,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 672. [2025-01-09 17:35:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 533 states have (on average 1.2551594746716699) internal successors, (669), 536 states have internal predecessors, (669), 93 states have call successors, (93), 46 states have call predecessors, (93), 45 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-01-09 17:35:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 851 transitions. [2025-01-09 17:35:06,157 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 851 transitions. Word has length 18 [2025-01-09 17:35:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:06,157 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 851 transitions. [2025-01-09 17:35:06,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 17:35:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 851 transitions. [2025-01-09 17:35:06,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 17:35:06,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:06,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:35:06,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 17:35:06,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:06,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:06,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1495402306, now seen corresponding path program 1 times [2025-01-09 17:35:06,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:06,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814238346] [2025-01-09 17:35:06,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:06,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:07,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 17:35:07,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 17:35:07,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:07,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:35:07,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:07,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814238346] [2025-01-09 17:35:07,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814238346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:07,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:07,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 17:35:07,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240860799] [2025-01-09 17:35:07,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:07,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 17:35:07,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:07,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 17:35:07,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 17:35:07,387 INFO L87 Difference]: Start difference. First operand 672 states and 851 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 17:35:07,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:07,445 INFO L93 Difference]: Finished difference Result 1331 states and 1688 transitions. [2025-01-09 17:35:07,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 17:35:07,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-01-09 17:35:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:07,452 INFO L225 Difference]: With dead ends: 1331 [2025-01-09 17:35:07,455 INFO L226 Difference]: Without dead ends: 672 [2025-01-09 17:35:07,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 17:35:07,460 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:07,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1168 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:35:07,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-01-09 17:35:07,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2025-01-09 17:35:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 533 states have (on average 1.25328330206379) internal successors, (668), 536 states have internal predecessors, (668), 93 states have call successors, (93), 46 states have call predecessors, (93), 45 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-01-09 17:35:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 850 transitions. [2025-01-09 17:35:07,498 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 850 transitions. Word has length 49 [2025-01-09 17:35:07,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:07,498 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 850 transitions. [2025-01-09 17:35:07,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 17:35:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 850 transitions. [2025-01-09 17:35:07,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 17:35:07,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:07,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:35:07,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 17:35:07,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:07,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:07,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2066952235, now seen corresponding path program 1 times [2025-01-09 17:35:07,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:07,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277582524] [2025-01-09 17:35:07,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:07,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:08,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 17:35:08,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 17:35:08,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:08,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:35:08,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277582524] [2025-01-09 17:35:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277582524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:08,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:08,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 17:35:08,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922138995] [2025-01-09 17:35:08,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:08,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:35:08,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:08,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:35:08,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:35:08,479 INFO L87 Difference]: Start difference. First operand 672 states and 850 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 17:35:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:08,530 INFO L93 Difference]: Finished difference Result 1370 states and 1753 transitions. [2025-01-09 17:35:08,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:35:08,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2025-01-09 17:35:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:08,534 INFO L225 Difference]: With dead ends: 1370 [2025-01-09 17:35:08,536 INFO L226 Difference]: Without dead ends: 715 [2025-01-09 17:35:08,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:35:08,538 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 105 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:08,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 351 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:35:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-01-09 17:35:08,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 703. [2025-01-09 17:35:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 564 states have (on average 1.2588652482269505) internal successors, (710), 567 states have internal predecessors, (710), 93 states have call successors, (93), 46 states have call predecessors, (93), 45 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-01-09 17:35:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 892 transitions. [2025-01-09 17:35:08,570 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 892 transitions. Word has length 54 [2025-01-09 17:35:08,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:08,571 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 892 transitions. [2025-01-09 17:35:08,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 17:35:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 892 transitions. [2025-01-09 17:35:08,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 17:35:08,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:08,578 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1] [2025-01-09 17:35:08,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 17:35:08,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:08,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:08,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2097066816, now seen corresponding path program 1 times [2025-01-09 17:35:08,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:08,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299908890] [2025-01-09 17:35:08,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:08,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:09,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 17:35:09,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 17:35:09,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:09,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 17:35:10,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:10,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299908890] [2025-01-09 17:35:10,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299908890] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:35:10,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500309919] [2025-01-09 17:35:10,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:10,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:35:10,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:35:10,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:35:10,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 17:35:11,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 17:35:11,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 17:35:11,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:11,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:11,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 17:35:11,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:35:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 17:35:11,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:35:11,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500309919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:11,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:35:11,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-01-09 17:35:11,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736781919] [2025-01-09 17:35:11,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:11,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:35:11,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:11,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:35:11,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 17:35:11,635 INFO L87 Difference]: Start difference. First operand 703 states and 892 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 17:35:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:11,674 INFO L93 Difference]: Finished difference Result 1152 states and 1459 transitions. [2025-01-09 17:35:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:35:11,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 91 [2025-01-09 17:35:11,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:11,677 INFO L225 Difference]: With dead ends: 1152 [2025-01-09 17:35:11,677 INFO L226 Difference]: Without dead ends: 467 [2025-01-09 17:35:11,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 17:35:11,679 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:11,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 696 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:35:11,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-01-09 17:35:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2025-01-09 17:35:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 370 states have (on average 1.2432432432432432) internal successors, (460), 373 states have internal predecessors, (460), 63 states have call successors, (63), 34 states have call predecessors, (63), 33 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 17:35:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 582 transitions. [2025-01-09 17:35:11,692 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 582 transitions. Word has length 91 [2025-01-09 17:35:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:11,692 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 582 transitions. [2025-01-09 17:35:11,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 17:35:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 582 transitions. [2025-01-09 17:35:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 17:35:11,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:11,694 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:35:11,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 17:35:11,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:35:11,898 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:11,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:11,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1215229436, now seen corresponding path program 1 times [2025-01-09 17:35:11,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:11,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739838508] [2025-01-09 17:35:11,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:11,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:12,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 17:35:12,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 17:35:12,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:12,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 17:35:13,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:13,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739838508] [2025-01-09 17:35:13,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739838508] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:35:13,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812933567] [2025-01-09 17:35:13,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:13,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:35:13,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:35:13,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:35:13,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 17:35:14,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 17:35:14,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 17:35:14,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:14,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:14,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 1617 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 17:35:14,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:35:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 17:35:14,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:35:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 17:35:15,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812933567] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:35:15,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:35:15,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2025-01-09 17:35:15,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353931666] [2025-01-09 17:35:15,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:35:15,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:35:15,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:15,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:35:15,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:35:15,113 INFO L87 Difference]: Start difference. First operand 467 states and 582 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 7 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 17:35:15,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:15,341 INFO L93 Difference]: Finished difference Result 967 states and 1218 transitions. [2025-01-09 17:35:15,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:35:15,341 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 7 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 90 [2025-01-09 17:35:15,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:15,345 INFO L225 Difference]: With dead ends: 967 [2025-01-09 17:35:15,345 INFO L226 Difference]: Without dead ends: 518 [2025-01-09 17:35:15,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:35:15,348 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 4 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:15,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1833 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:35:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-01-09 17:35:15,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 503. [2025-01-09 17:35:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 397 states have (on average 1.2267002518891688) internal successors, (487), 400 states have internal predecessors, (487), 66 states have call successors, (66), 34 states have call predecessors, (66), 39 states have return successors, (80), 68 states have call predecessors, (80), 62 states have call successors, (80) [2025-01-09 17:35:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 633 transitions. [2025-01-09 17:35:15,385 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 633 transitions. Word has length 90 [2025-01-09 17:35:15,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:15,389 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 633 transitions. [2025-01-09 17:35:15,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 7 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 17:35:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 633 transitions. [2025-01-09 17:35:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 17:35:15,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:15,390 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:35:15,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 17:35:15,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:35:15,591 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:15,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:15,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1114317469, now seen corresponding path program 1 times [2025-01-09 17:35:15,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:15,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215417279] [2025-01-09 17:35:15,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:15,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:16,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 17:35:16,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 17:35:16,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:16,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 17:35:16,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:16,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215417279] [2025-01-09 17:35:16,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215417279] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:35:16,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746217346] [2025-01-09 17:35:16,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:16,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:35:16,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:35:16,932 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:35:16,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 17:35:18,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 17:35:18,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 17:35:18,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:18,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:18,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 1626 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 17:35:18,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:35:18,337 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 17:35:18,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:35:18,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746217346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:18,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:35:18,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 10 [2025-01-09 17:35:18,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255410761] [2025-01-09 17:35:18,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:18,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:35:18,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:18,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:35:18,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 17:35:18,341 INFO L87 Difference]: Start difference. First operand 503 states and 633 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 17:35:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:18,512 INFO L93 Difference]: Finished difference Result 1012 states and 1278 transitions. [2025-01-09 17:35:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 17:35:18,513 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 90 [2025-01-09 17:35:18,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:18,516 INFO L225 Difference]: With dead ends: 1012 [2025-01-09 17:35:18,516 INFO L226 Difference]: Without dead ends: 527 [2025-01-09 17:35:18,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 17:35:18,518 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 2 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:18,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2044 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:35:18,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-01-09 17:35:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 515. [2025-01-09 17:35:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 409 states have (on average 1.2273838630806846) internal successors, (502), 409 states have internal predecessors, (502), 66 states have call successors, (66), 34 states have call predecessors, (66), 39 states have return successors, (80), 71 states have call predecessors, (80), 62 states have call successors, (80) [2025-01-09 17:35:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 648 transitions. [2025-01-09 17:35:18,540 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 648 transitions. Word has length 90 [2025-01-09 17:35:18,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:18,541 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 648 transitions. [2025-01-09 17:35:18,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 17:35:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 648 transitions. [2025-01-09 17:35:18,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 17:35:18,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:18,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:35:18,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 17:35:18,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:35:18,747 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:18,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1479909348, now seen corresponding path program 2 times [2025-01-09 17:35:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:18,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930039375] [2025-01-09 17:35:18,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 17:35:18,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:19,634 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-01-09 17:35:19,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 60 of 90 statements. [2025-01-09 17:35:19,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 17:35:19,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 17:35:19,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:19,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930039375] [2025-01-09 17:35:19,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930039375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:19,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:19,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 17:35:19,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101980910] [2025-01-09 17:35:19,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:19,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 17:35:19,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:19,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 17:35:19,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:35:19,977 INFO L87 Difference]: Start difference. First operand 515 states and 648 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 17:35:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:20,031 INFO L93 Difference]: Finished difference Result 918 states and 1165 transitions. [2025-01-09 17:35:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 17:35:20,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2025-01-09 17:35:20,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:20,035 INFO L225 Difference]: With dead ends: 918 [2025-01-09 17:35:20,035 INFO L226 Difference]: Without dead ends: 530 [2025-01-09 17:35:20,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:35:20,036 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:20,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1391 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:35:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-01-09 17:35:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-01-09 17:35:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 421 states have (on average 1.2209026128266034) internal successors, (514), 418 states have internal predecessors, (514), 66 states have call successors, (66), 34 states have call predecessors, (66), 42 states have return successors, (85), 77 states have call predecessors, (85), 62 states have call successors, (85) [2025-01-09 17:35:20,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 665 transitions. [2025-01-09 17:35:20,053 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 665 transitions. Word has length 90 [2025-01-09 17:35:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:20,053 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 665 transitions. [2025-01-09 17:35:20,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 17:35:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 665 transitions. [2025-01-09 17:35:20,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 17:35:20,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:20,054 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:35:20,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 17:35:20,055 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:20,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:20,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1491225475, now seen corresponding path program 1 times [2025-01-09 17:35:20,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:20,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510095384] [2025-01-09 17:35:20,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:20,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:20,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 17:35:20,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 17:35:20,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:20,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 17:35:21,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:21,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510095384] [2025-01-09 17:35:21,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510095384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:21,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:21,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 17:35:21,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23383204] [2025-01-09 17:35:21,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:21,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:35:21,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:21,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:35:21,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:35:21,374 INFO L87 Difference]: Start difference. First operand 530 states and 665 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 17:35:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:21,443 INFO L93 Difference]: Finished difference Result 928 states and 1174 transitions. [2025-01-09 17:35:21,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:35:21,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2025-01-09 17:35:21,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:21,446 INFO L225 Difference]: With dead ends: 928 [2025-01-09 17:35:21,446 INFO L226 Difference]: Without dead ends: 530 [2025-01-09 17:35:21,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:35:21,448 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:21,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1832 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:35:21,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-01-09 17:35:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-01-09 17:35:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 421 states have (on average 1.2161520190023754) internal successors, (512), 418 states have internal predecessors, (512), 66 states have call successors, (66), 34 states have call predecessors, (66), 42 states have return successors, (85), 77 states have call predecessors, (85), 62 states have call successors, (85) [2025-01-09 17:35:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 663 transitions. [2025-01-09 17:35:21,466 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 663 transitions. Word has length 90 [2025-01-09 17:35:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:21,466 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 663 transitions. [2025-01-09 17:35:21,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 17:35:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 663 transitions. [2025-01-09 17:35:21,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 17:35:21,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:21,468 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1] [2025-01-09 17:35:21,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 17:35:21,468 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:21,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:21,468 INFO L85 PathProgramCache]: Analyzing trace with hash 64643295, now seen corresponding path program 1 times [2025-01-09 17:35:21,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:21,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037246443] [2025-01-09 17:35:21,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:21,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:22,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 17:35:22,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 17:35:22,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:22,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 17:35:22,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:22,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037246443] [2025-01-09 17:35:22,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037246443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:22,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:22,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 17:35:22,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432483269] [2025-01-09 17:35:22,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:22,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 17:35:22,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:22,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 17:35:22,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:35:22,700 INFO L87 Difference]: Start difference. First operand 530 states and 663 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 17:35:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:22,740 INFO L93 Difference]: Finished difference Result 737 states and 927 transitions. [2025-01-09 17:35:22,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 17:35:22,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2025-01-09 17:35:22,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:22,744 INFO L225 Difference]: With dead ends: 737 [2025-01-09 17:35:22,744 INFO L226 Difference]: Without dead ends: 534 [2025-01-09 17:35:22,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:35:22,745 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:22,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1391 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:35:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-01-09 17:35:22,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-01-09 17:35:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 425 states have (on average 1.2141176470588235) internal successors, (516), 420 states have internal predecessors, (516), 66 states have call successors, (66), 34 states have call predecessors, (66), 42 states have return successors, (85), 79 states have call predecessors, (85), 62 states have call successors, (85) [2025-01-09 17:35:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 667 transitions. [2025-01-09 17:35:22,761 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 667 transitions. Word has length 91 [2025-01-09 17:35:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:22,761 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 667 transitions. [2025-01-09 17:35:22,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 17:35:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 667 transitions. [2025-01-09 17:35:22,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 17:35:22,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:22,762 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1] [2025-01-09 17:35:22,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 17:35:22,762 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:22,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:22,763 INFO L85 PathProgramCache]: Analyzing trace with hash -636421283, now seen corresponding path program 1 times [2025-01-09 17:35:22,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:22,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709478169] [2025-01-09 17:35:22,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:22,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:23,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 17:35:23,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 17:35:23,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:23,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 17:35:23,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:23,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709478169] [2025-01-09 17:35:23,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709478169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:23,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:23,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:35:23,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012585001] [2025-01-09 17:35:23,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:23,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:35:23,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:23,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:35:23,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:35:23,991 INFO L87 Difference]: Start difference. First operand 534 states and 667 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 17:35:28,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:35:28,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:28,453 INFO L93 Difference]: Finished difference Result 941 states and 1185 transitions. [2025-01-09 17:35:28,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:35:28,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 91 [2025-01-09 17:35:28,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:28,458 INFO L225 Difference]: With dead ends: 941 [2025-01-09 17:35:28,458 INFO L226 Difference]: Without dead ends: 938 [2025-01-09 17:35:28,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-01-09 17:35:28,459 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 304 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:28,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 725 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 17:35:28,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-01-09 17:35:28,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 910. [2025-01-09 17:35:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 731 states have (on average 1.2243502051983584) internal successors, (895), 720 states have internal predecessors, (895), 110 states have call successors, (110), 54 states have call predecessors, (110), 68 states have return successors, (149), 135 states have call predecessors, (149), 106 states have call successors, (149) [2025-01-09 17:35:28,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1154 transitions. [2025-01-09 17:35:28,492 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1154 transitions. Word has length 91 [2025-01-09 17:35:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:28,493 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1154 transitions. [2025-01-09 17:35:28,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 17:35:28,493 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1154 transitions. [2025-01-09 17:35:28,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 17:35:28,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:28,494 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:35:28,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 17:35:28,494 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:28,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:28,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1891851231, now seen corresponding path program 1 times [2025-01-09 17:35:28,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:28,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393581626] [2025-01-09 17:35:28,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:28,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:29,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 17:35:29,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 17:35:29,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:29,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 17:35:29,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:29,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393581626] [2025-01-09 17:35:29,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393581626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:29,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:29,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 17:35:29,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689140790] [2025-01-09 17:35:29,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:29,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 17:35:29,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:29,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 17:35:29,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:35:29,532 INFO L87 Difference]: Start difference. First operand 910 states and 1154 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 17:35:33,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:35:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:33,650 INFO L93 Difference]: Finished difference Result 1817 states and 2309 transitions. [2025-01-09 17:35:33,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 17:35:33,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 102 [2025-01-09 17:35:33,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:33,654 INFO L225 Difference]: With dead ends: 1817 [2025-01-09 17:35:33,654 INFO L226 Difference]: Without dead ends: 892 [2025-01-09 17:35:33,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:35:33,656 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 92 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:33,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 834 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 17:35:33,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-01-09 17:35:33,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 865. [2025-01-09 17:35:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 696 states have (on average 1.2183908045977012) internal successors, (848), 689 states have internal predecessors, (848), 109 states have call successors, (109), 48 states have call predecessors, (109), 59 states have return successors, (143), 127 states have call predecessors, (143), 105 states have call successors, (143) [2025-01-09 17:35:33,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1100 transitions. [2025-01-09 17:35:33,677 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1100 transitions. Word has length 102 [2025-01-09 17:35:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:33,677 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1100 transitions. [2025-01-09 17:35:33,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 17:35:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1100 transitions. [2025-01-09 17:35:33,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 17:35:33,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:33,678 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:35:33,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 17:35:33,679 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:33,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:33,679 INFO L85 PathProgramCache]: Analyzing trace with hash 183345086, now seen corresponding path program 1 times [2025-01-09 17:35:33,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:33,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593867498] [2025-01-09 17:35:33,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:33,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:34,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 17:35:34,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 17:35:34,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:34,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 17:35:34,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:34,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593867498] [2025-01-09 17:35:34,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593867498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:34,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:34,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 17:35:34,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641162712] [2025-01-09 17:35:34,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:34,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:35:34,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:34,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:35:34,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:35:34,854 INFO L87 Difference]: Start difference. First operand 865 states and 1100 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 17:35:34,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:34,944 INFO L93 Difference]: Finished difference Result 917 states and 1158 transitions. [2025-01-09 17:35:34,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:35:34,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2025-01-09 17:35:34,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:34,948 INFO L225 Difference]: With dead ends: 917 [2025-01-09 17:35:34,948 INFO L226 Difference]: Without dead ends: 869 [2025-01-09 17:35:34,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:35:34,949 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:34,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1839 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:35:34,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-01-09 17:35:34,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2025-01-09 17:35:34,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 700 states have (on average 1.217142857142857) internal successors, (852), 693 states have internal predecessors, (852), 109 states have call successors, (109), 48 states have call predecessors, (109), 59 states have return successors, (143), 127 states have call predecessors, (143), 105 states have call successors, (143) [2025-01-09 17:35:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1104 transitions. [2025-01-09 17:35:34,971 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1104 transitions. Word has length 110 [2025-01-09 17:35:34,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:34,971 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1104 transitions. [2025-01-09 17:35:34,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 17:35:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1104 transitions. [2025-01-09 17:35:34,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 17:35:34,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:34,973 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 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-01-09 17:35:34,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 17:35:34,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:34,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:34,973 INFO L85 PathProgramCache]: Analyzing trace with hash -945780889, now seen corresponding path program 1 times [2025-01-09 17:35:34,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:34,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876768796] [2025-01-09 17:35:34,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:34,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:35,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 17:35:35,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 17:35:35,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:35,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 17:35:35,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:35,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876768796] [2025-01-09 17:35:35,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876768796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:35,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:35,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 17:35:35,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709787398] [2025-01-09 17:35:35,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:35,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:35:35,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:35,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:35:35,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:35:35,986 INFO L87 Difference]: Start difference. First operand 869 states and 1104 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 17:35:36,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:36,022 INFO L93 Difference]: Finished difference Result 1647 states and 2110 transitions. [2025-01-09 17:35:36,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:35:36,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-01-09 17:35:36,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:36,028 INFO L225 Difference]: With dead ends: 1647 [2025-01-09 17:35:36,028 INFO L226 Difference]: Without dead ends: 833 [2025-01-09 17:35:36,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:35:36,030 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:36,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 466 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:35:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-01-09 17:35:36,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-01-09 17:35:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 670 states have (on average 1.2119402985074628) internal successors, (812), 667 states have internal predecessors, (812), 105 states have call successors, (105), 48 states have call predecessors, (105), 57 states have return successors, (133), 117 states have call predecessors, (133), 101 states have call successors, (133) [2025-01-09 17:35:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1050 transitions. [2025-01-09 17:35:36,056 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1050 transitions. Word has length 111 [2025-01-09 17:35:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:36,056 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1050 transitions. [2025-01-09 17:35:36,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 17:35:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1050 transitions. [2025-01-09 17:35:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 17:35:36,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:36,059 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 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-01-09 17:35:36,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 17:35:36,059 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:36,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:36,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1854415564, now seen corresponding path program 1 times [2025-01-09 17:35:36,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:36,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394316589] [2025-01-09 17:35:36,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:36,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:36,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 17:35:36,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 17:35:36,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:36,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 17:35:37,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:37,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394316589] [2025-01-09 17:35:37,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394316589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:37,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:37,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:35:37,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245720582] [2025-01-09 17:35:37,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:37,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:35:37,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:37,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:35:37,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:35:37,088 INFO L87 Difference]: Start difference. First operand 833 states and 1050 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 17:35:37,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:37,134 INFO L93 Difference]: Finished difference Result 1694 states and 2151 transitions. [2025-01-09 17:35:37,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:35:37,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 113 [2025-01-09 17:35:37,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:37,138 INFO L225 Difference]: With dead ends: 1694 [2025-01-09 17:35:37,138 INFO L226 Difference]: Without dead ends: 833 [2025-01-09 17:35:37,139 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-01-09 17:35:37,140 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 2 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:37,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 688 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:35:37,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-01-09 17:35:37,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-01-09 17:35:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 670 states have (on average 1.2044776119402985) internal successors, (807), 667 states have internal predecessors, (807), 105 states have call successors, (105), 48 states have call predecessors, (105), 57 states have return successors, (133), 117 states have call predecessors, (133), 101 states have call successors, (133) [2025-01-09 17:35:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1045 transitions. [2025-01-09 17:35:37,164 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1045 transitions. Word has length 113 [2025-01-09 17:35:37,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:37,164 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1045 transitions. [2025-01-09 17:35:37,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 17:35:37,164 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1045 transitions. [2025-01-09 17:35:37,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 17:35:37,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:37,166 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 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-01-09 17:35:37,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 17:35:37,166 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:37,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:37,166 INFO L85 PathProgramCache]: Analyzing trace with hash -826533076, now seen corresponding path program 1 times [2025-01-09 17:35:37,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:37,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162244874] [2025-01-09 17:35:37,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:37,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:37,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 17:35:38,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 17:35:38,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:38,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-09 17:35:38,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:38,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162244874] [2025-01-09 17:35:38,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162244874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:38,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:38,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 17:35:38,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836492934] [2025-01-09 17:35:38,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:38,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 17:35:38,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:38,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 17:35:38,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 17:35:38,454 INFO L87 Difference]: Start difference. First operand 833 states and 1045 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 17:35:42,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:35:46,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:35:47,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:47,550 INFO L93 Difference]: Finished difference Result 2258 states and 2828 transitions. [2025-01-09 17:35:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:35:47,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 117 [2025-01-09 17:35:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:47,563 INFO L225 Difference]: With dead ends: 2258 [2025-01-09 17:35:47,564 INFO L226 Difference]: Without dead ends: 1792 [2025-01-09 17:35:47,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:35:47,566 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 392 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 98 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:47,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 758 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 446 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2025-01-09 17:35:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2025-01-09 17:35:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1637. [2025-01-09 17:35:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1637 states, 1309 states have (on average 1.210847975553858) internal successors, (1585), 1311 states have internal predecessors, (1585), 205 states have call successors, (205), 98 states have call predecessors, (205), 122 states have return successors, (271), 227 states have call predecessors, (271), 200 states have call successors, (271) [2025-01-09 17:35:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2061 transitions. [2025-01-09 17:35:47,610 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2061 transitions. Word has length 117 [2025-01-09 17:35:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:47,610 INFO L471 AbstractCegarLoop]: Abstraction has 1637 states and 2061 transitions. [2025-01-09 17:35:47,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 17:35:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2061 transitions. [2025-01-09 17:35:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 17:35:47,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:47,612 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 17:35:47,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 17:35:47,613 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:47,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:47,613 INFO L85 PathProgramCache]: Analyzing trace with hash 170961073, now seen corresponding path program 1 times [2025-01-09 17:35:47,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:47,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078525859] [2025-01-09 17:35:47,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:47,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:48,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 17:35:48,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 17:35:48,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:48,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 17:35:49,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:49,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078525859] [2025-01-09 17:35:49,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078525859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:49,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:49,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:35:49,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638340293] [2025-01-09 17:35:49,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:49,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:35:49,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:49,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:35:49,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:35:49,631 INFO L87 Difference]: Start difference. First operand 1637 states and 2061 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 17:35:49,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:49,689 INFO L93 Difference]: Finished difference Result 2342 states and 2945 transitions. [2025-01-09 17:35:49,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:35:49,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 140 [2025-01-09 17:35:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:49,694 INFO L225 Difference]: With dead ends: 2342 [2025-01-09 17:35:49,694 INFO L226 Difference]: Without dead ends: 888 [2025-01-09 17:35:49,697 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-01-09 17:35:49,697 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:49,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 690 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:35:49,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-01-09 17:35:49,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2025-01-09 17:35:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 708 states have (on average 1.2005649717514124) internal successors, (850), 709 states have internal predecessors, (850), 112 states have call successors, (112), 55 states have call predecessors, (112), 67 states have return successors, (145), 123 states have call predecessors, (145), 107 states have call successors, (145) [2025-01-09 17:35:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1107 transitions. [2025-01-09 17:35:49,722 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1107 transitions. Word has length 140 [2025-01-09 17:35:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:49,722 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1107 transitions. [2025-01-09 17:35:49,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 17:35:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1107 transitions. [2025-01-09 17:35:49,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 17:35:49,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:49,724 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 17:35:49,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 17:35:49,724 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:49,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:49,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2937520, now seen corresponding path program 1 times [2025-01-09 17:35:49,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:49,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457492301] [2025-01-09 17:35:49,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:49,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:50,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 17:35:50,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 17:35:50,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:50,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 17:35:51,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:51,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457492301] [2025-01-09 17:35:51,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457492301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:51,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:51,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:35:51,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641640267] [2025-01-09 17:35:51,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:51,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:35:51,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:51,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:35:51,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:35:51,109 INFO L87 Difference]: Start difference. First operand 888 states and 1107 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 17:35:55,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:35:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:55,446 INFO L93 Difference]: Finished difference Result 1430 states and 1784 transitions. [2025-01-09 17:35:55,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:35:55,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 140 [2025-01-09 17:35:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:55,454 INFO L225 Difference]: With dead ends: 1430 [2025-01-09 17:35:55,455 INFO L226 Difference]: Without dead ends: 1425 [2025-01-09 17:35:55,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-01-09 17:35:55,455 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 210 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:55,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 651 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 17:35:55,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2025-01-09 17:35:55,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1389. [2025-01-09 17:35:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1109 states have (on average 1.1992786293958522) internal successors, (1330), 1106 states have internal predecessors, (1330), 174 states have call successors, (174), 84 states have call predecessors, (174), 105 states have return successors, (237), 198 states have call predecessors, (237), 169 states have call successors, (237) [2025-01-09 17:35:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1741 transitions. [2025-01-09 17:35:55,520 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1741 transitions. Word has length 140 [2025-01-09 17:35:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:55,521 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1741 transitions. [2025-01-09 17:35:55,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 17:35:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1741 transitions. [2025-01-09 17:35:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 17:35:55,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:55,523 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 17:35:55,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 17:35:55,523 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:55,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:55,524 INFO L85 PathProgramCache]: Analyzing trace with hash 484871360, now seen corresponding path program 1 times [2025-01-09 17:35:55,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:55,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371194213] [2025-01-09 17:35:55,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:55,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:56,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 17:35:56,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 17:35:56,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:56,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-09 17:35:56,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:56,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371194213] [2025-01-09 17:35:56,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371194213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:56,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:56,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:35:56,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827948128] [2025-01-09 17:35:56,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:56,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:35:56,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:35:56,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:35:56,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:35:56,759 INFO L87 Difference]: Start difference. First operand 1389 states and 1741 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 17:35:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:35:56,821 INFO L93 Difference]: Finished difference Result 1433 states and 1787 transitions. [2025-01-09 17:35:56,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:35:56,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 154 [2025-01-09 17:35:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:35:56,828 INFO L225 Difference]: With dead ends: 1433 [2025-01-09 17:35:56,828 INFO L226 Difference]: Without dead ends: 1414 [2025-01-09 17:35:56,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:35:56,829 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 229 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:35:56,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 503 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:35:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-01-09 17:35:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1395. [2025-01-09 17:35:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1115 states have (on average 1.1946188340807176) internal successors, (1332), 1112 states have internal predecessors, (1332), 174 states have call successors, (174), 84 states have call predecessors, (174), 105 states have return successors, (237), 198 states have call predecessors, (237), 169 states have call successors, (237) [2025-01-09 17:35:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1743 transitions. [2025-01-09 17:35:56,873 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1743 transitions. Word has length 154 [2025-01-09 17:35:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:35:56,874 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 1743 transitions. [2025-01-09 17:35:56,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 17:35:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1743 transitions. [2025-01-09 17:35:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 17:35:56,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:56,877 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 17:35:56,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 17:35:56,877 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:56,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:56,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1663278024, now seen corresponding path program 1 times [2025-01-09 17:35:56,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:56,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271129988] [2025-01-09 17:35:56,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:56,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:57,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 17:35:57,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 17:35:57,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:57,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-09 17:35:57,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271129988] [2025-01-09 17:35:57,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271129988] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:35:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997192128] [2025-01-09 17:35:57,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:57,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:35:57,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:35:57,961 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:35:57,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 17:35:59,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 17:35:59,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 17:35:59,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:59,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:00,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 2376 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 17:36:00,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:36:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-09 17:36:00,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:36:00,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997192128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:00,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:36:00,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 17:36:00,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734187231] [2025-01-09 17:36:00,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:00,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:36:00,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:00,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:36:00,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:36:00,263 INFO L87 Difference]: Start difference. First operand 1395 states and 1743 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 17:36:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:00,343 INFO L93 Difference]: Finished difference Result 1924 states and 2396 transitions. [2025-01-09 17:36:00,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:36:00,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 157 [2025-01-09 17:36:00,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:00,346 INFO L225 Difference]: With dead ends: 1924 [2025-01-09 17:36:00,346 INFO L226 Difference]: Without dead ends: 685 [2025-01-09 17:36:00,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:36:00,349 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 66 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:00,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 544 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:36:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-01-09 17:36:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 679. [2025-01-09 17:36:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 540 states have (on average 1.1833333333333333) internal successors, (639), 541 states have internal predecessors, (639), 83 states have call successors, (83), 47 states have call predecessors, (83), 55 states have return successors, (102), 90 states have call predecessors, (102), 79 states have call successors, (102) [2025-01-09 17:36:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 824 transitions. [2025-01-09 17:36:00,367 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 824 transitions. Word has length 157 [2025-01-09 17:36:00,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:00,367 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 824 transitions. [2025-01-09 17:36:00,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 17:36:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 824 transitions. [2025-01-09 17:36:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 17:36:00,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:00,369 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 17:36:00,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 17:36:00,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:36:00,570 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:00,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:00,571 INFO L85 PathProgramCache]: Analyzing trace with hash 335542357, now seen corresponding path program 1 times [2025-01-09 17:36:00,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:00,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766927383] [2025-01-09 17:36:00,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:00,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:01,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 17:36:01,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 17:36:01,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:01,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 17:36:01,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:01,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766927383] [2025-01-09 17:36:01,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766927383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:01,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:01,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 17:36:01,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017031378] [2025-01-09 17:36:01,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:01,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:36:01,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:01,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:36:01,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:36:01,651 INFO L87 Difference]: Start difference. First operand 679 states and 824 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 17:36:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:01,666 INFO L93 Difference]: Finished difference Result 960 states and 1170 transitions. [2025-01-09 17:36:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:36:01,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 169 [2025-01-09 17:36:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:01,668 INFO L225 Difference]: With dead ends: 960 [2025-01-09 17:36:01,668 INFO L226 Difference]: Without dead ends: 441 [2025-01-09 17:36:01,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:36:01,670 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:01,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 456 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:36:01,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-01-09 17:36:01,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2025-01-09 17:36:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 351 states have (on average 1.170940170940171) internal successors, (411), 352 states have internal predecessors, (411), 55 states have call successors, (55), 32 states have call predecessors, (55), 34 states have return successors, (61), 56 states have call predecessors, (61), 51 states have call successors, (61) [2025-01-09 17:36:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 527 transitions. [2025-01-09 17:36:01,684 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 527 transitions. Word has length 169 [2025-01-09 17:36:01,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:01,685 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 527 transitions. [2025-01-09 17:36:01,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 17:36:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 527 transitions. [2025-01-09 17:36:01,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 17:36:01,686 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:01,686 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 17:36:01,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 17:36:01,686 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:01,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:01,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1097931632, now seen corresponding path program 1 times [2025-01-09 17:36:01,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:01,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588824711] [2025-01-09 17:36:01,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:01,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:02,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 17:36:02,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 17:36:02,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:02,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 17:36:03,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:03,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588824711] [2025-01-09 17:36:03,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588824711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:03,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:03,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 17:36:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532597748] [2025-01-09 17:36:03,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:03,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:36:03,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:03,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:36:03,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:36:03,021 INFO L87 Difference]: Start difference. First operand 441 states and 527 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 17:36:03,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:03,050 INFO L93 Difference]: Finished difference Result 773 states and 928 transitions. [2025-01-09 17:36:03,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:36:03,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 171 [2025-01-09 17:36:03,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:03,054 INFO L225 Difference]: With dead ends: 773 [2025-01-09 17:36:03,054 INFO L226 Difference]: Without dead ends: 441 [2025-01-09 17:36:03,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:36:03,057 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 2 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:03,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 447 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:36:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-01-09 17:36:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2025-01-09 17:36:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 351 states have (on average 1.1652421652421652) internal successors, (409), 352 states have internal predecessors, (409), 55 states have call successors, (55), 32 states have call predecessors, (55), 34 states have return successors, (61), 56 states have call predecessors, (61), 51 states have call successors, (61) [2025-01-09 17:36:03,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 525 transitions. [2025-01-09 17:36:03,070 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 525 transitions. Word has length 171 [2025-01-09 17:36:03,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:03,070 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 525 transitions. [2025-01-09 17:36:03,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 17:36:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 525 transitions. [2025-01-09 17:36:03,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 17:36:03,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:03,072 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 17:36:03,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 17:36:03,073 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:03,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash -195805837, now seen corresponding path program 1 times [2025-01-09 17:36:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:03,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675053359] [2025-01-09 17:36:03,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:03,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:03,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 17:36:04,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 17:36:04,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:04,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 17:36:04,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:04,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675053359] [2025-01-09 17:36:04,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675053359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:04,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:04,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 17:36:04,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300360221] [2025-01-09 17:36:04,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:04,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 17:36:04,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:04,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 17:36:04,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 17:36:04,484 INFO L87 Difference]: Start difference. First operand 441 states and 525 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 17:36:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:04,557 INFO L93 Difference]: Finished difference Result 786 states and 942 transitions. [2025-01-09 17:36:04,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 17:36:04,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 173 [2025-01-09 17:36:04,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:04,559 INFO L225 Difference]: With dead ends: 786 [2025-01-09 17:36:04,559 INFO L226 Difference]: Without dead ends: 451 [2025-01-09 17:36:04,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 17:36:04,560 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 4 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:04,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1084 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:36:04,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-01-09 17:36:04,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2025-01-09 17:36:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 357 states have (on average 1.1624649859943978) internal successors, (415), 358 states have internal predecessors, (415), 55 states have call successors, (55), 32 states have call predecessors, (55), 34 states have return successors, (61), 56 states have call predecessors, (61), 51 states have call successors, (61) [2025-01-09 17:36:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 531 transitions. [2025-01-09 17:36:04,575 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 531 transitions. Word has length 173 [2025-01-09 17:36:04,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:04,575 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 531 transitions. [2025-01-09 17:36:04,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 17:36:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 531 transitions. [2025-01-09 17:36:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 17:36:04,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:04,577 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 17:36:04,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 17:36:04,577 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:04,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:04,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1595004688, now seen corresponding path program 1 times [2025-01-09 17:36:04,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:04,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185673825] [2025-01-09 17:36:04,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:04,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:05,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 17:36:05,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 17:36:05,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:05,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 17:36:06,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:06,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185673825] [2025-01-09 17:36:06,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185673825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:06,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:06,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 17:36:06,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655572115] [2025-01-09 17:36:06,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:06,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 17:36:06,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:06,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 17:36:06,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 17:36:06,007 INFO L87 Difference]: Start difference. First operand 447 states and 531 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 17:36:10,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:36:14,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:36:14,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:14,619 INFO L93 Difference]: Finished difference Result 456 states and 538 transitions. [2025-01-09 17:36:14,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 17:36:14,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 174 [2025-01-09 17:36:14,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:14,622 INFO L225 Difference]: With dead ends: 456 [2025-01-09 17:36:14,622 INFO L226 Difference]: Without dead ends: 394 [2025-01-09 17:36:14,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 17:36:14,623 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 225 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 54 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:14,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 554 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 274 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-01-09 17:36:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-01-09 17:36:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 273. [2025-01-09 17:36:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 215 states have (on average 1.1348837209302325) internal successors, (244), 217 states have internal predecessors, (244), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (34), 32 states have call predecessors, (34), 33 states have call successors, (34) [2025-01-09 17:36:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 313 transitions. [2025-01-09 17:36:14,633 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 313 transitions. Word has length 174 [2025-01-09 17:36:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:14,634 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 313 transitions. [2025-01-09 17:36:14,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 17:36:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 313 transitions. [2025-01-09 17:36:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-09 17:36:14,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:14,635 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 17:36:14,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 17:36:14,635 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:14,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:14,635 INFO L85 PathProgramCache]: Analyzing trace with hash 856340515, now seen corresponding path program 1 times [2025-01-09 17:36:14,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:14,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825235324] [2025-01-09 17:36:14,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:14,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:15,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 17:36:15,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 17:36:15,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:15,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 17:36:16,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:16,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825235324] [2025-01-09 17:36:16,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825235324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:16,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:16,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 17:36:16,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520661706] [2025-01-09 17:36:16,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:16,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 17:36:16,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:16,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 17:36:16,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:36:16,132 INFO L87 Difference]: Start difference. First operand 273 states and 313 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 17:36:20,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:36:20,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:20,221 INFO L93 Difference]: Finished difference Result 279 states and 318 transitions. [2025-01-09 17:36:20,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 17:36:20,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 201 [2025-01-09 17:36:20,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:20,224 INFO L225 Difference]: With dead ends: 279 [2025-01-09 17:36:20,224 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 17:36:20,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:36:20,225 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 74 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:20,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 724 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 17:36:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 17:36:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 17:36:20,226 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-01-09 17:36:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 17:36:20,227 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 201 [2025-01-09 17:36:20,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:20,227 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 17:36:20,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 17:36:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 17:36:20,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 17:36:20,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 17:36:20,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 17:36:20,233 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] [2025-01-09 17:36:20,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.