./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 22:58:27,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 22:58:28,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-22 22:58:28,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 22:58:28,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 22:58:28,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 22:58:28,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 22:58:28,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 22:58:28,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 22:58:28,036 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 22:58:28,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 22:58:28,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 22:58:28,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 22:58:28,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 22:58:28,039 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 22:58:28,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 22:58:28,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 22:58:28,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 22:58:28,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 22:58:28,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 22:58:28,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 22:58:28,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 22:58:28,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 22:58:28,044 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 22:58:28,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 22:58:28,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 22:58:28,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 22:58:28,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 22:58:28,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:58:28,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 22:58:28,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 22:58:28,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 22:58:28,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 22:58:28,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 22:58:28,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 22:58:28,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 22:58:28,047 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 22:58:28,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 22:58:28,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 22:58:28,047 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 22:58:28,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 22:58:28,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 22:58:28,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 22:58:28,291 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 22:58:28,292 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 22:58:28,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2023-11-22 22:58:29,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 22:58:29,563 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 22:58:29,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2023-11-22 22:58:29,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92d01e9be/63bf640b58ff4eafaff0e04039edfab7/FLAG5c8a46c0c [2023-11-22 22:58:29,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92d01e9be/63bf640b58ff4eafaff0e04039edfab7 [2023-11-22 22:58:29,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 22:58:29,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 22:58:29,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 22:58:29,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 22:58:29,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 22:58:29,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:58:29" (1/1) ... [2023-11-22 22:58:29,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a18b1bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:29, skipping insertion in model container [2023-11-22 22:58:29,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:58:29" (1/1) ... [2023-11-22 22:58:29,688 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 22:58:30,101 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2023-11-22 22:58:30,124 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:58:30,162 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 22:58:30,288 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2023-11-22 22:58:30,299 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:58:30,321 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 22:58:30,322 WARN L675 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 22:58:30,327 INFO L206 MainTranslator]: Completed translation [2023-11-22 22:58:30,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:30 WrapperNode [2023-11-22 22:58:30,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 22:58:30,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 22:58:30,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 22:58:30,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 22:58:30,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:30" (1/1) ... [2023-11-22 22:58:30,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:30" (1/1) ... [2023-11-22 22:58:30,421 INFO L138 Inliner]: procedures = 102, calls = 434, calls flagged for inlining = 49, calls inlined = 44, statements flattened = 1146 [2023-11-22 22:58:30,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 22:58:30,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 22:58:30,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 22:58:30,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 22:58:30,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:30" (1/1) ... [2023-11-22 22:58:30,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:30" (1/1) ... [2023-11-22 22:58:30,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:30" (1/1) ... [2023-11-22 22:58:30,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:30" (1/1) ... [2023-11-22 22:58:30,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:30" (1/1) ... [2023-11-22 22:58:30,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:30" (1/1) ... [2023-11-22 22:58:30,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:30" (1/1) ... [2023-11-22 22:58:30,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:30" (1/1) ... [2023-11-22 22:58:30,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 22:58:30,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 22:58:30,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 22:58:30,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 22:58:30,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:30" (1/1) ... [2023-11-22 22:58:30,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:58:30,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:58:30,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 22:58:30,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 22:58:30,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-22 22:58:30,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-22 22:58:30,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-22 22:58:30,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 22:58:30,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-22 22:58:30,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-22 22:58:30,600 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-22 22:58:30,601 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-22 22:58:30,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 22:58:30,601 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-22 22:58:30,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-22 22:58:30,602 INFO L130 BoogieDeclarations]: Found specification of procedure extract_value [2023-11-22 22:58:30,602 INFO L138 BoogieDeclarations]: Found implementation of procedure extract_value [2023-11-22 22:58:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 22:58:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 22:58:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2023-11-22 22:58:30,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2023-11-22 22:58:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-22 22:58:30,603 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2023-11-22 22:58:30,603 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2023-11-22 22:58:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 22:58:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-22 22:58:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-22 22:58:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_bmc_delete [2023-11-22 22:58:30,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_bmc_delete [2023-11-22 22:58:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-22 22:58:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-22 22:58:30,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-22 22:58:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_send_message [2023-11-22 22:58:30,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_send_message [2023-11-22 22:58:30,606 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2023-11-22 22:58:30,606 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2023-11-22 22:58:30,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 22:58:30,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-22 22:58:30,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-22 22:58:30,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-22 22:58:30,607 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2023-11-22 22:58:30,607 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2023-11-22 22:58:30,607 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2023-11-22 22:58:30,607 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2023-11-22 22:58:30,607 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-11-22 22:58:30,607 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-11-22 22:58:30,607 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2023-11-22 22:58:30,608 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2023-11-22 22:58:30,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 22:58:30,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2023-11-22 22:58:30,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2023-11-22 22:58:30,608 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2023-11-22 22:58:30,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2023-11-22 22:58:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-22 22:58:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2023-11-22 22:58:30,609 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2023-11-22 22:58:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 22:58:30,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 22:58:30,810 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 22:58:30,812 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 22:58:31,515 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 22:58:31,654 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 22:58:31,654 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-22 22:58:31,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:58:31 BoogieIcfgContainer [2023-11-22 22:58:31,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 22:58:31,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 22:58:31,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 22:58:31,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 22:58:31,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:58:29" (1/3) ... [2023-11-22 22:58:31,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c4e760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:58:31, skipping insertion in model container [2023-11-22 22:58:31,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:58:30" (2/3) ... [2023-11-22 22:58:31,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c4e760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:58:31, skipping insertion in model container [2023-11-22 22:58:31,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:58:31" (3/3) ... [2023-11-22 22:58:31,661 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2023-11-22 22:58:31,675 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 22:58:31,676 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 22:58:31,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 22:58:31,728 INFO L357 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, mHoare=true, 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;@30ccefb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 22:58:31,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 22:58:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 165 states have (on average 1.4) internal successors, (231), 170 states have internal predecessors, (231), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-22 22:58:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 22:58:31,747 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:58:31,748 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 22:58:31,749 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:58:31,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:58:31,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1876682886, now seen corresponding path program 1 times [2023-11-22 22:58:31,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:58:31,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789658885] [2023-11-22 22:58:31,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:31,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:58:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:32,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:32,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 22:58:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:32,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:58:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:32,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:32,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:32,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 22:58:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:32,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:58:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:32,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 22:58:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:32,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 22:58:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:32,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 22:58:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:32,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-22 22:58:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:32,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 22:58:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:32,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 22:58:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:32,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:32,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-22 22:58:32,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:58:32,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789658885] [2023-11-22 22:58:32,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789658885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:58:32,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:58:32,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 22:58:32,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861958450] [2023-11-22 22:58:32,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:58:32,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 22:58:32,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:58:32,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 22:58:32,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:58:32,517 INFO L87 Difference]: Start difference. First operand has 239 states, 165 states have (on average 1.4) internal successors, (231), 170 states have internal predecessors, (231), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-22 22:58:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:58:33,966 INFO L93 Difference]: Finished difference Result 552 states and 806 transitions. [2023-11-22 22:58:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 22:58:33,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 99 [2023-11-22 22:58:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:58:33,977 INFO L225 Difference]: With dead ends: 552 [2023-11-22 22:58:33,977 INFO L226 Difference]: Without dead ends: 303 [2023-11-22 22:58:33,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 22:58:33,983 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 197 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-22 22:58:33,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 973 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-22 22:58:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-11-22 22:58:34,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 233. [2023-11-22 22:58:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 163 states have (on average 1.3680981595092025) internal successors, (223), 166 states have internal predecessors, (223), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-22 22:58:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 325 transitions. [2023-11-22 22:58:34,033 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 325 transitions. Word has length 99 [2023-11-22 22:58:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:58:34,034 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 325 transitions. [2023-11-22 22:58:34,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-22 22:58:34,035 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 325 transitions. [2023-11-22 22:58:34,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-22 22:58:34,046 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:58:34,046 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 22:58:34,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 22:58:34,047 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:58:34,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:58:34,048 INFO L85 PathProgramCache]: Analyzing trace with hash -208057355, now seen corresponding path program 1 times [2023-11-22 22:58:34,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:58:34,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247274972] [2023-11-22 22:58:34,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:34,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:58:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 22:58:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:58:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 22:58:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:58:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:58:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 22:58:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 22:58:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 22:58:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:58:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 22:58:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 22:58:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-22 22:58:34,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:58:34,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247274972] [2023-11-22 22:58:34,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247274972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:58:34,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:58:34,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 22:58:34,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358397605] [2023-11-22 22:58:34,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:58:34,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 22:58:34,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:58:34,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 22:58:34,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 22:58:34,277 INFO L87 Difference]: Start difference. First operand 233 states and 325 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-22 22:58:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:58:35,145 INFO L93 Difference]: Finished difference Result 486 states and 684 transitions. [2023-11-22 22:58:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 22:58:35,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-11-22 22:58:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:58:35,148 INFO L225 Difference]: With dead ends: 486 [2023-11-22 22:58:35,148 INFO L226 Difference]: Without dead ends: 257 [2023-11-22 22:58:35,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:58:35,151 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 138 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-22 22:58:35,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 599 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-22 22:58:35,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-11-22 22:58:35,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 234. [2023-11-22 22:58:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 164 states have (on average 1.3658536585365855) internal successors, (224), 167 states have internal predecessors, (224), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-22 22:58:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 326 transitions. [2023-11-22 22:58:35,165 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 326 transitions. Word has length 105 [2023-11-22 22:58:35,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:58:35,166 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 326 transitions. [2023-11-22 22:58:35,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-22 22:58:35,166 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 326 transitions. [2023-11-22 22:58:35,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-22 22:58:35,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:58:35,167 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 22:58:35,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 22:58:35,168 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:58:35,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:58:35,168 INFO L85 PathProgramCache]: Analyzing trace with hash -262450253, now seen corresponding path program 1 times [2023-11-22 22:58:35,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:58:35,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545671540] [2023-11-22 22:58:35,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:35,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:58:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 22:58:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:58:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 22:58:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:58:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:58:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 22:58:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 22:58:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 22:58:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:58:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 22:58:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 22:58:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-22 22:58:35,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:58:35,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545671540] [2023-11-22 22:58:35,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545671540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:58:35,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:58:35,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 22:58:35,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174361935] [2023-11-22 22:58:35,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:58:35,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 22:58:35,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:58:35,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 22:58:35,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:58:35,446 INFO L87 Difference]: Start difference. First operand 234 states and 326 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-22 22:58:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:58:36,707 INFO L93 Difference]: Finished difference Result 561 states and 802 transitions. [2023-11-22 22:58:36,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 22:58:36,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-11-22 22:58:36,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:58:36,710 INFO L225 Difference]: With dead ends: 561 [2023-11-22 22:58:36,710 INFO L226 Difference]: Without dead ends: 331 [2023-11-22 22:58:36,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 22:58:36,712 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 207 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-22 22:58:36,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1016 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-22 22:58:36,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-22 22:58:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 236. [2023-11-22 22:58:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 166 states have (on average 1.3614457831325302) internal successors, (226), 169 states have internal predecessors, (226), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-22 22:58:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 328 transitions. [2023-11-22 22:58:36,749 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 328 transitions. Word has length 105 [2023-11-22 22:58:36,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:58:36,750 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 328 transitions. [2023-11-22 22:58:36,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-22 22:58:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 328 transitions. [2023-11-22 22:58:36,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-22 22:58:36,752 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:58:36,752 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 22:58:36,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 22:58:36,753 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:58:36,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:58:36,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1660777781, now seen corresponding path program 1 times [2023-11-22 22:58:36,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:58:36,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346195119] [2023-11-22 22:58:36,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:36,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:58:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 22:58:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:58:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 22:58:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:58:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:58:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 22:58:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 22:58:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 22:58:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:58:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 22:58:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 22:58:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-22 22:58:36,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:58:36,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346195119] [2023-11-22 22:58:36,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346195119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:58:36,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:58:36,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 22:58:36,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474749933] [2023-11-22 22:58:36,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:58:36,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 22:58:36,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:58:36,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 22:58:36,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 22:58:36,948 INFO L87 Difference]: Start difference. First operand 236 states and 328 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-22 22:58:37,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:58:37,798 INFO L93 Difference]: Finished difference Result 492 states and 690 transitions. [2023-11-22 22:58:37,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 22:58:37,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-11-22 22:58:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:58:37,800 INFO L225 Difference]: With dead ends: 492 [2023-11-22 22:58:37,800 INFO L226 Difference]: Without dead ends: 260 [2023-11-22 22:58:37,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:58:37,801 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 138 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-22 22:58:37,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 598 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-22 22:58:37,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-22 22:58:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 237. [2023-11-22 22:58:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 167 states have (on average 1.3592814371257484) internal successors, (227), 170 states have internal predecessors, (227), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-22 22:58:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 329 transitions. [2023-11-22 22:58:37,818 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 329 transitions. Word has length 105 [2023-11-22 22:58:37,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:58:37,818 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 329 transitions. [2023-11-22 22:58:37,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-22 22:58:37,819 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 329 transitions. [2023-11-22 22:58:37,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-22 22:58:37,820 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:58:37,820 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 22:58:37,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 22:58:37,820 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:58:37,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:58:37,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1151304691, now seen corresponding path program 1 times [2023-11-22 22:58:37,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:58:37,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350038814] [2023-11-22 22:58:37,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:37,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:58:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 22:58:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:58:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 22:58:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:58:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:58:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 22:58:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 22:58:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 22:58:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:58:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 22:58:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 22:58:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-22 22:58:38,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:58:38,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350038814] [2023-11-22 22:58:38,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350038814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:58:38,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:58:38,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 22:58:38,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123779620] [2023-11-22 22:58:38,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:58:38,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 22:58:38,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:58:38,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 22:58:38,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:58:38,143 INFO L87 Difference]: Start difference. First operand 237 states and 329 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-22 22:58:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:58:39,577 INFO L93 Difference]: Finished difference Result 766 states and 1085 transitions. [2023-11-22 22:58:39,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 22:58:39,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-11-22 22:58:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:58:39,581 INFO L225 Difference]: With dead ends: 766 [2023-11-22 22:58:39,581 INFO L226 Difference]: Without dead ends: 762 [2023-11-22 22:58:39,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-22 22:58:39,582 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 945 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-22 22:58:39,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 782 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-22 22:58:39,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2023-11-22 22:58:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 693. [2023-11-22 22:58:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 491 states have (on average 1.3584521384928716) internal successors, (667), 498 states have internal predecessors, (667), 150 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (152), 148 states have call predecessors, (152), 148 states have call successors, (152) [2023-11-22 22:58:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 969 transitions. [2023-11-22 22:58:39,633 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 969 transitions. Word has length 105 [2023-11-22 22:58:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:58:39,633 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 969 transitions. [2023-11-22 22:58:39,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-22 22:58:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 969 transitions. [2023-11-22 22:58:39,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-22 22:58:39,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:58:39,635 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-22 22:58:39,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 22:58:39,635 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:58:39,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:58:39,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1007883240, now seen corresponding path program 1 times [2023-11-22 22:58:39,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:58:39,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092572958] [2023-11-22 22:58:39,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:39,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:58:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 22:58:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:58:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 22:58:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:58:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:58:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 22:58:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 22:58:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 22:58:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:58:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 22:58:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 22:58:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 22:58:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:39,916 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-22 22:58:39,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:58:39,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092572958] [2023-11-22 22:58:39,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092572958] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:58:39,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048855860] [2023-11-22 22:58:39,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:39,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:58:39,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:58:39,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 22:58:39,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 22:58:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:40,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 22:58:40,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:58:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-22 22:58:40,369 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 22:58:40,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048855860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:58:40,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 22:58:40,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-22 22:58:40,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108321323] [2023-11-22 22:58:40,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:58:40,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 22:58:40,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:58:40,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 22:58:40,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-22 22:58:40,371 INFO L87 Difference]: Start difference. First operand 693 states and 969 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-22 22:58:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:58:40,755 INFO L93 Difference]: Finished difference Result 1384 states and 1937 transitions. [2023-11-22 22:58:40,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 22:58:40,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 113 [2023-11-22 22:58:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:58:40,760 INFO L225 Difference]: With dead ends: 1384 [2023-11-22 22:58:40,761 INFO L226 Difference]: Without dead ends: 1151 [2023-11-22 22:58:40,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-22 22:58:40,767 INFO L413 NwaCegarLoop]: 529 mSDtfsCounter, 311 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 22:58:40,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 804 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 22:58:40,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2023-11-22 22:58:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 921. [2023-11-22 22:58:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 653 states have (on average 1.356814701378254) internal successors, (886), 662 states have internal predecessors, (886), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-22 22:58:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1286 transitions. [2023-11-22 22:58:40,824 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1286 transitions. Word has length 113 [2023-11-22 22:58:40,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:58:40,825 INFO L495 AbstractCegarLoop]: Abstraction has 921 states and 1286 transitions. [2023-11-22 22:58:40,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-22 22:58:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1286 transitions. [2023-11-22 22:58:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-22 22:58:40,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:58:40,830 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 22:58:40,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-22 22:58:41,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-22 22:58:41,037 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:58:41,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:58:41,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1607293947, now seen corresponding path program 1 times [2023-11-22 22:58:41,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:58:41,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111424101] [2023-11-22 22:58:41,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:41,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:58:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 22:58:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:58:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 22:58:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:58:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:58:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 22:58:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 22:58:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 22:58:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:58:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 22:58:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 22:58:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 22:58:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 22:58:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-22 22:58:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-22 22:58:41,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:58:41,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111424101] [2023-11-22 22:58:41,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111424101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:58:41,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:58:41,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 22:58:41,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583072297] [2023-11-22 22:58:41,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:58:41,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 22:58:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:58:41,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 22:58:41,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:58:41,316 INFO L87 Difference]: Start difference. First operand 921 states and 1286 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-22 22:58:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:58:42,872 INFO L93 Difference]: Finished difference Result 2430 states and 3513 transitions. [2023-11-22 22:58:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 22:58:42,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2023-11-22 22:58:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:58:42,879 INFO L225 Difference]: With dead ends: 2430 [2023-11-22 22:58:42,879 INFO L226 Difference]: Without dead ends: 1513 [2023-11-22 22:58:42,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 22:58:42,882 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 256 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-22 22:58:42,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1203 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-22 22:58:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2023-11-22 22:58:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 929. [2023-11-22 22:58:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 661 states have (on average 1.3524962178517397) internal successors, (894), 670 states have internal predecessors, (894), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-22 22:58:42,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1294 transitions. [2023-11-22 22:58:42,932 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1294 transitions. Word has length 150 [2023-11-22 22:58:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:58:42,932 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1294 transitions. [2023-11-22 22:58:42,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-22 22:58:42,933 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1294 transitions. [2023-11-22 22:58:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-22 22:58:42,935 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:58:42,935 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 22:58:42,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-22 22:58:42,935 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:58:42,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:58:42,936 INFO L85 PathProgramCache]: Analyzing trace with hash 842306183, now seen corresponding path program 1 times [2023-11-22 22:58:42,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:58:42,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953062397] [2023-11-22 22:58:42,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:42,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:58:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 22:58:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:58:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 22:58:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:58:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:58:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 22:58:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 22:58:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 22:58:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:58:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 22:58:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 22:58:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 22:58:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 22:58:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-22 22:58:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-22 22:58:43,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:58:43,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953062397] [2023-11-22 22:58:43,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953062397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:58:43,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:58:43,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 22:58:43,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152512475] [2023-11-22 22:58:43,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:58:43,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 22:58:43,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:58:43,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 22:58:43,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 22:58:43,147 INFO L87 Difference]: Start difference. First operand 929 states and 1294 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-22 22:58:43,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:58:43,941 INFO L93 Difference]: Finished difference Result 1950 states and 2739 transitions. [2023-11-22 22:58:43,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 22:58:43,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2023-11-22 22:58:43,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:58:43,946 INFO L225 Difference]: With dead ends: 1950 [2023-11-22 22:58:43,946 INFO L226 Difference]: Without dead ends: 1025 [2023-11-22 22:58:43,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:58:43,949 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 138 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-22 22:58:43,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 598 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-22 22:58:43,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2023-11-22 22:58:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 933. [2023-11-22 22:58:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 665 states have (on average 1.350375939849624) internal successors, (898), 674 states have internal predecessors, (898), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-22 22:58:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1298 transitions. [2023-11-22 22:58:43,988 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1298 transitions. Word has length 150 [2023-11-22 22:58:43,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:58:43,988 INFO L495 AbstractCegarLoop]: Abstraction has 933 states and 1298 transitions. [2023-11-22 22:58:43,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-22 22:58:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1298 transitions. [2023-11-22 22:58:43,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-22 22:58:43,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:58:43,991 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 22:58:43,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 22:58:43,991 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:58:43,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:58:43,991 INFO L85 PathProgramCache]: Analyzing trace with hash -529501115, now seen corresponding path program 1 times [2023-11-22 22:58:43,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:58:43,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075403395] [2023-11-22 22:58:43,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:43,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:58:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 22:58:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:58:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 22:58:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:58:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:58:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 22:58:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 22:58:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 22:58:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:58:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 22:58:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 22:58:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 22:58:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 22:58:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-22 22:58:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-22 22:58:44,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:58:44,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075403395] [2023-11-22 22:58:44,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075403395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:58:44,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:58:44,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 22:58:44,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076496888] [2023-11-22 22:58:44,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:58:44,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 22:58:44,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:58:44,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 22:58:44,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:58:44,267 INFO L87 Difference]: Start difference. First operand 933 states and 1298 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-22 22:58:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:58:45,834 INFO L93 Difference]: Finished difference Result 2906 states and 4247 transitions. [2023-11-22 22:58:45,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 22:58:45,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2023-11-22 22:58:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:58:45,843 INFO L225 Difference]: With dead ends: 2906 [2023-11-22 22:58:45,843 INFO L226 Difference]: Without dead ends: 1977 [2023-11-22 22:58:45,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 22:58:45,848 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 422 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-22 22:58:45,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1346 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-22 22:58:45,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2023-11-22 22:58:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 941. [2023-11-22 22:58:45,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 673 states have (on average 1.3462109955423478) internal successors, (906), 682 states have internal predecessors, (906), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-22 22:58:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1306 transitions. [2023-11-22 22:58:45,902 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1306 transitions. Word has length 150 [2023-11-22 22:58:45,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:58:45,902 INFO L495 AbstractCegarLoop]: Abstraction has 941 states and 1306 transitions. [2023-11-22 22:58:45,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-22 22:58:45,903 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1306 transitions. [2023-11-22 22:58:45,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-22 22:58:45,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:58:45,904 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 22:58:45,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-22 22:58:45,905 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:58:45,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:58:45,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2065847726, now seen corresponding path program 1 times [2023-11-22 22:58:45,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:58:45,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405128839] [2023-11-22 22:58:45,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:45,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:58:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 22:58:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:58:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 22:58:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:58:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:58:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 22:58:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 22:58:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 22:58:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:58:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 22:58:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 22:58:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 22:58:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 22:58:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-22 22:58:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-22 22:58:46,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:58:46,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405128839] [2023-11-22 22:58:46,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405128839] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:58:46,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:58:46,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 22:58:46,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674795836] [2023-11-22 22:58:46,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:58:46,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 22:58:46,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:58:46,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 22:58:46,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:58:46,212 INFO L87 Difference]: Start difference. First operand 941 states and 1306 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-22 22:58:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:58:47,774 INFO L93 Difference]: Finished difference Result 3090 states and 4533 transitions. [2023-11-22 22:58:47,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 22:58:47,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 151 [2023-11-22 22:58:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:58:47,783 INFO L225 Difference]: With dead ends: 3090 [2023-11-22 22:58:47,783 INFO L226 Difference]: Without dead ends: 2153 [2023-11-22 22:58:47,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 22:58:47,786 INFO L413 NwaCegarLoop]: 448 mSDtfsCounter, 475 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-22 22:58:47,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1525 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-22 22:58:47,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2023-11-22 22:58:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 949. [2023-11-22 22:58:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 681 states have (on average 1.342143906020558) internal successors, (914), 690 states have internal predecessors, (914), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-22 22:58:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1314 transitions. [2023-11-22 22:58:47,882 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1314 transitions. Word has length 151 [2023-11-22 22:58:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:58:47,882 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1314 transitions. [2023-11-22 22:58:47,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-22 22:58:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1314 transitions. [2023-11-22 22:58:47,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-22 22:58:47,884 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:58:47,884 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 22:58:47,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 22:58:47,885 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:58:47,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:58:47,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1885893366, now seen corresponding path program 1 times [2023-11-22 22:58:47,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:58:47,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273436795] [2023-11-22 22:58:47,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:47,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:58:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 22:58:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:58:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 22:58:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:58:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:58:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 22:58:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 22:58:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 22:58:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:58:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 22:58:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 22:58:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 22:58:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 22:58:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-22 22:58:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:48,160 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-22 22:58:48,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:58:48,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273436795] [2023-11-22 22:58:48,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273436795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:58:48,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:58:48,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 22:58:48,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138205871] [2023-11-22 22:58:48,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:58:48,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 22:58:48,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:58:48,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 22:58:48,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:58:48,162 INFO L87 Difference]: Start difference. First operand 949 states and 1314 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-22 22:58:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:58:49,384 INFO L93 Difference]: Finished difference Result 2278 states and 3223 transitions. [2023-11-22 22:58:49,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 22:58:49,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 151 [2023-11-22 22:58:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:58:49,389 INFO L225 Difference]: With dead ends: 2278 [2023-11-22 22:58:49,390 INFO L226 Difference]: Without dead ends: 1333 [2023-11-22 22:58:49,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 22:58:49,392 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 228 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 22:58:49,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 984 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 22:58:49,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2023-11-22 22:58:49,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1012. [2023-11-22 22:58:49,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 736 states have (on average 1.346467391304348) internal successors, (991), 745 states have internal predecessors, (991), 207 states have call successors, (207), 69 states have call predecessors, (207), 68 states have return successors, (209), 205 states have call predecessors, (209), 205 states have call successors, (209) [2023-11-22 22:58:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1407 transitions. [2023-11-22 22:58:49,434 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1407 transitions. Word has length 151 [2023-11-22 22:58:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:58:49,435 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1407 transitions. [2023-11-22 22:58:49,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-22 22:58:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1407 transitions. [2023-11-22 22:58:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-22 22:58:49,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:58:49,437 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 22:58:49,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-22 22:58:49,437 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:58:49,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:58:49,438 INFO L85 PathProgramCache]: Analyzing trace with hash -728050790, now seen corresponding path program 1 times [2023-11-22 22:58:49,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:58:49,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034960174] [2023-11-22 22:58:49,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:49,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:58:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 22:58:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:58:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 22:58:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:58:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:58:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 22:58:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 22:58:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 22:58:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:58:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 22:58:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 22:58:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 22:58:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 22:58:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-22 22:58:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-22 22:58:49,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:58:49,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034960174] [2023-11-22 22:58:49,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034960174] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:58:49,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642048029] [2023-11-22 22:58:49,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:49,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:58:49,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:58:49,681 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 22:58:49,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 22:58:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:50,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 22:58:50,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:58:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-22 22:58:50,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:58:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-22 22:58:50,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642048029] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:58:50,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:58:50,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2023-11-22 22:58:50,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906637943] [2023-11-22 22:58:50,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:58:50,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 22:58:50,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:58:50,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 22:58:50,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-22 22:58:50,339 INFO L87 Difference]: Start difference. First operand 1012 states and 1407 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 6 states have internal predecessors, (112), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-22 22:58:51,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:58:51,488 INFO L93 Difference]: Finished difference Result 2538 states and 3631 transitions. [2023-11-22 22:58:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 22:58:51,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 6 states have internal predecessors, (112), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 152 [2023-11-22 22:58:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:58:51,495 INFO L225 Difference]: With dead ends: 2538 [2023-11-22 22:58:51,495 INFO L226 Difference]: Without dead ends: 1530 [2023-11-22 22:58:51,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-22 22:58:51,498 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 208 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 22:58:51,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 989 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 22:58:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2023-11-22 22:58:51,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1316. [2023-11-22 22:58:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 992 states have (on average 1.3538306451612903) internal successors, (1343), 1001 states have internal predecessors, (1343), 255 states have call successors, (255), 69 states have call predecessors, (255), 68 states have return successors, (257), 253 states have call predecessors, (257), 253 states have call successors, (257) [2023-11-22 22:58:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1855 transitions. [2023-11-22 22:58:51,547 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1855 transitions. Word has length 152 [2023-11-22 22:58:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:58:51,548 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1855 transitions. [2023-11-22 22:58:51,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 6 states have internal predecessors, (112), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-22 22:58:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1855 transitions. [2023-11-22 22:58:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-22 22:58:51,550 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:58:51,550 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:58:51,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-22 22:58:51,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-22 22:58:51,764 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:58:51,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:58:51,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1006770323, now seen corresponding path program 1 times [2023-11-22 22:58:51,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:58:51,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601222907] [2023-11-22 22:58:51,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:51,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:58:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:51,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:51,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 22:58:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:51,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:58:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:51,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:51,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:51,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 22:58:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:51,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:58:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:51,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:58:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:51,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 22:58:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:51,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 22:58:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:52,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 22:58:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:52,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:58:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:52,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 22:58:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:52,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 22:58:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:52,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:52,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:52,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 22:58:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:52,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 22:58:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:52,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-22 22:58:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:52,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:52,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-22 22:58:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:52,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:52,034 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-11-22 22:58:52,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:58:52,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601222907] [2023-11-22 22:58:52,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601222907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:58:52,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:58:52,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 22:58:52,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9046767] [2023-11-22 22:58:52,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:58:52,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 22:58:52,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:58:52,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 22:58:52,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 22:58:52,036 INFO L87 Difference]: Start difference. First operand 1316 states and 1855 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-22 22:58:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:58:53,399 INFO L93 Difference]: Finished difference Result 2063 states and 2947 transitions. [2023-11-22 22:58:53,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 22:58:53,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2023-11-22 22:58:53,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:58:53,403 INFO L225 Difference]: With dead ends: 2063 [2023-11-22 22:58:53,404 INFO L226 Difference]: Without dead ends: 1057 [2023-11-22 22:58:53,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-22 22:58:53,406 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 396 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-22 22:58:53,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1011 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-22 22:58:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2023-11-22 22:58:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 983. [2023-11-22 22:58:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 739 states have (on average 1.3355886332882274) internal successors, (987), 746 states have internal predecessors, (987), 192 states have call successors, (192), 52 states have call predecessors, (192), 51 states have return successors, (192), 190 states have call predecessors, (192), 190 states have call successors, (192) [2023-11-22 22:58:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1371 transitions. [2023-11-22 22:58:53,442 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1371 transitions. Word has length 160 [2023-11-22 22:58:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:58:53,442 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 1371 transitions. [2023-11-22 22:58:53,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-22 22:58:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1371 transitions. [2023-11-22 22:58:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-11-22 22:58:53,445 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:58:53,445 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:58:53,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-22 22:58:53,445 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:58:53,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:58:53,446 INFO L85 PathProgramCache]: Analyzing trace with hash -53197984, now seen corresponding path program 1 times [2023-11-22 22:58:53,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:58:53,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107848576] [2023-11-22 22:58:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:53,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:58:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 22:58:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:58:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 22:58:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:58:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:58:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 22:58:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 22:58:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 22:58:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:58:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 22:58:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 22:58:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 22:58:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 22:58:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-22 22:58:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-22 22:58:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-22 22:58:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-11-22 22:58:53,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:58:53,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107848576] [2023-11-22 22:58:53,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107848576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:58:53,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:58:53,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 22:58:53,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264147206] [2023-11-22 22:58:53,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:58:53,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 22:58:53,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:58:53,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 22:58:53,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:58:53,705 INFO L87 Difference]: Start difference. First operand 983 states and 1371 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-22 22:58:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:58:55,133 INFO L93 Difference]: Finished difference Result 2634 states and 3786 transitions. [2023-11-22 22:58:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 22:58:55,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 180 [2023-11-22 22:58:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:58:55,139 INFO L225 Difference]: With dead ends: 2634 [2023-11-22 22:58:55,139 INFO L226 Difference]: Without dead ends: 1655 [2023-11-22 22:58:55,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 22:58:55,142 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 304 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-22 22:58:55,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1293 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-22 22:58:55,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2023-11-22 22:58:55,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 989. [2023-11-22 22:58:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 745 states have (on average 1.3328859060402685) internal successors, (993), 752 states have internal predecessors, (993), 192 states have call successors, (192), 52 states have call predecessors, (192), 51 states have return successors, (192), 190 states have call predecessors, (192), 190 states have call successors, (192) [2023-11-22 22:58:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1377 transitions. [2023-11-22 22:58:55,184 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1377 transitions. Word has length 180 [2023-11-22 22:58:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:58:55,184 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1377 transitions. [2023-11-22 22:58:55,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-22 22:58:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1377 transitions. [2023-11-22 22:58:55,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-22 22:58:55,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:58:55,187 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:58:55,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-22 22:58:55,187 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:58:55,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:58:55,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1940924286, now seen corresponding path program 1 times [2023-11-22 22:58:55,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:58:55,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073789392] [2023-11-22 22:58:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:55,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:58:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 22:58:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:58:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 22:58:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:58:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:58:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 22:58:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 22:58:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 22:58:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:58:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 22:58:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 22:58:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 22:58:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 22:58:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-22 22:58:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-22 22:58:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-22 22:58:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-22 22:58:55,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:58:55,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073789392] [2023-11-22 22:58:55,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073789392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:58:55,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:58:55,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 22:58:55,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660490875] [2023-11-22 22:58:55,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:58:55,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 22:58:55,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:58:55,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 22:58:55,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 22:58:55,456 INFO L87 Difference]: Start difference. First operand 989 states and 1377 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-22 22:58:56,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:58:56,489 INFO L93 Difference]: Finished difference Result 1899 states and 2651 transitions. [2023-11-22 22:58:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 22:58:56,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 190 [2023-11-22 22:58:56,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:58:56,493 INFO L225 Difference]: With dead ends: 1899 [2023-11-22 22:58:56,493 INFO L226 Difference]: Without dead ends: 914 [2023-11-22 22:58:56,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-22 22:58:56,497 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 470 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-22 22:58:56,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 600 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-22 22:58:56,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2023-11-22 22:58:56,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 843. [2023-11-22 22:58:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 619 states have (on average 1.310177705977383) internal successors, (811), 626 states have internal predecessors, (811), 172 states have call successors, (172), 52 states have call predecessors, (172), 51 states have return successors, (172), 170 states have call predecessors, (172), 170 states have call successors, (172) [2023-11-22 22:58:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1155 transitions. [2023-11-22 22:58:56,533 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1155 transitions. Word has length 190 [2023-11-22 22:58:56,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:58:56,533 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 1155 transitions. [2023-11-22 22:58:56,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-22 22:58:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1155 transitions. [2023-11-22 22:58:56,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-22 22:58:56,536 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:58:56,536 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:58:56,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-22 22:58:56,536 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:58:56,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:58:56,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1015934522, now seen corresponding path program 2 times [2023-11-22 22:58:56,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:58:56,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589373987] [2023-11-22 22:58:56,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:58:56,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:58:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 22:58:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:58:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 22:58:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:58:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:58:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 22:58:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 22:58:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 22:58:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:58:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 22:58:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 22:58:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 22:58:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 22:58:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 22:58:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-22 22:58:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-22 22:58:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-22 22:58:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:58:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:58:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-11-22 22:58:56,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:58:56,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589373987] [2023-11-22 22:58:56,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589373987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:58:56,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:58:56,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 22:58:56,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335899452] [2023-11-22 22:58:56,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:58:56,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 22:58:56,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:58:56,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 22:58:56,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-22 22:58:56,973 INFO L87 Difference]: Start difference. First operand 843 states and 1155 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-22 22:58:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:58:58,094 INFO L93 Difference]: Finished difference Result 1214 states and 1697 transitions. [2023-11-22 22:58:58,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 22:58:58,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 5 states have call successors, (21), 5 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 190 [2023-11-22 22:58:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:58:58,095 INFO L225 Difference]: With dead ends: 1214 [2023-11-22 22:58:58,095 INFO L226 Difference]: Without dead ends: 0 [2023-11-22 22:58:58,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-11-22 22:58:58,098 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 968 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:58:58,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 613 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [465 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-22 22:58:58,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-22 22:58:58,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-22 22:58:58,099 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) [2023-11-22 22:58:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-22 22:58:58,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 190 [2023-11-22 22:58:58,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:58:58,099 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-22 22:58:58,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-22 22:58:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-22 22:58:58,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-22 22:58:58,102 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 22:58:58,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-22 22:58:58,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-22 22:59:20,884 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 2594 2596) no Hoare annotation was computed. [2023-11-22 22:59:20,884 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2594 2596) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse2 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse3 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse1 (= |old(#valid)| |#valid|))) (and (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse1) (or .cse2 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse0 .cse3 .cse1) (or .cse2 .cse3 .cse1 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-22 22:59:20,884 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2553 2555) the Hoare annotation is: true [2023-11-22 22:59:20,884 INFO L899 garLoopResultBuilder]: For program point ipmi_destroy_userEXIT(lines 2553 2555) no Hoare annotation was computed. [2023-11-22 22:59:20,885 INFO L895 garLoopResultBuilder]: At program point L2478(line 2478) the Hoare annotation is: (let ((.cse1 (< |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)| 1)) (.cse2 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)))) (and (or .cse0 .cse1) (or .cse2 (< ~ldv_count_1~0 (+ 5 |old(~ldv_count_2~0)|)) .cse1) (or .cse2 (not (= |old(~ldv_count_2~0)| 0)) (< ~ldv_count_1~0 6)) (or (< ~ldv_count_1~0 (+ |old(~ldv_count_2~0)| 1)) .cse0))) [2023-11-22 22:59:20,885 INFO L899 garLoopResultBuilder]: For program point L2476(lines 2476 2479) no Hoare annotation was computed. [2023-11-22 22:59:20,885 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2470 2484) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (< |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)| 1)) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (and (or (and .cse0 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 (< ~ldv_count_1~0 (+ 5 |old(~ldv_count_2~0)|)) .cse2) (or .cse3 .cse0 .cse2) (or (< ~ldv_count_1~0 (+ 2 |old(~ldv_count_2~0)|)) .cse3 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0)) (or (< ~ldv_count_1~0 (+ |old(~ldv_count_2~0)| 1)) .cse3 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (or .cse1 (not (= |old(~ldv_count_2~0)| 0)) (< ~ldv_count_1~0 6) (= ~ldv_count_2~0 0)))) [2023-11-22 22:59:20,885 INFO L899 garLoopResultBuilder]: For program point L2473-1(lines 2473 2481) no Hoare annotation was computed. [2023-11-22 22:59:20,885 INFO L899 garLoopResultBuilder]: For program point L2473(lines 2473 2481) no Hoare annotation was computed. [2023-11-22 22:59:20,885 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeEXIT(lines 2470 2484) no Hoare annotation was computed. [2023-11-22 22:59:20,885 INFO L899 garLoopResultBuilder]: For program point wait_for_completionEXIT(lines 2590 2592) no Hoare annotation was computed. [2023-11-22 22:59:20,886 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2590 2592) the Hoare annotation is: true [2023-11-22 22:59:20,886 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2545 2547) the Hoare annotation is: true [2023-11-22 22:59:20,886 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 2545 2547) no Hoare annotation was computed. [2023-11-22 22:59:20,886 INFO L899 garLoopResultBuilder]: For program point dev_errEXIT(lines 2530 2532) no Hoare annotation was computed. [2023-11-22 22:59:20,886 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2530 2532) the Hoare annotation is: true [2023-11-22 22:59:20,886 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 2412 2417) the Hoare annotation is: true [2023-11-22 22:59:20,886 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2415) no Hoare annotation was computed. [2023-11-22 22:59:20,886 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2412 2417) no Hoare annotation was computed. [2023-11-22 22:59:20,887 INFO L899 garLoopResultBuilder]: For program point L1662(line 1662) no Hoare annotation was computed. [2023-11-22 22:59:20,887 INFO L899 garLoopResultBuilder]: For program point L1662-2(line 1662) no Hoare annotation was computed. [2023-11-22 22:59:20,887 INFO L895 garLoopResultBuilder]: At program point L1662-4(line 1662) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-22 22:59:20,887 INFO L899 garLoopResultBuilder]: For program point L1662-5(line 1662) no Hoare annotation was computed. [2023-11-22 22:59:20,887 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1658 1665) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-22 22:59:20,887 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 1658 1665) no Hoare annotation was computed. [2023-11-22 22:59:20,887 INFO L895 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-22 22:59:20,888 INFO L899 garLoopResultBuilder]: For program point L1646-1(line 1646) no Hoare annotation was computed. [2023-11-22 22:59:20,888 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1649 1656) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-22 22:59:20,888 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 1649 1656) no Hoare annotation was computed. [2023-11-22 22:59:20,888 INFO L899 garLoopResultBuilder]: For program point L1567(line 1567) no Hoare annotation was computed. [2023-11-22 22:59:20,888 INFO L899 garLoopResultBuilder]: For program point L1567-2(line 1567) no Hoare annotation was computed. [2023-11-22 22:59:20,888 INFO L899 garLoopResultBuilder]: For program point L1567-4(line 1567) no Hoare annotation was computed. [2023-11-22 22:59:20,888 INFO L899 garLoopResultBuilder]: For program point extract_valueEXIT(lines 1676 1683) no Hoare annotation was computed. [2023-11-22 22:59:20,888 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1676 1683) the Hoare annotation is: true [2023-11-22 22:59:20,888 INFO L899 garLoopResultBuilder]: For program point L2203-1(line 2203) no Hoare annotation was computed. [2023-11-22 22:59:20,889 INFO L902 garLoopResultBuilder]: At program point L2234(line 2234) the Hoare annotation is: true [2023-11-22 22:59:20,889 INFO L895 garLoopResultBuilder]: At program point L2203(line 2203) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-22 22:59:20,889 INFO L902 garLoopResultBuilder]: At program point L2232(line 2232) the Hoare annotation is: true [2023-11-22 22:59:20,889 INFO L902 garLoopResultBuilder]: At program point L2230(line 2230) the Hoare annotation is: true [2023-11-22 22:59:20,889 INFO L899 garLoopResultBuilder]: For program point L2232-1(line 2232) no Hoare annotation was computed. [2023-11-22 22:59:20,889 INFO L899 garLoopResultBuilder]: For program point ibmpex_bmc_deleteEXIT(lines 2197 2237) no Hoare annotation was computed. [2023-11-22 22:59:20,889 INFO L899 garLoopResultBuilder]: For program point L2230-1(line 2230) no Hoare annotation was computed. [2023-11-22 22:59:20,889 INFO L899 garLoopResultBuilder]: For program point L2224(lines 2201 2236) no Hoare annotation was computed. [2023-11-22 22:59:20,889 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2197 2237) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-22 22:59:20,890 INFO L899 garLoopResultBuilder]: For program point L2216(lines 2201 2236) no Hoare annotation was computed. [2023-11-22 22:59:20,890 INFO L902 garLoopResultBuilder]: At program point L2214(line 2214) the Hoare annotation is: true [2023-11-22 22:59:20,890 INFO L899 garLoopResultBuilder]: For program point $Ultimate##4(lines 2219 2222) no Hoare annotation was computed. [2023-11-22 22:59:20,890 INFO L899 garLoopResultBuilder]: For program point L2214-1(line 2214) no Hoare annotation was computed. [2023-11-22 22:59:20,890 INFO L899 garLoopResultBuilder]: For program point L2210(lines 2210 2213) no Hoare annotation was computed. [2023-11-22 22:59:20,890 INFO L895 garLoopResultBuilder]: At program point L2202(line 2202) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-22 22:59:20,890 INFO L899 garLoopResultBuilder]: For program point L2233-1(line 2233) no Hoare annotation was computed. [2023-11-22 22:59:20,890 INFO L899 garLoopResultBuilder]: For program point L2202-1(line 2202) no Hoare annotation was computed. [2023-11-22 22:59:20,890 INFO L902 garLoopResultBuilder]: At program point L2233(line 2233) the Hoare annotation is: true [2023-11-22 22:59:20,890 INFO L899 garLoopResultBuilder]: For program point L2231-1(line 2231) no Hoare annotation was computed. [2023-11-22 22:59:20,891 INFO L902 garLoopResultBuilder]: At program point L2231(line 2231) the Hoare annotation is: true [2023-11-22 22:59:20,891 INFO L899 garLoopResultBuilder]: For program point L2225(lines 2225 2228) no Hoare annotation was computed. [2023-11-22 22:59:20,891 INFO L899 garLoopResultBuilder]: For program point ibmpex_bmc_deleteFINAL(lines 2197 2237) no Hoare annotation was computed. [2023-11-22 22:59:20,891 INFO L899 garLoopResultBuilder]: For program point L2215-1(line 2215) no Hoare annotation was computed. [2023-11-22 22:59:20,891 INFO L902 garLoopResultBuilder]: At program point L2215(line 2215) the Hoare annotation is: true [2023-11-22 22:59:20,891 INFO L899 garLoopResultBuilder]: For program point ldv_handler_precallEXIT(lines 2578 2580) no Hoare annotation was computed. [2023-11-22 22:59:20,891 INFO L902 garLoopResultBuilder]: At program point ldv_handler_precallFINAL(lines 2578 2580) the Hoare annotation is: true [2023-11-22 22:59:20,891 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 2424 2429) no Hoare annotation was computed. [2023-11-22 22:59:20,891 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2424 2429) the Hoare annotation is: true [2023-11-22 22:59:20,892 INFO L899 garLoopResultBuilder]: For program point ipmi_free_recv_msgEXIT(lines 2556 2558) no Hoare annotation was computed. [2023-11-22 22:59:20,892 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2556 2558) the Hoare annotation is: true [2023-11-22 22:59:20,892 INFO L899 garLoopResultBuilder]: For program point L1630(line 1630) no Hoare annotation was computed. [2023-11-22 22:59:20,892 INFO L899 garLoopResultBuilder]: For program point L1629(lines 1629 1631) no Hoare annotation was computed. [2023-11-22 22:59:20,892 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1634 1643) no Hoare annotation was computed. [2023-11-22 22:59:20,892 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1634 1643) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-22 22:59:20,892 INFO L902 garLoopResultBuilder]: At program point L1638(line 1638) the Hoare annotation is: true [2023-11-22 22:59:20,892 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1634 1643) no Hoare annotation was computed. [2023-11-22 22:59:20,892 INFO L899 garLoopResultBuilder]: For program point L1638-1(line 1638) no Hoare annotation was computed. [2023-11-22 22:59:20,893 INFO L899 garLoopResultBuilder]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2023-11-22 22:59:20,893 INFO L899 garLoopResultBuilder]: For program point ibmpex_send_messageEXIT(lines 1695 1719) no Hoare annotation was computed. [2023-11-22 22:59:20,893 INFO L899 garLoopResultBuilder]: For program point ibmpex_send_messageFINAL(lines 1695 1719) no Hoare annotation was computed. [2023-11-22 22:59:20,893 INFO L895 garLoopResultBuilder]: At program point L1716(line 1716) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse2 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (and (or .cse0 (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse1) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0))) (or .cse0 .cse3 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-22 22:59:20,893 INFO L899 garLoopResultBuilder]: For program point L1716-1(line 1716) no Hoare annotation was computed. [2023-11-22 22:59:20,893 INFO L902 garLoopResultBuilder]: At program point L1713(line 1713) the Hoare annotation is: true [2023-11-22 22:59:20,893 INFO L899 garLoopResultBuilder]: For program point L1713-1(line 1713) no Hoare annotation was computed. [2023-11-22 22:59:20,893 INFO L899 garLoopResultBuilder]: For program point L1707(lines 1707 1710) no Hoare annotation was computed. [2023-11-22 22:59:20,894 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1695 1719) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse2 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (and (or .cse0 (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse1) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0))) (or .cse0 .cse3 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-22 22:59:20,894 INFO L899 garLoopResultBuilder]: For program point L1700(lines 1700 1703) no Hoare annotation was computed. [2023-11-22 22:59:20,894 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2539 2541) the Hoare annotation is: true [2023-11-22 22:59:20,894 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 2539 2541) no Hoare annotation was computed. [2023-11-22 22:59:20,894 INFO L899 garLoopResultBuilder]: For program point ibmpex_query_sensor_name_returnLabel#1(lines 1755 1769) no Hoare annotation was computed. [2023-11-22 22:59:20,894 INFO L899 garLoopResultBuilder]: For program point L2282(line 2282) no Hoare annotation was computed. [2023-11-22 22:59:20,894 INFO L899 garLoopResultBuilder]: For program point L2249-1(lines 2238 2252) no Hoare annotation was computed. [2023-11-22 22:59:20,894 INFO L895 garLoopResultBuilder]: At program point L2249(line 2249) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,894 INFO L899 garLoopResultBuilder]: For program point L2084(lines 2084 2087) no Hoare annotation was computed. [2023-11-22 22:59:20,895 INFO L899 garLoopResultBuilder]: For program point L1985(lines 1985 1988) no Hoare annotation was computed. [2023-11-22 22:59:20,895 INFO L899 garLoopResultBuilder]: For program point ibmpex_find_sensors_returnLabel#1(lines 2012 2130) no Hoare annotation was computed. [2023-11-22 22:59:20,895 INFO L899 garLoopResultBuilder]: For program point L1920(lines 1920 1923) no Hoare annotation was computed. [2023-11-22 22:59:20,895 INFO L899 garLoopResultBuilder]: For program point L2350(line 2350) no Hoare annotation was computed. [2023-11-22 22:59:20,895 INFO L899 garLoopResultBuilder]: For program point L2383-1(line 2383) no Hoare annotation was computed. [2023-11-22 22:59:20,895 INFO L895 garLoopResultBuilder]: At program point L2383(line 2383) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,895 INFO L899 garLoopResultBuilder]: For program point L1954(lines 1954 1957) no Hoare annotation was computed. [2023-11-22 22:59:20,895 INFO L899 garLoopResultBuilder]: For program point L2351-1(line 2351) no Hoare annotation was computed. [2023-11-22 22:59:20,895 INFO L895 garLoopResultBuilder]: At program point L2351(line 2351) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,895 INFO L899 garLoopResultBuilder]: For program point L2153(lines 2153 2158) no Hoare annotation was computed. [2023-11-22 22:59:20,896 INFO L899 garLoopResultBuilder]: For program point L1856(lines 1856 1859) no Hoare annotation was computed. [2023-11-22 22:59:20,896 INFO L895 garLoopResultBuilder]: At program point L2154(lines 2154 2155) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,896 INFO L899 garLoopResultBuilder]: For program point L2154-1(lines 2154 2155) no Hoare annotation was computed. [2023-11-22 22:59:20,896 INFO L899 garLoopResultBuilder]: For program point L1989(lines 1989 1995) no Hoare annotation was computed. [2023-11-22 22:59:20,896 INFO L899 garLoopResultBuilder]: For program point L2122(lines 2024 2129) no Hoare annotation was computed. [2023-11-22 22:59:20,896 INFO L899 garLoopResultBuilder]: For program point L2089(lines 2089 2092) no Hoare annotation was computed. [2023-11-22 22:59:20,896 INFO L895 garLoopResultBuilder]: At program point L1726(line 1726) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,896 INFO L899 garLoopResultBuilder]: For program point L1726-1(line 1726) no Hoare annotation was computed. [2023-11-22 22:59:20,897 INFO L899 garLoopResultBuilder]: For program point L2354(line 2354) no Hoare annotation was computed. [2023-11-22 22:59:20,897 INFO L899 garLoopResultBuilder]: For program point L2189-1(line 2189) no Hoare annotation was computed. [2023-11-22 22:59:20,897 INFO L895 garLoopResultBuilder]: At program point L2189(line 2189) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,897 INFO L899 garLoopResultBuilder]: For program point L2123(lines 2123 2126) no Hoare annotation was computed. [2023-11-22 22:59:20,897 INFO L899 garLoopResultBuilder]: For program point L2057(lines 2057 2064) no Hoare annotation was computed. [2023-11-22 22:59:20,897 INFO L899 garLoopResultBuilder]: For program point L2057-1(lines 2048 2065) no Hoare annotation was computed. [2023-11-22 22:59:20,897 INFO L899 garLoopResultBuilder]: For program point L1925(lines 1925 1928) no Hoare annotation was computed. [2023-11-22 22:59:20,897 INFO L895 garLoopResultBuilder]: At program point L1727(line 1727) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,898 INFO L899 garLoopResultBuilder]: For program point L1727-1(line 1727) no Hoare annotation was computed. [2023-11-22 22:59:20,898 INFO L899 garLoopResultBuilder]: For program point L2355-1(line 2355) no Hoare annotation was computed. [2023-11-22 22:59:20,898 INFO L895 garLoopResultBuilder]: At program point L2355(line 2355) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,898 INFO L899 garLoopResultBuilder]: For program point L2190(lines 2138 2195) no Hoare annotation was computed. [2023-11-22 22:59:20,898 INFO L899 garLoopResultBuilder]: For program point L1992(lines 1992 1995) no Hoare annotation was computed. [2023-11-22 22:59:20,898 INFO L899 garLoopResultBuilder]: For program point L1992-2(lines 1989 1995) no Hoare annotation was computed. [2023-11-22 22:59:20,898 INFO L895 garLoopResultBuilder]: At program point L1761(line 1761) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,898 INFO L899 garLoopResultBuilder]: For program point L1728(line 1728) no Hoare annotation was computed. [2023-11-22 22:59:20,898 INFO L899 garLoopResultBuilder]: For program point L1761-1(line 1761) no Hoare annotation was computed. [2023-11-22 22:59:20,898 INFO L899 garLoopResultBuilder]: For program point L1728-2(lines 1728 1731) no Hoare annotation was computed. [2023-11-22 22:59:20,899 INFO L899 garLoopResultBuilder]: For program point L2191-1(line 2191) no Hoare annotation was computed. [2023-11-22 22:59:20,899 INFO L895 garLoopResultBuilder]: At program point L2191(line 2191) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,899 INFO L895 garLoopResultBuilder]: At program point L1762(line 1762) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,899 INFO L899 garLoopResultBuilder]: For program point L1762-1(line 1762) no Hoare annotation was computed. [2023-11-22 22:59:20,899 INFO L899 garLoopResultBuilder]: For program point L2489-1(lines 2489 2497) no Hoare annotation was computed. [2023-11-22 22:59:20,899 INFO L899 garLoopResultBuilder]: For program point L2489(lines 2489 2497) no Hoare annotation was computed. [2023-11-22 22:59:20,899 INFO L895 garLoopResultBuilder]: At program point L2192(lines 2138 2195) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,899 INFO L899 garLoopResultBuilder]: For program point L1763(line 1763) no Hoare annotation was computed. [2023-11-22 22:59:20,900 INFO L899 garLoopResultBuilder]: For program point L1763-2(lines 1763 1766) no Hoare annotation was computed. [2023-11-22 22:59:20,900 INFO L899 garLoopResultBuilder]: For program point L2358(line 2358) no Hoare annotation was computed. [2023-11-22 22:59:20,900 INFO L899 garLoopResultBuilder]: For program point L2193(line 2193) no Hoare annotation was computed. [2023-11-22 22:59:20,900 INFO L899 garLoopResultBuilder]: For program point L2094(lines 2094 2097) no Hoare annotation was computed. [2023-11-22 22:59:20,900 INFO L899 garLoopResultBuilder]: For program point L2127-1(line 2127) no Hoare annotation was computed. [2023-11-22 22:59:20,900 INFO L895 garLoopResultBuilder]: At program point L2127(line 2127) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,900 INFO L899 garLoopResultBuilder]: For program point L2028(lines 2028 2031) no Hoare annotation was computed. [2023-11-22 22:59:20,900 INFO L899 garLoopResultBuilder]: For program point L2359-1(line 2359) no Hoare annotation was computed. [2023-11-22 22:59:20,900 INFO L895 garLoopResultBuilder]: At program point L2359(line 2359) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,901 INFO L899 garLoopResultBuilder]: For program point L1963(lines 1963 1966) no Hoare annotation was computed. [2023-11-22 22:59:20,901 INFO L899 garLoopResultBuilder]: For program point L2492(lines 2492 2495) no Hoare annotation was computed. [2023-11-22 22:59:20,901 INFO L899 garLoopResultBuilder]: For program point L2261(lines 2261 2267) no Hoare annotation was computed. [2023-11-22 22:59:20,901 INFO L895 garLoopResultBuilder]: At program point L2262(lines 2262 2263) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,901 INFO L899 garLoopResultBuilder]: For program point L2262-1(lines 2262 2263) no Hoare annotation was computed. [2023-11-22 22:59:20,901 INFO L895 garLoopResultBuilder]: At program point L1734(line 1734) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,901 INFO L899 garLoopResultBuilder]: For program point L1734-1(line 1734) no Hoare annotation was computed. [2023-11-22 22:59:20,901 INFO L895 garLoopResultBuilder]: At program point L2494(line 2494) the Hoare annotation is: false [2023-11-22 22:59:20,901 INFO L899 garLoopResultBuilder]: For program point ibmpex_register_bmc_returnLabel#1(lines 2131 2196) no Hoare annotation was computed. [2023-11-22 22:59:20,902 INFO L899 garLoopResultBuilder]: For program point L2362(line 2362) no Hoare annotation was computed. [2023-11-22 22:59:20,902 INFO L895 garLoopResultBuilder]: At program point L2264(line 2264) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,902 INFO L899 garLoopResultBuilder]: For program point L2264-1(lines 2254 2286) no Hoare annotation was computed. [2023-11-22 22:59:20,902 INFO L895 garLoopResultBuilder]: At program point L2033(line 2033) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,902 INFO L899 garLoopResultBuilder]: For program point L2033-1(line 2033) no Hoare annotation was computed. [2023-11-22 22:59:20,902 INFO L899 garLoopResultBuilder]: For program point L2166(lines 2166 2169) no Hoare annotation was computed. [2023-11-22 22:59:20,902 INFO L895 garLoopResultBuilder]: At program point L2100(line 2100) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,902 INFO L899 garLoopResultBuilder]: For program point L2100-1(line 2100) no Hoare annotation was computed. [2023-11-22 22:59:20,902 INFO L899 garLoopResultBuilder]: For program point L2365(lines 2337 2377) no Hoare annotation was computed. [2023-11-22 22:59:20,903 INFO L899 garLoopResultBuilder]: For program point L2101-1(line 2101) no Hoare annotation was computed. [2023-11-22 22:59:20,903 INFO L895 garLoopResultBuilder]: At program point L2101(line 2101) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,903 INFO L899 garLoopResultBuilder]: For program point L2035(lines 2035 2038) no Hoare annotation was computed. [2023-11-22 22:59:20,903 INFO L899 garLoopResultBuilder]: For program point L1936(lines 1936 1939) no Hoare annotation was computed. [2023-11-22 22:59:20,903 INFO L899 garLoopResultBuilder]: For program point L2399-1(line 2399) no Hoare annotation was computed. [2023-11-22 22:59:20,903 INFO L895 garLoopResultBuilder]: At program point L2399(line 2399) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,903 INFO L899 garLoopResultBuilder]: For program point $Ultimate##93(lines 1864 1867) no Hoare annotation was computed. [2023-11-22 22:59:20,903 INFO L899 garLoopResultBuilder]: For program point is_power_sensor_returnLabel#1(lines 1916 1931) no Hoare annotation was computed. [2023-11-22 22:59:20,903 INFO L899 garLoopResultBuilder]: For program point L2003(lines 2003 2008) no Hoare annotation was computed. [2023-11-22 22:59:20,904 INFO L899 garLoopResultBuilder]: For program point $Ultimate##83(lines 2117 2120) no Hoare annotation was computed. [2023-11-22 22:59:20,904 INFO L899 garLoopResultBuilder]: For program point get_bmc_data_returnLabel#1(lines 1842 1870) no Hoare annotation was computed. [2023-11-22 22:59:20,904 INFO L899 garLoopResultBuilder]: For program point L2368(lines 2368 2371) no Hoare annotation was computed. [2023-11-22 22:59:20,904 INFO L899 garLoopResultBuilder]: For program point L2269(lines 2269 2273) no Hoare annotation was computed. [2023-11-22 22:59:20,904 INFO L902 garLoopResultBuilder]: At program point ibmpex_exit_ldv_17748#1(lines 2302 2320) the Hoare annotation is: true [2023-11-22 22:59:20,904 INFO L899 garLoopResultBuilder]: For program point L2269-2(lines 2269 2273) no Hoare annotation was computed. [2023-11-22 22:59:20,904 INFO L899 garLoopResultBuilder]: For program point L2071(lines 2071 2074) no Hoare annotation was computed. [2023-11-22 22:59:20,904 INFO L895 garLoopResultBuilder]: At program point L2005(line 2005) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0) .cse1) (and .cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse1))) [2023-11-22 22:59:20,904 INFO L899 garLoopResultBuilder]: For program point L2005-1(line 2005) no Hoare annotation was computed. [2023-11-22 22:59:20,905 INFO L899 garLoopResultBuilder]: For program point create_sensor_returnLabel#1(lines 1976 2011) no Hoare annotation was computed. [2023-11-22 22:59:20,905 INFO L899 garLoopResultBuilder]: For program point $Ultimate##73(lines 2077 2080) no Hoare annotation was computed. [2023-11-22 22:59:20,905 INFO L899 garLoopResultBuilder]: For program point ibmpex_find_sensors_exit_remove#1(lines 2024 2129) no Hoare annotation was computed. [2023-11-22 22:59:20,905 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-22 22:59:20,905 INFO L899 garLoopResultBuilder]: For program point L2172(lines 2172 2177) no Hoare annotation was computed. [2023-11-22 22:59:20,905 INFO L899 garLoopResultBuilder]: For program point L2139-1(line 2139) no Hoare annotation was computed. [2023-11-22 22:59:20,905 INFO L895 garLoopResultBuilder]: At program point L2139(line 2139) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,905 INFO L899 garLoopResultBuilder]: For program point L1941(lines 1941 1944) no Hoare annotation was computed. [2023-11-22 22:59:20,905 INFO L899 garLoopResultBuilder]: For program point L2173-1(lines 2173 2174) no Hoare annotation was computed. [2023-11-22 22:59:20,906 INFO L895 garLoopResultBuilder]: At program point L2173(lines 2173 2174) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,906 INFO L902 garLoopResultBuilder]: At program point L2372(line 2372) the Hoare annotation is: true [2023-11-22 22:59:20,906 INFO L899 garLoopResultBuilder]: For program point $Ultimate##45(lines 1969 1972) no Hoare annotation was computed. [2023-11-22 22:59:20,906 INFO L899 garLoopResultBuilder]: For program point L2372-1(line 2372) no Hoare annotation was computed. [2023-11-22 22:59:20,906 INFO L899 garLoopResultBuilder]: For program point L2108(lines 2108 2111) no Hoare annotation was computed. [2023-11-22 22:59:20,906 INFO L899 garLoopResultBuilder]: For program point L2141(lines 2141 2145) no Hoare annotation was computed. [2023-11-22 22:59:20,906 INFO L899 garLoopResultBuilder]: For program point ibmpex_ver_check_returnLabel#1(lines 1720 1740) no Hoare annotation was computed. [2023-11-22 22:59:20,906 INFO L899 garLoopResultBuilder]: For program point is_temp_sensor_returnLabel#1(lines 1932 1947) no Hoare annotation was computed. [2023-11-22 22:59:20,906 INFO L895 garLoopResultBuilder]: At program point L2340(line 2340) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0) (= ~ldv_count_2~0 0)) [2023-11-22 22:59:20,906 INFO L899 garLoopResultBuilder]: For program point L2274(lines 2274 2281) no Hoare annotation was computed. [2023-11-22 22:59:20,907 INFO L899 garLoopResultBuilder]: For program point L2340-1(line 2340) no Hoare annotation was computed. [2023-11-22 22:59:20,907 INFO L895 garLoopResultBuilder]: At program point L2274-2(lines 2274 2281) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,907 INFO L895 garLoopResultBuilder]: At program point L2142(line 2142) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,907 INFO L899 garLoopResultBuilder]: For program point L2142-1(line 2142) no Hoare annotation was computed. [2023-11-22 22:59:20,907 INFO L899 garLoopResultBuilder]: For program point L2043(lines 2043 2046) no Hoare annotation was computed. [2023-11-22 22:59:20,907 INFO L899 garLoopResultBuilder]: For program point power_sensor_multiplier_returnLabel#1(lines 1948 1975) no Hoare annotation was computed. [2023-11-22 22:59:20,907 INFO L895 garLoopResultBuilder]: At program point L1746(line 1746) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,907 INFO L899 garLoopResultBuilder]: For program point L1746-1(line 1746) no Hoare annotation was computed. [2023-11-22 22:59:20,907 INFO L899 garLoopResultBuilder]: For program point L2407-1(line 2407) no Hoare annotation was computed. [2023-11-22 22:59:20,908 INFO L899 garLoopResultBuilder]: For program point L2374(lines 2337 2377) no Hoare annotation was computed. [2023-11-22 22:59:20,908 INFO L895 garLoopResultBuilder]: At program point L2407(line 2407) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,908 INFO L895 garLoopResultBuilder]: At program point L1747(line 1747) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,908 INFO L899 garLoopResultBuilder]: For program point L1747-1(line 1747) no Hoare annotation was computed. [2023-11-22 22:59:20,908 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-22 22:59:20,908 INFO L899 garLoopResultBuilder]: For program point L2342(lines 2342 2345) no Hoare annotation was computed. [2023-11-22 22:59:20,908 INFO L899 garLoopResultBuilder]: For program point L1748(line 1748) no Hoare annotation was computed. [2023-11-22 22:59:20,908 INFO L899 garLoopResultBuilder]: For program point L1748-2(lines 1748 1751) no Hoare annotation was computed. [2023-11-22 22:59:20,908 INFO L899 garLoopResultBuilder]: For program point L2310(line 2310) no Hoare annotation was computed. [2023-11-22 22:59:20,909 INFO L895 garLoopResultBuilder]: At program point L2178(line 2178) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,909 INFO L895 garLoopResultBuilder]: At program point L2112(line 2112) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2023-11-22 22:59:20,909 INFO L899 garLoopResultBuilder]: For program point L2178-1(line 2178) no Hoare annotation was computed. [2023-11-22 22:59:20,909 INFO L899 garLoopResultBuilder]: For program point L2112-1(line 2112) no Hoare annotation was computed. [2023-11-22 22:59:20,909 INFO L899 garLoopResultBuilder]: For program point L2245(lines 2245 2248) no Hoare annotation was computed. [2023-11-22 22:59:20,909 INFO L899 garLoopResultBuilder]: For program point L2113-1(line 2113) no Hoare annotation was computed. [2023-11-22 22:59:20,909 INFO L895 garLoopResultBuilder]: At program point L2113(line 2113) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2023-11-22 22:59:20,909 INFO L895 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,910 INFO L895 garLoopResultBuilder]: At program point L-1-4(line -1) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,910 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2023-11-22 22:59:20,910 INFO L895 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,910 INFO L899 garLoopResultBuilder]: For program point L2114(lines 2024 2129) no Hoare annotation was computed. [2023-11-22 22:59:20,910 INFO L899 garLoopResultBuilder]: For program point L2081(lines 2024 2129) no Hoare annotation was computed. [2023-11-22 22:59:20,910 INFO L899 garLoopResultBuilder]: For program point L2048(lines 2048 2065) no Hoare annotation was computed. [2023-11-22 22:59:20,910 INFO L899 garLoopResultBuilder]: For program point ibmpex_query_sensor_count_returnLabel#1(lines 1741 1754) no Hoare annotation was computed. [2023-11-22 22:59:20,910 INFO L899 garLoopResultBuilder]: For program point L2181(lines 2181 2186) no Hoare annotation was computed. [2023-11-22 22:59:20,910 INFO L895 garLoopResultBuilder]: At program point L1983(line 1983) the Hoare annotation is: (let ((.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse4 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 .cse4 (= ~ldv_count_2~0 0)) (and .cse0 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 1) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)))) [2023-11-22 22:59:20,911 INFO L899 garLoopResultBuilder]: For program point $Ultimate##117(lines 2315 2318) no Hoare annotation was computed. [2023-11-22 22:59:20,911 INFO L899 garLoopResultBuilder]: For program point L1983-1(line 1983) no Hoare annotation was computed. [2023-11-22 22:59:20,911 INFO L895 garLoopResultBuilder]: At program point L2182(lines 2182 2183) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-22 22:59:20,911 INFO L899 garLoopResultBuilder]: For program point L2182-1(lines 2182 2183) no Hoare annotation was computed. [2023-11-22 22:59:20,911 INFO L899 garLoopResultBuilder]: For program point L2083(lines 2024 2129) no Hoare annotation was computed. [2023-11-22 22:59:20,911 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 2536 2538) no Hoare annotation was computed. [2023-11-22 22:59:20,911 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2536 2538) the Hoare annotation is: true [2023-11-22 22:59:20,914 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:59:20,915 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 22:59:20,927 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-22 22:59:20,927 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-22 22:59:20,927 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-22 22:59:20,928 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-22 22:59:20,928 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-22 22:59:20,928 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-22 22:59:20,928 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-22 22:59:20,928 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-22 22:59:20,928 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-22 22:59:20,928 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-22 22:59:20,929 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-22 22:59:20,929 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-22 22:59:20,929 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-22 22:59:20,929 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-22 22:59:20,929 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-22 22:59:20,929 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-22 22:59:20,929 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-22 22:59:20,930 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-22 22:59:20,930 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-22 22:59:20,930 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-22 22:59:20,930 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-22 22:59:20,930 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-22 22:59:20,930 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-22 22:59:20,930 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-22 22:59:20,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:59:20 BoogieIcfgContainer [2023-11-22 22:59:20,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 22:59:20,931 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 22:59:20,931 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 22:59:20,932 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 22:59:20,932 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:58:31" (3/4) ... [2023-11-22 22:59:20,934 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-22 22:59:20,936 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2023-11-22 22:59:20,936 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_destroy_user [2023-11-22 22:59:20,936 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-22 22:59:20,936 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2023-11-22 22:59:20,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure wait_for_completion [2023-11-22 22:59:20,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2023-11-22 22:59:20,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2023-11-22 22:59:20,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2023-11-22 22:59:20,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_free_recv_msg [2023-11-22 22:59:20,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-11-22 22:59:20,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_send_message [2023-11-22 22:59:20,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2023-11-22 22:59:20,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2023-11-22 22:59:20,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2023-11-22 22:59:20,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2023-11-22 22:59:20,938 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure extract_value [2023-11-22 22:59:20,938 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_bmc_delete [2023-11-22 22:59:20,938 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2023-11-22 22:59:20,957 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 167 nodes and edges [2023-11-22 22:59:20,959 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2023-11-22 22:59:20,960 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-11-22 22:59:20,961 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-22 22:59:20,962 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-22 22:59:20,963 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-22 22:59:21,092 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 22:59:21,093 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-22 22:59:21,093 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 22:59:21,094 INFO L158 Benchmark]: Toolchain (without parser) took 51487.07ms. Allocated memory was 123.7MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 49.9MB in the beginning and 466.2MB in the end (delta: -416.3MB). Peak memory consumption was 737.8MB. Max. memory is 16.1GB. [2023-11-22 22:59:21,094 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 123.7MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 22:59:21,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 718.81ms. Allocated memory was 123.7MB in the beginning and 157.3MB in the end (delta: 33.6MB). Free memory was 49.6MB in the beginning and 82.7MB in the end (delta: -33.1MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2023-11-22 22:59:21,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.81ms. Allocated memory is still 157.3MB. Free memory was 82.7MB in the beginning and 74.4MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-22 22:59:21,094 INFO L158 Benchmark]: Boogie Preprocessor took 101.54ms. Allocated memory is still 157.3MB. Free memory was 74.4MB in the beginning and 65.8MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-22 22:59:21,095 INFO L158 Benchmark]: RCFGBuilder took 1130.33ms. Allocated memory is still 157.3MB. Free memory was 65.8MB in the beginning and 93.3MB in the end (delta: -27.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-22 22:59:21,095 INFO L158 Benchmark]: TraceAbstraction took 49274.81ms. Allocated memory was 157.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 92.3MB in the beginning and 488.2MB in the end (delta: -396.0MB). Peak memory consumption was 757.5MB. Max. memory is 16.1GB. [2023-11-22 22:59:21,095 INFO L158 Benchmark]: Witness Printer took 161.58ms. Allocated memory is still 1.3GB. Free memory was 487.2MB in the beginning and 466.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-22 22:59:21,096 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 123.7MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 718.81ms. Allocated memory was 123.7MB in the beginning and 157.3MB in the end (delta: 33.6MB). Free memory was 49.6MB in the beginning and 82.7MB in the end (delta: -33.1MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.81ms. Allocated memory is still 157.3MB. Free memory was 82.7MB in the beginning and 74.4MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.54ms. Allocated memory is still 157.3MB. Free memory was 74.4MB in the beginning and 65.8MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1130.33ms. Allocated memory is still 157.3MB. Free memory was 65.8MB in the beginning and 93.3MB in the end (delta: -27.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 49274.81ms. Allocated memory was 157.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 92.3MB in the beginning and 488.2MB in the end (delta: -396.0MB). Peak memory consumption was 757.5MB. Max. memory is 16.1GB. * Witness Printer took 161.58ms. Allocated memory is still 1.3GB. Free memory was 487.2MB in the beginning and 466.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2415]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 239 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.2s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 22.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6340 SdHoareTripleChecker+Valid, 17.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5801 mSDsluCounter, 14934 SdHoareTripleChecker+Invalid, 15.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9962 mSDsCounter, 2831 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10989 IncrementalHoareTripleChecker+Invalid, 13820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2831 mSolverCounterUnsat, 4972 mSDtfsCounter, 10989 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1171 GetRequests, 1067 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1316occurred in iteration=12, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 4772 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 74 LocationsWithAnnotation, 3384 PreInvPairs, 3669 NumberOfFragments, 2236 HoareAnnotationTreeSize, 3384 FomulaSimplifications, 32470946 FormulaSimplificationTreeSizeReduction, 17.9s HoareSimplificationTime, 74 FomulaSimplificationsInter, 125742 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2521 NumberOfCodeBlocks, 2521 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2654 ConstructedInterpolants, 0 QuantifiedInterpolants, 4624 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2958 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 1331/1335 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1695]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: ((((((6 <= ldv_count_1) && (ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && (ldv_count_2 == 0)) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute)) && ((5 + ldv_count_2) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && ((ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 2302]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-22 22:59:21,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE