./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 20:53:27,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 20:53:27,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-22 20:53:27,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 20:53:27,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 20:53:27,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 20:53:27,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 20:53:27,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 20:53:27,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 20:53:27,307 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 20:53:27,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 20:53:27,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 20:53:27,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 20:53:27,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 20:53:27,309 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 20:53:27,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 20:53:27,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 20:53:27,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 20:53:27,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 20:53:27,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 20:53:27,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 20:53:27,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 20:53:27,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 20:53:27,312 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 20:53:27,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 20:53:27,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 20:53:27,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 20:53:27,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 20:53:27,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 20:53:27,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 20:53:27,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 20:53:27,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 20:53:27,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 20:53:27,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 20:53:27,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 20:53:27,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 20:53:27,315 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 20:53:27,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 20:53:27,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 20:53:27,316 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 20:53:27,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 20:53:27,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 20:53:27,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 20:53:27,531 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 20:53:27,532 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 20:53:27,533 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 20:53:28,456 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 20:53:28,736 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 20:53:28,737 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 20:53:28,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6685b8a/988411ba3d3e4f378a6b64aa45e2d58d/FLAGcadef5780 [2023-11-22 20:53:28,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6685b8a/988411ba3d3e4f378a6b64aa45e2d58d [2023-11-22 20:53:28,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 20:53:28,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 20:53:28,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 20:53:28,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 20:53:28,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 20:53:28,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:53:28" (1/1) ... [2023-11-22 20:53:28,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c757d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:28, skipping insertion in model container [2023-11-22 20:53:28,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:53:28" (1/1) ... [2023-11-22 20:53:28,847 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 20:53:29,241 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 20:53:29,266 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 20:53:29,289 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 20:53:29,409 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 20:53:29,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 20:53:29,438 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 20:53:29,438 WARN L675 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 20:53:29,443 INFO L206 MainTranslator]: Completed translation [2023-11-22 20:53:29,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:29 WrapperNode [2023-11-22 20:53:29,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 20:53:29,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 20:53:29,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 20:53:29,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 20:53:29,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:29" (1/1) ... [2023-11-22 20:53:29,480 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:29" (1/1) ... [2023-11-22 20:53:29,542 INFO L138 Inliner]: procedures = 102, calls = 434, calls flagged for inlining = 49, calls inlined = 44, statements flattened = 1146 [2023-11-22 20:53:29,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 20:53:29,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 20:53:29,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 20:53:29,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 20:53:29,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:29" (1/1) ... [2023-11-22 20:53:29,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:29" (1/1) ... [2023-11-22 20:53:29,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:29" (1/1) ... [2023-11-22 20:53:29,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:29" (1/1) ... [2023-11-22 20:53:29,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:29" (1/1) ... [2023-11-22 20:53:29,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:29" (1/1) ... [2023-11-22 20:53:29,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:29" (1/1) ... [2023-11-22 20:53:29,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:29" (1/1) ... [2023-11-22 20:53:29,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 20:53:29,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 20:53:29,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 20:53:29,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 20:53:29,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:29" (1/1) ... [2023-11-22 20:53:29,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 20:53:29,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:53:29,653 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 20:53:29,676 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 20:53:29,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-22 20:53:29,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-22 20:53:29,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-22 20:53:29,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 20:53:29,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-22 20:53:29,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-22 20:53:29,698 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-22 20:53:29,698 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-22 20:53:29,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 20:53:29,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-22 20:53:29,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-22 20:53:29,700 INFO L130 BoogieDeclarations]: Found specification of procedure extract_value [2023-11-22 20:53:29,700 INFO L138 BoogieDeclarations]: Found implementation of procedure extract_value [2023-11-22 20:53:29,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 20:53:29,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 20:53:29,701 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2023-11-22 20:53:29,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2023-11-22 20:53:29,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-22 20:53:29,701 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2023-11-22 20:53:29,701 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2023-11-22 20:53:29,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 20:53:29,702 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-22 20:53:29,702 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-22 20:53:29,702 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_bmc_delete [2023-11-22 20:53:29,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_bmc_delete [2023-11-22 20:53:29,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-22 20:53:29,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-22 20:53:29,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-22 20:53:29,703 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_send_message [2023-11-22 20:53:29,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_send_message [2023-11-22 20:53:29,704 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2023-11-22 20:53:29,704 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2023-11-22 20:53:29,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 20:53:29,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-22 20:53:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-22 20:53:29,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-22 20:53:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2023-11-22 20:53:29,705 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2023-11-22 20:53:29,706 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2023-11-22 20:53:29,706 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2023-11-22 20:53:29,706 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-11-22 20:53:29,706 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-11-22 20:53:29,706 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2023-11-22 20:53:29,706 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2023-11-22 20:53:29,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 20:53:29,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2023-11-22 20:53:29,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2023-11-22 20:53:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2023-11-22 20:53:29,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2023-11-22 20:53:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-22 20:53:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2023-11-22 20:53:29,707 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2023-11-22 20:53:29,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 20:53:29,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 20:53:29,922 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 20:53:29,924 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 20:53:30,655 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 20:53:30,781 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 20:53:30,781 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-22 20:53:30,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:53:30 BoogieIcfgContainer [2023-11-22 20:53:30,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 20:53:30,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 20:53:30,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 20:53:30,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 20:53:30,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:53:28" (1/3) ... [2023-11-22 20:53:30,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166d41e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:53:30, skipping insertion in model container [2023-11-22 20:53:30,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:53:29" (2/3) ... [2023-11-22 20:53:30,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166d41e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:53:30, skipping insertion in model container [2023-11-22 20:53:30,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:53:30" (3/3) ... [2023-11-22 20:53:30,789 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2023-11-22 20:53:30,803 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 20:53:30,803 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 20:53:30,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 20:53:30,843 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;@38dc5b0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 20:53:30,843 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 20:53:30,846 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 20:53:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 20:53:30,856 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:30,856 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 20:53:30,857 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:53:30,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:30,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1876682886, now seen corresponding path program 1 times [2023-11-22 20:53:30,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:30,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196484897] [2023-11-22 20:53:30,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:30,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:31,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:31,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:53:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:31,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:53:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:31,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:31,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:31,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 20:53:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:31,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 20:53:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:31,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 20:53:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:31,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 20:53:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:31,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 20:53:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-22 20:53:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:31,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 20:53:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:31,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 20:53:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:31,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:31,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:31,463 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 20:53:31,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:31,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196484897] [2023-11-22 20:53:31,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196484897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:31,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:31,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:53:31,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835924506] [2023-11-22 20:53:31,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:31,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:53:31,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:31,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:53:31,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:53:31,502 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 20:53:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:32,878 INFO L93 Difference]: Finished difference Result 552 states and 806 transitions. [2023-11-22 20:53:32,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:53:32,880 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 20:53:32,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:32,889 INFO L225 Difference]: With dead ends: 552 [2023-11-22 20:53:32,889 INFO L226 Difference]: Without dead ends: 303 [2023-11-22 20:53:32,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 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 20:53:32,894 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 197 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:32,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 972 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-22 20:53:32,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-11-22 20:53:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 233. [2023-11-22 20:53:32,940 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 20:53:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 325 transitions. [2023-11-22 20:53:32,942 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 325 transitions. Word has length 99 [2023-11-22 20:53:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:32,943 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 325 transitions. [2023-11-22 20:53:32,943 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 20:53:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 325 transitions. [2023-11-22 20:53:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-22 20:53:32,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:32,946 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 20:53:32,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 20:53:32,947 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:53:32,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash -208057355, now seen corresponding path program 1 times [2023-11-22 20:53:32,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:32,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938981638] [2023-11-22 20:53:32,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:32,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:53:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:53:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 20:53:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 20:53:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 20:53:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 20:53:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 20:53:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 20:53:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:53:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 20:53:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:33,127 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 20:53:33,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:33,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938981638] [2023-11-22 20:53:33,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938981638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:33,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:33,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 20:53:33,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860332619] [2023-11-22 20:53:33,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:33,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 20:53:33,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:33,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 20:53:33,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 20:53:33,130 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 20:53:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:33,917 INFO L93 Difference]: Finished difference Result 486 states and 684 transitions. [2023-11-22 20:53:33,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 20:53:33,924 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 20:53:33,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:33,926 INFO L225 Difference]: With dead ends: 486 [2023-11-22 20:53:33,926 INFO L226 Difference]: Without dead ends: 257 [2023-11-22 20:53:33,928 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 20:53:33,928 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 138 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:33,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 598 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-22 20:53:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-11-22 20:53:33,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 234. [2023-11-22 20:53:33,941 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 20:53:33,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 326 transitions. [2023-11-22 20:53:33,943 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 326 transitions. Word has length 105 [2023-11-22 20:53:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:33,943 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 326 transitions. [2023-11-22 20:53:33,943 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 20:53:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 326 transitions. [2023-11-22 20:53:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-22 20:53:33,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:33,946 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 20:53:33,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 20:53:33,947 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:53:33,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:33,947 INFO L85 PathProgramCache]: Analyzing trace with hash -262450253, now seen corresponding path program 1 times [2023-11-22 20:53:33,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:33,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061094327] [2023-11-22 20:53:33,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:33,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:53:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:53:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 20:53:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 20:53:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 20:53:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 20:53:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 20:53:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 20:53:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:53:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 20:53:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:34,164 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 20:53:34,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:34,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061094327] [2023-11-22 20:53:34,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061094327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:34,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:34,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:53:34,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377304372] [2023-11-22 20:53:34,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:34,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:53:34,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:34,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:53:34,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:53:34,171 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 20:53:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:35,426 INFO L93 Difference]: Finished difference Result 561 states and 802 transitions. [2023-11-22 20:53:35,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:53:35,426 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 20:53:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:35,428 INFO L225 Difference]: With dead ends: 561 [2023-11-22 20:53:35,428 INFO L226 Difference]: Without dead ends: 331 [2023-11-22 20:53:35,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 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 20:53:35,459 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 207 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:35,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1014 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-22 20:53:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-22 20:53:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 236. [2023-11-22 20:53:35,479 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 20:53:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 328 transitions. [2023-11-22 20:53:35,481 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 328 transitions. Word has length 105 [2023-11-22 20:53:35,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:35,482 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 328 transitions. [2023-11-22 20:53:35,482 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 20:53:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 328 transitions. [2023-11-22 20:53:35,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-22 20:53:35,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:35,488 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 20:53:35,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 20:53:35,489 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:53:35,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:35,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1660777781, now seen corresponding path program 1 times [2023-11-22 20:53:35,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:35,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400685053] [2023-11-22 20:53:35,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:35,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:53:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:53:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 20:53:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 20:53:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 20:53:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 20:53:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 20:53:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 20:53:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:53:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 20:53:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:35,660 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 20:53:35,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:35,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400685053] [2023-11-22 20:53:35,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400685053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:35,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:35,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 20:53:35,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560772759] [2023-11-22 20:53:35,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:35,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 20:53:35,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:35,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 20:53:35,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 20:53:35,663 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 20:53:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:36,385 INFO L93 Difference]: Finished difference Result 492 states and 690 transitions. [2023-11-22 20:53:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 20:53:36,386 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 20:53:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:36,387 INFO L225 Difference]: With dead ends: 492 [2023-11-22 20:53:36,387 INFO L226 Difference]: Without dead ends: 260 [2023-11-22 20:53:36,388 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 20:53:36,389 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 138 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:36,389 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.7s Time] [2023-11-22 20:53:36,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-22 20:53:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 237. [2023-11-22 20:53:36,399 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 20:53:36,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 329 transitions. [2023-11-22 20:53:36,400 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 329 transitions. Word has length 105 [2023-11-22 20:53:36,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:36,400 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 329 transitions. [2023-11-22 20:53:36,400 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 20:53:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 329 transitions. [2023-11-22 20:53:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-22 20:53:36,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:36,402 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 20:53:36,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 20:53:36,402 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:53:36,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:36,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1151304691, now seen corresponding path program 1 times [2023-11-22 20:53:36,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:36,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140271516] [2023-11-22 20:53:36,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:53:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:53:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 20:53:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 20:53:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 20:53:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 20:53:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 20:53:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 20:53:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:53:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 20:53:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:36,726 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 20:53:36,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:36,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140271516] [2023-11-22 20:53:36,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140271516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:36,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:36,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:53:36,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325721981] [2023-11-22 20:53:36,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:36,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:53:36,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:36,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:53:36,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:53:36,729 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 20:53:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:38,167 INFO L93 Difference]: Finished difference Result 766 states and 1085 transitions. [2023-11-22 20:53:38,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 20:53:38,167 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 20:53:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:38,171 INFO L225 Difference]: With dead ends: 766 [2023-11-22 20:53:38,171 INFO L226 Difference]: Without dead ends: 762 [2023-11-22 20:53:38,171 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 20:53:38,172 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 945 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:38,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 782 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-22 20:53:38,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2023-11-22 20:53:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 693. [2023-11-22 20:53:38,215 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 20:53:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 969 transitions. [2023-11-22 20:53:38,218 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 969 transitions. Word has length 105 [2023-11-22 20:53:38,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:38,218 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 969 transitions. [2023-11-22 20:53:38,218 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 20:53:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 969 transitions. [2023-11-22 20:53:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-22 20:53:38,234 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:38,234 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 20:53:38,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 20:53:38,234 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:53:38,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:38,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1007883240, now seen corresponding path program 1 times [2023-11-22 20:53:38,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:38,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504909332] [2023-11-22 20:53:38,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:38,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:53:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:53:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 20:53:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 20:53:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 20:53:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 20:53:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 20:53:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 20:53:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:53:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 20:53:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 20:53:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,466 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 20:53:38,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:38,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504909332] [2023-11-22 20:53:38,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504909332] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:53:38,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594379874] [2023-11-22 20:53:38,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:38,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:53:38,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:53:38,468 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 20:53:38,495 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 20:53:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:38,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 20:53:38,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:53:38,880 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 20:53:38,880 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 20:53:38,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594379874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:38,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 20:53:38,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-22 20:53:38,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72461118] [2023-11-22 20:53:38,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:38,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 20:53:38,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:38,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 20:53:38,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-22 20:53:38,882 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 20:53:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:39,253 INFO L93 Difference]: Finished difference Result 1384 states and 1937 transitions. [2023-11-22 20:53:39,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 20:53:39,253 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 20:53:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:39,257 INFO L225 Difference]: With dead ends: 1384 [2023-11-22 20:53:39,257 INFO L226 Difference]: Without dead ends: 1151 [2023-11-22 20:53:39,259 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 20:53:39,262 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 20:53:39,262 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 20:53:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2023-11-22 20:53:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 921. [2023-11-22 20:53:39,334 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 20:53:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1286 transitions. [2023-11-22 20:53:39,338 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1286 transitions. Word has length 113 [2023-11-22 20:53:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:39,340 INFO L495 AbstractCegarLoop]: Abstraction has 921 states and 1286 transitions. [2023-11-22 20:53:39,340 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 20:53:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1286 transitions. [2023-11-22 20:53:39,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-22 20:53:39,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:39,344 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 20:53:39,358 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 20:53:39,560 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 20:53:39,560 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:53:39,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:39,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1607293947, now seen corresponding path program 1 times [2023-11-22 20:53:39,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:39,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166476806] [2023-11-22 20:53:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:39,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:53:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:53:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 20:53:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 20:53:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 20:53:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 20:53:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 20:53:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 20:53:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:53:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 20:53:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 20:53:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 20:53:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-22 20:53:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:39,802 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 20:53:39,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:39,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166476806] [2023-11-22 20:53:39,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166476806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:39,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:39,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:53:39,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779724435] [2023-11-22 20:53:39,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:39,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:53:39,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:39,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:53:39,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:53:39,804 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 20:53:41,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:41,097 INFO L93 Difference]: Finished difference Result 2430 states and 3513 transitions. [2023-11-22 20:53:41,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 20:53:41,097 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 20:53:41,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:41,104 INFO L225 Difference]: With dead ends: 2430 [2023-11-22 20:53:41,104 INFO L226 Difference]: Without dead ends: 1513 [2023-11-22 20:53:41,106 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 20:53:41,107 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 256 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:41,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1204 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-22 20:53:41,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2023-11-22 20:53:41,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 929. [2023-11-22 20:53:41,188 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 20:53:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1294 transitions. [2023-11-22 20:53:41,191 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1294 transitions. Word has length 150 [2023-11-22 20:53:41,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:41,192 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1294 transitions. [2023-11-22 20:53:41,192 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 20:53:41,192 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1294 transitions. [2023-11-22 20:53:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-22 20:53:41,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:41,196 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 20:53:41,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-22 20:53:41,196 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:53:41,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:41,197 INFO L85 PathProgramCache]: Analyzing trace with hash 842306183, now seen corresponding path program 1 times [2023-11-22 20:53:41,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:41,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005149145] [2023-11-22 20:53:41,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:41,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:53:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:53:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 20:53:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 20:53:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 20:53:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 20:53:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 20:53:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 20:53:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:53:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 20:53:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 20:53:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 20:53:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-22 20:53:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:41,400 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 20:53:41,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:41,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005149145] [2023-11-22 20:53:41,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005149145] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:41,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:41,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 20:53:41,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339071078] [2023-11-22 20:53:41,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:41,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 20:53:41,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:41,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 20:53:41,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 20:53:41,402 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 20:53:42,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:42,160 INFO L93 Difference]: Finished difference Result 1950 states and 2739 transitions. [2023-11-22 20:53:42,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 20:53:42,161 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 20:53:42,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:42,164 INFO L225 Difference]: With dead ends: 1950 [2023-11-22 20:53:42,164 INFO L226 Difference]: Without dead ends: 1025 [2023-11-22 20:53:42,166 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 20:53:42,167 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 138 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:42,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 597 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-22 20:53:42,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2023-11-22 20:53:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 933. [2023-11-22 20:53:42,201 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 20:53:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1298 transitions. [2023-11-22 20:53:42,204 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1298 transitions. Word has length 150 [2023-11-22 20:53:42,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:42,205 INFO L495 AbstractCegarLoop]: Abstraction has 933 states and 1298 transitions. [2023-11-22 20:53:42,205 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 20:53:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1298 transitions. [2023-11-22 20:53:42,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-22 20:53:42,206 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:42,206 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 20:53:42,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 20:53:42,207 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:53:42,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:42,207 INFO L85 PathProgramCache]: Analyzing trace with hash -529501115, now seen corresponding path program 1 times [2023-11-22 20:53:42,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:42,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697365940] [2023-11-22 20:53:42,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:42,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:53:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:53:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 20:53:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 20:53:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 20:53:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 20:53:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 20:53:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 20:53:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:53:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 20:53:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 20:53:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 20:53:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-22 20:53:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:42,475 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 20:53:42,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:42,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697365940] [2023-11-22 20:53:42,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697365940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:42,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:42,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:53:42,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594365551] [2023-11-22 20:53:42,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:42,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:53:42,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:42,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:53:42,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:53:42,477 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 20:53:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:44,044 INFO L93 Difference]: Finished difference Result 2906 states and 4247 transitions. [2023-11-22 20:53:44,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 20:53:44,045 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 20:53:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:44,052 INFO L225 Difference]: With dead ends: 2906 [2023-11-22 20:53:44,052 INFO L226 Difference]: Without dead ends: 1977 [2023-11-22 20:53:44,054 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 20:53:44,055 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 422 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:44,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1347 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-22 20:53:44,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2023-11-22 20:53:44,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 941. [2023-11-22 20:53:44,097 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 20:53:44,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1306 transitions. [2023-11-22 20:53:44,100 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1306 transitions. Word has length 150 [2023-11-22 20:53:44,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:44,100 INFO L495 AbstractCegarLoop]: Abstraction has 941 states and 1306 transitions. [2023-11-22 20:53:44,101 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 20:53:44,101 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1306 transitions. [2023-11-22 20:53:44,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-22 20:53:44,102 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:44,102 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 20:53:44,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-22 20:53:44,103 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:53:44,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2065847726, now seen corresponding path program 1 times [2023-11-22 20:53:44,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:44,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836152920] [2023-11-22 20:53:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:44,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:53:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:53:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 20:53:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 20:53:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 20:53:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 20:53:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 20:53:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 20:53:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:53:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 20:53:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 20:53:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 20:53:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-22 20:53:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:44,344 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 20:53:44,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:44,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836152920] [2023-11-22 20:53:44,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836152920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:44,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:44,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:53:44,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847835098] [2023-11-22 20:53:44,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:44,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:53:44,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:44,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:53:44,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:53:44,346 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 20:53:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:45,973 INFO L93 Difference]: Finished difference Result 3090 states and 4533 transitions. [2023-11-22 20:53:45,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 20:53:45,974 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 20:53:45,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:45,982 INFO L225 Difference]: With dead ends: 3090 [2023-11-22 20:53:45,982 INFO L226 Difference]: Without dead ends: 2153 [2023-11-22 20:53:45,984 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 20:53:45,985 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 475 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:45,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1524 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-22 20:53:45,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2023-11-22 20:53:46,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 949. [2023-11-22 20:53:46,065 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 20:53:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1314 transitions. [2023-11-22 20:53:46,067 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1314 transitions. Word has length 151 [2023-11-22 20:53:46,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:46,068 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1314 transitions. [2023-11-22 20:53:46,068 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 20:53:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1314 transitions. [2023-11-22 20:53:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-22 20:53:46,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:46,070 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 20:53:46,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 20:53:46,070 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:53:46,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:46,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1885893366, now seen corresponding path program 1 times [2023-11-22 20:53:46,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:46,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78525217] [2023-11-22 20:53:46,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:46,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:53:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:53:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 20:53:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 20:53:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 20:53:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 20:53:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 20:53:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 20:53:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:53:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 20:53:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 20:53:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 20:53:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-22 20:53:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:46,331 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 20:53:46,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:46,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78525217] [2023-11-22 20:53:46,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78525217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:46,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:46,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:53:46,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138655312] [2023-11-22 20:53:46,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:46,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:53:46,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:46,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:53:46,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:53:46,333 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 20:53:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:47,328 INFO L93 Difference]: Finished difference Result 2278 states and 3223 transitions. [2023-11-22 20:53:47,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 20:53:47,328 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 20:53:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:47,333 INFO L225 Difference]: With dead ends: 2278 [2023-11-22 20:53:47,333 INFO L226 Difference]: Without dead ends: 1333 [2023-11-22 20:53:47,334 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 20:53:47,335 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 228 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:47,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 984 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-22 20:53:47,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2023-11-22 20:53:47,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1012. [2023-11-22 20:53:47,401 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 20:53:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1407 transitions. [2023-11-22 20:53:47,408 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1407 transitions. Word has length 151 [2023-11-22 20:53:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:47,409 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1407 transitions. [2023-11-22 20:53:47,409 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 20:53:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1407 transitions. [2023-11-22 20:53:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-22 20:53:47,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:47,411 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 20:53:47,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-22 20:53:47,411 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:53:47,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:47,412 INFO L85 PathProgramCache]: Analyzing trace with hash -728050790, now seen corresponding path program 1 times [2023-11-22 20:53:47,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:47,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795691976] [2023-11-22 20:53:47,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:47,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:53:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:53:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 20:53:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 20:53:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 20:53:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 20:53:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 20:53:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 20:53:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:53:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 20:53:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 20:53:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 20:53:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-22 20:53:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:47,633 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 20:53:47,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:47,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795691976] [2023-11-22 20:53:47,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795691976] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:53:47,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149342638] [2023-11-22 20:53:47,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:47,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:53:47,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:53:47,635 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 20:53:47,660 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 20:53:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:48,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 20:53:48,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:53:48,132 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 20:53:48,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 20:53:48,204 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 20:53:48,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149342638] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 20:53:48,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 20:53:48,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2023-11-22 20:53:48,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201217327] [2023-11-22 20:53:48,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 20:53:48,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 20:53:48,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:48,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 20:53:48,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-22 20:53:48,206 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 20:53:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:49,367 INFO L93 Difference]: Finished difference Result 2538 states and 3631 transitions. [2023-11-22 20:53:49,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 20:53:49,368 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 20:53:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:49,373 INFO L225 Difference]: With dead ends: 2538 [2023-11-22 20:53:49,373 INFO L226 Difference]: Without dead ends: 1530 [2023-11-22 20:53:49,375 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 20:53:49,375 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 208 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:49,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 988 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 20:53:49,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2023-11-22 20:53:49,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1316. [2023-11-22 20:53:49,419 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 20:53:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1855 transitions. [2023-11-22 20:53:49,421 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1855 transitions. Word has length 152 [2023-11-22 20:53:49,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:49,421 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1855 transitions. [2023-11-22 20:53:49,422 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 20:53:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1855 transitions. [2023-11-22 20:53:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-22 20:53:49,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:49,424 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 20:53:49,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 20:53:49,636 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 20:53:49,636 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:53:49,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:49,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1006770323, now seen corresponding path program 1 times [2023-11-22 20:53:49,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:49,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164767405] [2023-11-22 20:53:49,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:49,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:53:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:53:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 20:53:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 20:53:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 20:53:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 20:53:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 20:53:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 20:53:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:53:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 20:53:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 20:53:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 20:53:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-22 20:53:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-22 20:53:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:49,841 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 20:53:49,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:49,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164767405] [2023-11-22 20:53:49,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164767405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:49,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:49,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 20:53:49,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030599704] [2023-11-22 20:53:49,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:49,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 20:53:49,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:49,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 20:53:49,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 20:53:49,843 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 20:53:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:51,213 INFO L93 Difference]: Finished difference Result 2063 states and 2947 transitions. [2023-11-22 20:53:51,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 20:53:51,214 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 20:53:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:51,217 INFO L225 Difference]: With dead ends: 2063 [2023-11-22 20:53:51,217 INFO L226 Difference]: Without dead ends: 1057 [2023-11-22 20:53:51,219 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 20:53:51,219 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 396 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:51,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1011 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-22 20:53:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2023-11-22 20:53:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 983. [2023-11-22 20:53:51,250 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 20:53:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1371 transitions. [2023-11-22 20:53:51,251 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1371 transitions. Word has length 160 [2023-11-22 20:53:51,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:51,252 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 1371 transitions. [2023-11-22 20:53:51,252 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 20:53:51,252 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1371 transitions. [2023-11-22 20:53:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-11-22 20:53:51,254 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:51,254 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 20:53:51,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-22 20:53:51,254 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:53:51,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash -53197984, now seen corresponding path program 1 times [2023-11-22 20:53:51,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:51,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492182496] [2023-11-22 20:53:51,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:51,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:53:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:53:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 20:53:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 20:53:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 20:53:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 20:53:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 20:53:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 20:53:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:53:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 20:53:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 20:53:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 20:53:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-22 20:53:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-22 20:53:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-22 20:53:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:51,471 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 20:53:51,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:51,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492182496] [2023-11-22 20:53:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492182496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:51,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:51,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 20:53:51,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630191768] [2023-11-22 20:53:51,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:51,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:53:51,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:51,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:53:51,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 20:53:51,475 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 20:53:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:52,837 INFO L93 Difference]: Finished difference Result 2634 states and 3786 transitions. [2023-11-22 20:53:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:53:52,837 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 20:53:52,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:52,843 INFO L225 Difference]: With dead ends: 2634 [2023-11-22 20:53:52,843 INFO L226 Difference]: Without dead ends: 1655 [2023-11-22 20:53:52,845 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 20:53:52,845 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 304 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:52,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1294 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-22 20:53:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2023-11-22 20:53:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 989. [2023-11-22 20:53:52,894 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 20:53:52,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1377 transitions. [2023-11-22 20:53:52,896 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1377 transitions. Word has length 180 [2023-11-22 20:53:52,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:52,896 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1377 transitions. [2023-11-22 20:53:52,896 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 20:53:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1377 transitions. [2023-11-22 20:53:52,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-22 20:53:52,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:52,899 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 20:53:52,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-22 20:53:52,899 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:53:52,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1940924286, now seen corresponding path program 1 times [2023-11-22 20:53:52,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:52,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494922422] [2023-11-22 20:53:52,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:52,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:53:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:53:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 20:53:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 20:53:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 20:53:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 20:53:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 20:53:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 20:53:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:53:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 20:53:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 20:53:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 20:53:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-22 20:53:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-22 20:53:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-22 20:53:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:53,121 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 20:53:53,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:53,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494922422] [2023-11-22 20:53:53,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494922422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:53,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:53,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 20:53:53,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66942339] [2023-11-22 20:53:53,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:53,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 20:53:53,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:53,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 20:53:53,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 20:53:53,124 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 20:53:54,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:54,073 INFO L93 Difference]: Finished difference Result 1899 states and 2651 transitions. [2023-11-22 20:53:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 20:53:54,073 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 20:53:54,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:54,076 INFO L225 Difference]: With dead ends: 1899 [2023-11-22 20:53:54,076 INFO L226 Difference]: Without dead ends: 914 [2023-11-22 20:53:54,079 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 20:53:54,080 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 470 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:54,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 599 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-22 20:53:54,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2023-11-22 20:53:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 843. [2023-11-22 20:53:54,138 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 20:53:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1155 transitions. [2023-11-22 20:53:54,139 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1155 transitions. Word has length 190 [2023-11-22 20:53:54,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:54,140 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 1155 transitions. [2023-11-22 20:53:54,140 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 20:53:54,140 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1155 transitions. [2023-11-22 20:53:54,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-22 20:53:54,142 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:53:54,142 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 20:53:54,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-22 20:53:54,143 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:53:54,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:53:54,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1015934522, now seen corresponding path program 2 times [2023-11-22 20:53:54,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:53:54,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765015680] [2023-11-22 20:53:54,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:53:54,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:53:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-22 20:53:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 20:53:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 20:53:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 20:53:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 20:53:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 20:53:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 20:53:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 20:53:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 20:53:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 20:53:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 20:53:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 20:53:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 20:53:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-22 20:53:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-22 20:53:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-22 20:53:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-22 20:53:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:53:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:53:54,515 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 20:53:54,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:53:54,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765015680] [2023-11-22 20:53:54,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765015680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:53:54,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:53:54,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 20:53:54,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004464955] [2023-11-22 20:53:54,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:53:54,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 20:53:54,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:53:54,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 20:53:54,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-22 20:53:54,518 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 20:53:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:53:55,549 INFO L93 Difference]: Finished difference Result 1214 states and 1697 transitions. [2023-11-22 20:53:55,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 20:53:55,550 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 20:53:55,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:53:55,550 INFO L225 Difference]: With dead ends: 1214 [2023-11-22 20:53:55,550 INFO L226 Difference]: Without dead ends: 0 [2023-11-22 20:53:55,563 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 20:53:55,563 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 968 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-22 20:53:55,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 611 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [465 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-22 20:53:55,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-22 20:53:55,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-22 20:53:55,565 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 20:53:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-22 20:53:55,565 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 190 [2023-11-22 20:53:55,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:53:55,565 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-22 20:53:55,565 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 20:53:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-22 20:53:55,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-22 20:53:55,567 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 20:53:55,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-22 20:53:55,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-22 20:54:18,104 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 2594 2596) no Hoare annotation was computed. [2023-11-22 20:54:18,111 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 20:54:18,112 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2553 2555) the Hoare annotation is: true [2023-11-22 20:54:18,112 INFO L899 garLoopResultBuilder]: For program point ipmi_destroy_userEXIT(lines 2553 2555) no Hoare annotation was computed. [2023-11-22 20:54:18,114 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 20:54:18,114 INFO L899 garLoopResultBuilder]: For program point L2476(lines 2476 2479) no Hoare annotation was computed. [2023-11-22 20:54:18,115 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 20:54:18,115 INFO L899 garLoopResultBuilder]: For program point L2473-1(lines 2473 2481) no Hoare annotation was computed. [2023-11-22 20:54:18,115 INFO L899 garLoopResultBuilder]: For program point L2473(lines 2473 2481) no Hoare annotation was computed. [2023-11-22 20:54:18,115 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 20:54:18,116 INFO L899 garLoopResultBuilder]: For program point wait_for_completionEXIT(lines 2590 2592) no Hoare annotation was computed. [2023-11-22 20:54:18,116 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2590 2592) the Hoare annotation is: true [2023-11-22 20:54:18,116 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2545 2547) the Hoare annotation is: true [2023-11-22 20:54:18,116 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 2545 2547) no Hoare annotation was computed. [2023-11-22 20:54:18,116 INFO L899 garLoopResultBuilder]: For program point dev_errEXIT(lines 2530 2532) no Hoare annotation was computed. [2023-11-22 20:54:18,116 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2530 2532) the Hoare annotation is: true [2023-11-22 20:54:18,116 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 2412 2417) the Hoare annotation is: true [2023-11-22 20:54:18,116 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2415) no Hoare annotation was computed. [2023-11-22 20:54:18,117 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2412 2417) no Hoare annotation was computed. [2023-11-22 20:54:18,117 INFO L899 garLoopResultBuilder]: For program point L1662(line 1662) no Hoare annotation was computed. [2023-11-22 20:54:18,117 INFO L899 garLoopResultBuilder]: For program point L1662-2(line 1662) no Hoare annotation was computed. [2023-11-22 20:54:18,117 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 20:54:18,117 INFO L899 garLoopResultBuilder]: For program point L1662-5(line 1662) no Hoare annotation was computed. [2023-11-22 20:54:18,117 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 20:54:18,117 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 1658 1665) no Hoare annotation was computed. [2023-11-22 20:54:18,118 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 20:54:18,118 INFO L899 garLoopResultBuilder]: For program point L1646-1(line 1646) no Hoare annotation was computed. [2023-11-22 20:54:18,118 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 20:54:18,118 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 1649 1656) no Hoare annotation was computed. [2023-11-22 20:54:18,118 INFO L899 garLoopResultBuilder]: For program point L1567(line 1567) no Hoare annotation was computed. [2023-11-22 20:54:18,118 INFO L899 garLoopResultBuilder]: For program point L1567-2(line 1567) no Hoare annotation was computed. [2023-11-22 20:54:18,118 INFO L899 garLoopResultBuilder]: For program point L1567-4(line 1567) no Hoare annotation was computed. [2023-11-22 20:54:18,118 INFO L899 garLoopResultBuilder]: For program point extract_valueEXIT(lines 1676 1683) no Hoare annotation was computed. [2023-11-22 20:54:18,121 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1676 1683) the Hoare annotation is: true [2023-11-22 20:54:18,121 INFO L899 garLoopResultBuilder]: For program point L2203-1(line 2203) no Hoare annotation was computed. [2023-11-22 20:54:18,121 INFO L902 garLoopResultBuilder]: At program point L2234(line 2234) the Hoare annotation is: true [2023-11-22 20:54:18,121 INFO L895 garLoopResultBuilder]: At program point L2203(line 2203) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-22 20:54:18,122 INFO L902 garLoopResultBuilder]: At program point L2232(line 2232) the Hoare annotation is: true [2023-11-22 20:54:18,122 INFO L902 garLoopResultBuilder]: At program point L2230(line 2230) the Hoare annotation is: true [2023-11-22 20:54:18,122 INFO L899 garLoopResultBuilder]: For program point L2232-1(line 2232) no Hoare annotation was computed. [2023-11-22 20:54:18,122 INFO L899 garLoopResultBuilder]: For program point ibmpex_bmc_deleteEXIT(lines 2197 2237) no Hoare annotation was computed. [2023-11-22 20:54:18,122 INFO L899 garLoopResultBuilder]: For program point L2230-1(line 2230) no Hoare annotation was computed. [2023-11-22 20:54:18,123 INFO L899 garLoopResultBuilder]: For program point L2224(lines 2201 2236) no Hoare annotation was computed. [2023-11-22 20:54:18,124 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2197 2237) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-22 20:54:18,124 INFO L899 garLoopResultBuilder]: For program point L2216(lines 2201 2236) no Hoare annotation was computed. [2023-11-22 20:54:18,124 INFO L902 garLoopResultBuilder]: At program point L2214(line 2214) the Hoare annotation is: true [2023-11-22 20:54:18,124 INFO L899 garLoopResultBuilder]: For program point $Ultimate##4(lines 2219 2222) no Hoare annotation was computed. [2023-11-22 20:54:18,124 INFO L899 garLoopResultBuilder]: For program point L2214-1(line 2214) no Hoare annotation was computed. [2023-11-22 20:54:18,124 INFO L899 garLoopResultBuilder]: For program point L2210(lines 2210 2213) no Hoare annotation was computed. [2023-11-22 20:54:18,124 INFO L895 garLoopResultBuilder]: At program point L2202(line 2202) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-22 20:54:18,124 INFO L899 garLoopResultBuilder]: For program point L2233-1(line 2233) no Hoare annotation was computed. [2023-11-22 20:54:18,125 INFO L899 garLoopResultBuilder]: For program point L2202-1(line 2202) no Hoare annotation was computed. [2023-11-22 20:54:18,125 INFO L902 garLoopResultBuilder]: At program point L2233(line 2233) the Hoare annotation is: true [2023-11-22 20:54:18,125 INFO L899 garLoopResultBuilder]: For program point L2231-1(line 2231) no Hoare annotation was computed. [2023-11-22 20:54:18,125 INFO L902 garLoopResultBuilder]: At program point L2231(line 2231) the Hoare annotation is: true [2023-11-22 20:54:18,125 INFO L899 garLoopResultBuilder]: For program point L2225(lines 2225 2228) no Hoare annotation was computed. [2023-11-22 20:54:18,125 INFO L899 garLoopResultBuilder]: For program point ibmpex_bmc_deleteFINAL(lines 2197 2237) no Hoare annotation was computed. [2023-11-22 20:54:18,125 INFO L899 garLoopResultBuilder]: For program point L2215-1(line 2215) no Hoare annotation was computed. [2023-11-22 20:54:18,125 INFO L902 garLoopResultBuilder]: At program point L2215(line 2215) the Hoare annotation is: true [2023-11-22 20:54:18,125 INFO L899 garLoopResultBuilder]: For program point ldv_handler_precallEXIT(lines 2578 2580) no Hoare annotation was computed. [2023-11-22 20:54:18,126 INFO L902 garLoopResultBuilder]: At program point ldv_handler_precallFINAL(lines 2578 2580) the Hoare annotation is: true [2023-11-22 20:54:18,126 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 2424 2429) no Hoare annotation was computed. [2023-11-22 20:54:18,126 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2424 2429) the Hoare annotation is: true [2023-11-22 20:54:18,126 INFO L899 garLoopResultBuilder]: For program point ipmi_free_recv_msgEXIT(lines 2556 2558) no Hoare annotation was computed. [2023-11-22 20:54:18,126 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2556 2558) the Hoare annotation is: true [2023-11-22 20:54:18,126 INFO L899 garLoopResultBuilder]: For program point L1630(line 1630) no Hoare annotation was computed. [2023-11-22 20:54:18,126 INFO L899 garLoopResultBuilder]: For program point L1629(lines 1629 1631) no Hoare annotation was computed. [2023-11-22 20:54:18,126 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1634 1643) no Hoare annotation was computed. [2023-11-22 20:54:18,126 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 20:54:18,127 INFO L902 garLoopResultBuilder]: At program point L1638(line 1638) the Hoare annotation is: true [2023-11-22 20:54:18,127 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1634 1643) no Hoare annotation was computed. [2023-11-22 20:54:18,127 INFO L899 garLoopResultBuilder]: For program point L1638-1(line 1638) no Hoare annotation was computed. [2023-11-22 20:54:18,127 INFO L899 garLoopResultBuilder]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2023-11-22 20:54:18,127 INFO L899 garLoopResultBuilder]: For program point ibmpex_send_messageEXIT(lines 1695 1719) no Hoare annotation was computed. [2023-11-22 20:54:18,127 INFO L899 garLoopResultBuilder]: For program point ibmpex_send_messageFINAL(lines 1695 1719) no Hoare annotation was computed. [2023-11-22 20:54:18,128 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 20:54:18,128 INFO L899 garLoopResultBuilder]: For program point L1716-1(line 1716) no Hoare annotation was computed. [2023-11-22 20:54:18,128 INFO L902 garLoopResultBuilder]: At program point L1713(line 1713) the Hoare annotation is: true [2023-11-22 20:54:18,128 INFO L899 garLoopResultBuilder]: For program point L1713-1(line 1713) no Hoare annotation was computed. [2023-11-22 20:54:18,128 INFO L899 garLoopResultBuilder]: For program point L1707(lines 1707 1710) no Hoare annotation was computed. [2023-11-22 20:54:18,129 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 20:54:18,129 INFO L899 garLoopResultBuilder]: For program point L1700(lines 1700 1703) no Hoare annotation was computed. [2023-11-22 20:54:18,129 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2539 2541) the Hoare annotation is: true [2023-11-22 20:54:18,129 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 2539 2541) no Hoare annotation was computed. [2023-11-22 20:54:18,129 INFO L899 garLoopResultBuilder]: For program point ibmpex_query_sensor_name_returnLabel#1(lines 1755 1769) no Hoare annotation was computed. [2023-11-22 20:54:18,129 INFO L899 garLoopResultBuilder]: For program point L2282(line 2282) no Hoare annotation was computed. [2023-11-22 20:54:18,129 INFO L899 garLoopResultBuilder]: For program point L2249-1(lines 2238 2252) no Hoare annotation was computed. [2023-11-22 20:54:18,129 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 20:54:18,130 INFO L899 garLoopResultBuilder]: For program point L2084(lines 2084 2087) no Hoare annotation was computed. [2023-11-22 20:54:18,130 INFO L899 garLoopResultBuilder]: For program point L1985(lines 1985 1988) no Hoare annotation was computed. [2023-11-22 20:54:18,131 INFO L899 garLoopResultBuilder]: For program point ibmpex_find_sensors_returnLabel#1(lines 2012 2130) no Hoare annotation was computed. [2023-11-22 20:54:18,131 INFO L899 garLoopResultBuilder]: For program point L1920(lines 1920 1923) no Hoare annotation was computed. [2023-11-22 20:54:18,131 INFO L899 garLoopResultBuilder]: For program point L2350(line 2350) no Hoare annotation was computed. [2023-11-22 20:54:18,131 INFO L899 garLoopResultBuilder]: For program point L2383-1(line 2383) no Hoare annotation was computed. [2023-11-22 20:54:18,131 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 20:54:18,132 INFO L899 garLoopResultBuilder]: For program point L1954(lines 1954 1957) no Hoare annotation was computed. [2023-11-22 20:54:18,132 INFO L899 garLoopResultBuilder]: For program point L2351-1(line 2351) no Hoare annotation was computed. [2023-11-22 20:54:18,132 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 20:54:18,132 INFO L899 garLoopResultBuilder]: For program point L2153(lines 2153 2158) no Hoare annotation was computed. [2023-11-22 20:54:18,132 INFO L899 garLoopResultBuilder]: For program point L1856(lines 1856 1859) no Hoare annotation was computed. [2023-11-22 20:54:18,133 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 20:54:18,133 INFO L899 garLoopResultBuilder]: For program point L2154-1(lines 2154 2155) no Hoare annotation was computed. [2023-11-22 20:54:18,133 INFO L899 garLoopResultBuilder]: For program point L1989(lines 1989 1995) no Hoare annotation was computed. [2023-11-22 20:54:18,133 INFO L899 garLoopResultBuilder]: For program point L2122(lines 2024 2129) no Hoare annotation was computed. [2023-11-22 20:54:18,133 INFO L899 garLoopResultBuilder]: For program point L2089(lines 2089 2092) no Hoare annotation was computed. [2023-11-22 20:54:18,134 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 20:54:18,134 INFO L899 garLoopResultBuilder]: For program point L1726-1(line 1726) no Hoare annotation was computed. [2023-11-22 20:54:18,134 INFO L899 garLoopResultBuilder]: For program point L2354(line 2354) no Hoare annotation was computed. [2023-11-22 20:54:18,134 INFO L899 garLoopResultBuilder]: For program point L2189-1(line 2189) no Hoare annotation was computed. [2023-11-22 20:54:18,134 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 20:54:18,134 INFO L899 garLoopResultBuilder]: For program point L2123(lines 2123 2126) no Hoare annotation was computed. [2023-11-22 20:54:18,135 INFO L899 garLoopResultBuilder]: For program point L2057(lines 2057 2064) no Hoare annotation was computed. [2023-11-22 20:54:18,135 INFO L899 garLoopResultBuilder]: For program point L2057-1(lines 2048 2065) no Hoare annotation was computed. [2023-11-22 20:54:18,135 INFO L899 garLoopResultBuilder]: For program point L1925(lines 1925 1928) no Hoare annotation was computed. [2023-11-22 20:54:18,135 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 20:54:18,135 INFO L899 garLoopResultBuilder]: For program point L1727-1(line 1727) no Hoare annotation was computed. [2023-11-22 20:54:18,135 INFO L899 garLoopResultBuilder]: For program point L2355-1(line 2355) no Hoare annotation was computed. [2023-11-22 20:54:18,135 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 20:54:18,135 INFO L899 garLoopResultBuilder]: For program point L2190(lines 2138 2195) no Hoare annotation was computed. [2023-11-22 20:54:18,136 INFO L899 garLoopResultBuilder]: For program point L1992(lines 1992 1995) no Hoare annotation was computed. [2023-11-22 20:54:18,136 INFO L899 garLoopResultBuilder]: For program point L1992-2(lines 1989 1995) no Hoare annotation was computed. [2023-11-22 20:54:18,136 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 20:54:18,136 INFO L899 garLoopResultBuilder]: For program point L1728(line 1728) no Hoare annotation was computed. [2023-11-22 20:54:18,136 INFO L899 garLoopResultBuilder]: For program point L1761-1(line 1761) no Hoare annotation was computed. [2023-11-22 20:54:18,136 INFO L899 garLoopResultBuilder]: For program point L1728-2(lines 1728 1731) no Hoare annotation was computed. [2023-11-22 20:54:18,136 INFO L899 garLoopResultBuilder]: For program point L2191-1(line 2191) no Hoare annotation was computed. [2023-11-22 20:54:18,136 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 20:54:18,137 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 20:54:18,137 INFO L899 garLoopResultBuilder]: For program point L1762-1(line 1762) no Hoare annotation was computed. [2023-11-22 20:54:18,137 INFO L899 garLoopResultBuilder]: For program point L2489-1(lines 2489 2497) no Hoare annotation was computed. [2023-11-22 20:54:18,137 INFO L899 garLoopResultBuilder]: For program point L2489(lines 2489 2497) no Hoare annotation was computed. [2023-11-22 20:54:18,137 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 20:54:18,137 INFO L899 garLoopResultBuilder]: For program point L1763(line 1763) no Hoare annotation was computed. [2023-11-22 20:54:18,137 INFO L899 garLoopResultBuilder]: For program point L1763-2(lines 1763 1766) no Hoare annotation was computed. [2023-11-22 20:54:18,138 INFO L899 garLoopResultBuilder]: For program point L2358(line 2358) no Hoare annotation was computed. [2023-11-22 20:54:18,138 INFO L899 garLoopResultBuilder]: For program point L2193(line 2193) no Hoare annotation was computed. [2023-11-22 20:54:18,138 INFO L899 garLoopResultBuilder]: For program point L2094(lines 2094 2097) no Hoare annotation was computed. [2023-11-22 20:54:18,138 INFO L899 garLoopResultBuilder]: For program point L2127-1(line 2127) no Hoare annotation was computed. [2023-11-22 20:54:18,138 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 20:54:18,138 INFO L899 garLoopResultBuilder]: For program point L2028(lines 2028 2031) no Hoare annotation was computed. [2023-11-22 20:54:18,138 INFO L899 garLoopResultBuilder]: For program point L2359-1(line 2359) no Hoare annotation was computed. [2023-11-22 20:54:18,138 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 20:54:18,138 INFO L899 garLoopResultBuilder]: For program point L1963(lines 1963 1966) no Hoare annotation was computed. [2023-11-22 20:54:18,139 INFO L899 garLoopResultBuilder]: For program point L2492(lines 2492 2495) no Hoare annotation was computed. [2023-11-22 20:54:18,139 INFO L899 garLoopResultBuilder]: For program point L2261(lines 2261 2267) no Hoare annotation was computed. [2023-11-22 20:54:18,139 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 20:54:18,139 INFO L899 garLoopResultBuilder]: For program point L2262-1(lines 2262 2263) no Hoare annotation was computed. [2023-11-22 20:54:18,139 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 20:54:18,139 INFO L899 garLoopResultBuilder]: For program point L1734-1(line 1734) no Hoare annotation was computed. [2023-11-22 20:54:18,139 INFO L895 garLoopResultBuilder]: At program point L2494(line 2494) the Hoare annotation is: false [2023-11-22 20:54:18,139 INFO L899 garLoopResultBuilder]: For program point ibmpex_register_bmc_returnLabel#1(lines 2131 2196) no Hoare annotation was computed. [2023-11-22 20:54:18,140 INFO L899 garLoopResultBuilder]: For program point L2362(line 2362) no Hoare annotation was computed. [2023-11-22 20:54:18,140 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 20:54:18,140 INFO L899 garLoopResultBuilder]: For program point L2264-1(lines 2254 2286) no Hoare annotation was computed. [2023-11-22 20:54:18,140 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 20:54:18,140 INFO L899 garLoopResultBuilder]: For program point L2033-1(line 2033) no Hoare annotation was computed. [2023-11-22 20:54:18,140 INFO L899 garLoopResultBuilder]: For program point L2166(lines 2166 2169) no Hoare annotation was computed. [2023-11-22 20:54:18,140 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 20:54:18,140 INFO L899 garLoopResultBuilder]: For program point L2100-1(line 2100) no Hoare annotation was computed. [2023-11-22 20:54:18,141 INFO L899 garLoopResultBuilder]: For program point L2365(lines 2337 2377) no Hoare annotation was computed. [2023-11-22 20:54:18,141 INFO L899 garLoopResultBuilder]: For program point L2101-1(line 2101) no Hoare annotation was computed. [2023-11-22 20:54:18,141 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 20:54:18,141 INFO L899 garLoopResultBuilder]: For program point L2035(lines 2035 2038) no Hoare annotation was computed. [2023-11-22 20:54:18,141 INFO L899 garLoopResultBuilder]: For program point L1936(lines 1936 1939) no Hoare annotation was computed. [2023-11-22 20:54:18,141 INFO L899 garLoopResultBuilder]: For program point L2399-1(line 2399) no Hoare annotation was computed. [2023-11-22 20:54:18,141 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 20:54:18,141 INFO L899 garLoopResultBuilder]: For program point $Ultimate##93(lines 1864 1867) no Hoare annotation was computed. [2023-11-22 20:54:18,141 INFO L899 garLoopResultBuilder]: For program point is_power_sensor_returnLabel#1(lines 1916 1931) no Hoare annotation was computed. [2023-11-22 20:54:18,142 INFO L899 garLoopResultBuilder]: For program point L2003(lines 2003 2008) no Hoare annotation was computed. [2023-11-22 20:54:18,142 INFO L899 garLoopResultBuilder]: For program point $Ultimate##83(lines 2117 2120) no Hoare annotation was computed. [2023-11-22 20:54:18,142 INFO L899 garLoopResultBuilder]: For program point get_bmc_data_returnLabel#1(lines 1842 1870) no Hoare annotation was computed. [2023-11-22 20:54:18,142 INFO L899 garLoopResultBuilder]: For program point L2368(lines 2368 2371) no Hoare annotation was computed. [2023-11-22 20:54:18,142 INFO L899 garLoopResultBuilder]: For program point L2269(lines 2269 2273) no Hoare annotation was computed. [2023-11-22 20:54:18,142 INFO L902 garLoopResultBuilder]: At program point ibmpex_exit_ldv_17748#1(lines 2302 2320) the Hoare annotation is: true [2023-11-22 20:54:18,142 INFO L899 garLoopResultBuilder]: For program point L2269-2(lines 2269 2273) no Hoare annotation was computed. [2023-11-22 20:54:18,142 INFO L899 garLoopResultBuilder]: For program point L2071(lines 2071 2074) no Hoare annotation was computed. [2023-11-22 20:54:18,142 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 20:54:18,143 INFO L899 garLoopResultBuilder]: For program point L2005-1(line 2005) no Hoare annotation was computed. [2023-11-22 20:54:18,143 INFO L899 garLoopResultBuilder]: For program point create_sensor_returnLabel#1(lines 1976 2011) no Hoare annotation was computed. [2023-11-22 20:54:18,143 INFO L899 garLoopResultBuilder]: For program point $Ultimate##73(lines 2077 2080) no Hoare annotation was computed. [2023-11-22 20:54:18,143 INFO L899 garLoopResultBuilder]: For program point ibmpex_find_sensors_exit_remove#1(lines 2024 2129) no Hoare annotation was computed. [2023-11-22 20:54:18,143 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-22 20:54:18,144 INFO L899 garLoopResultBuilder]: For program point L2172(lines 2172 2177) no Hoare annotation was computed. [2023-11-22 20:54:18,144 INFO L899 garLoopResultBuilder]: For program point L2139-1(line 2139) no Hoare annotation was computed. [2023-11-22 20:54:18,144 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 20:54:18,144 INFO L899 garLoopResultBuilder]: For program point L1941(lines 1941 1944) no Hoare annotation was computed. [2023-11-22 20:54:18,144 INFO L899 garLoopResultBuilder]: For program point L2173-1(lines 2173 2174) no Hoare annotation was computed. [2023-11-22 20:54:18,144 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 20:54:18,144 INFO L902 garLoopResultBuilder]: At program point L2372(line 2372) the Hoare annotation is: true [2023-11-22 20:54:18,144 INFO L899 garLoopResultBuilder]: For program point $Ultimate##45(lines 1969 1972) no Hoare annotation was computed. [2023-11-22 20:54:18,145 INFO L899 garLoopResultBuilder]: For program point L2372-1(line 2372) no Hoare annotation was computed. [2023-11-22 20:54:18,145 INFO L899 garLoopResultBuilder]: For program point L2108(lines 2108 2111) no Hoare annotation was computed. [2023-11-22 20:54:18,145 INFO L899 garLoopResultBuilder]: For program point L2141(lines 2141 2145) no Hoare annotation was computed. [2023-11-22 20:54:18,145 INFO L899 garLoopResultBuilder]: For program point ibmpex_ver_check_returnLabel#1(lines 1720 1740) no Hoare annotation was computed. [2023-11-22 20:54:18,145 INFO L899 garLoopResultBuilder]: For program point is_temp_sensor_returnLabel#1(lines 1932 1947) no Hoare annotation was computed. [2023-11-22 20:54:18,145 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 20:54:18,145 INFO L899 garLoopResultBuilder]: For program point L2274(lines 2274 2281) no Hoare annotation was computed. [2023-11-22 20:54:18,145 INFO L899 garLoopResultBuilder]: For program point L2340-1(line 2340) no Hoare annotation was computed. [2023-11-22 20:54:18,145 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 20:54:18,146 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 20:54:18,146 INFO L899 garLoopResultBuilder]: For program point L2142-1(line 2142) no Hoare annotation was computed. [2023-11-22 20:54:18,146 INFO L899 garLoopResultBuilder]: For program point L2043(lines 2043 2046) no Hoare annotation was computed. [2023-11-22 20:54:18,146 INFO L899 garLoopResultBuilder]: For program point power_sensor_multiplier_returnLabel#1(lines 1948 1975) no Hoare annotation was computed. [2023-11-22 20:54:18,146 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 20:54:18,146 INFO L899 garLoopResultBuilder]: For program point L1746-1(line 1746) no Hoare annotation was computed. [2023-11-22 20:54:18,146 INFO L899 garLoopResultBuilder]: For program point L2407-1(line 2407) no Hoare annotation was computed. [2023-11-22 20:54:18,146 INFO L899 garLoopResultBuilder]: For program point L2374(lines 2337 2377) no Hoare annotation was computed. [2023-11-22 20:54:18,146 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 20:54:18,147 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 20:54:18,147 INFO L899 garLoopResultBuilder]: For program point L1747-1(line 1747) no Hoare annotation was computed. [2023-11-22 20:54:18,147 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-22 20:54:18,147 INFO L899 garLoopResultBuilder]: For program point L2342(lines 2342 2345) no Hoare annotation was computed. [2023-11-22 20:54:18,147 INFO L899 garLoopResultBuilder]: For program point L1748(line 1748) no Hoare annotation was computed. [2023-11-22 20:54:18,147 INFO L899 garLoopResultBuilder]: For program point L1748-2(lines 1748 1751) no Hoare annotation was computed. [2023-11-22 20:54:18,147 INFO L899 garLoopResultBuilder]: For program point L2310(line 2310) no Hoare annotation was computed. [2023-11-22 20:54:18,147 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 20:54:18,148 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 20:54:18,148 INFO L899 garLoopResultBuilder]: For program point L2178-1(line 2178) no Hoare annotation was computed. [2023-11-22 20:54:18,148 INFO L899 garLoopResultBuilder]: For program point L2112-1(line 2112) no Hoare annotation was computed. [2023-11-22 20:54:18,148 INFO L899 garLoopResultBuilder]: For program point L2245(lines 2245 2248) no Hoare annotation was computed. [2023-11-22 20:54:18,148 INFO L899 garLoopResultBuilder]: For program point L2113-1(line 2113) no Hoare annotation was computed. [2023-11-22 20:54:18,148 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 20:54:18,148 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 20:54:18,148 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 20:54:18,149 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2023-11-22 20:54:18,149 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 20:54:18,149 INFO L899 garLoopResultBuilder]: For program point L2114(lines 2024 2129) no Hoare annotation was computed. [2023-11-22 20:54:18,149 INFO L899 garLoopResultBuilder]: For program point L2081(lines 2024 2129) no Hoare annotation was computed. [2023-11-22 20:54:18,149 INFO L899 garLoopResultBuilder]: For program point L2048(lines 2048 2065) no Hoare annotation was computed. [2023-11-22 20:54:18,149 INFO L899 garLoopResultBuilder]: For program point ibmpex_query_sensor_count_returnLabel#1(lines 1741 1754) no Hoare annotation was computed. [2023-11-22 20:54:18,149 INFO L899 garLoopResultBuilder]: For program point L2181(lines 2181 2186) no Hoare annotation was computed. [2023-11-22 20:54:18,149 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 20:54:18,149 INFO L899 garLoopResultBuilder]: For program point $Ultimate##117(lines 2315 2318) no Hoare annotation was computed. [2023-11-22 20:54:18,150 INFO L899 garLoopResultBuilder]: For program point L1983-1(line 1983) no Hoare annotation was computed. [2023-11-22 20:54:18,150 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 20:54:18,150 INFO L899 garLoopResultBuilder]: For program point L2182-1(lines 2182 2183) no Hoare annotation was computed. [2023-11-22 20:54:18,150 INFO L899 garLoopResultBuilder]: For program point L2083(lines 2024 2129) no Hoare annotation was computed. [2023-11-22 20:54:18,150 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 2536 2538) no Hoare annotation was computed. [2023-11-22 20:54:18,150 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2536 2538) the Hoare annotation is: true [2023-11-22 20:54:18,153 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:54:18,155 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 20:54:18,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-22 20:54:18,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-22 20:54:18,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-22 20:54:18,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-22 20:54:18,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-22 20:54:18,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-22 20:54:18,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-22 20:54:18,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-22 20:54:18,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-22 20:54:18,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-22 20:54:18,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-22 20:54:18,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-22 20:54:18,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-22 20:54:18,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-22 20:54:18,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-22 20:54:18,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-22 20:54:18,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-22 20:54:18,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-22 20:54:18,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-22 20:54:18,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-22 20:54:18,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-22 20:54:18,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-22 20:54:18,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-22 20:54:18,172 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-22 20:54:18,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 08:54:18 BoogieIcfgContainer [2023-11-22 20:54:18,172 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 20:54:18,173 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 20:54:18,173 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 20:54:18,173 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 20:54:18,173 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:53:30" (3/4) ... [2023-11-22 20:54:18,174 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-22 20:54:18,177 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2023-11-22 20:54:18,177 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_destroy_user [2023-11-22 20:54:18,177 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-22 20:54:18,177 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2023-11-22 20:54:18,177 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure wait_for_completion [2023-11-22 20:54:18,177 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2023-11-22 20:54:18,178 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2023-11-22 20:54:18,178 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2023-11-22 20:54:18,178 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_free_recv_msg [2023-11-22 20:54:18,178 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-11-22 20:54:18,178 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_send_message [2023-11-22 20:54:18,178 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2023-11-22 20:54:18,178 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2023-11-22 20:54:18,178 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2023-11-22 20:54:18,178 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2023-11-22 20:54:18,178 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure extract_value [2023-11-22 20:54:18,179 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_bmc_delete [2023-11-22 20:54:18,179 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2023-11-22 20:54:18,198 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 167 nodes and edges [2023-11-22 20:54:18,199 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2023-11-22 20:54:18,200 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-11-22 20:54:18,201 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-22 20:54:18,202 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-22 20:54:18,203 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-22 20:54:18,347 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 20:54:18,348 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-22 20:54:18,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 20:54:18,349 INFO L158 Benchmark]: Toolchain (without parser) took 49578.94ms. Allocated memory was 151.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 76.4MB in the beginning and 729.6MB in the end (delta: -653.2MB). Peak memory consumption was 419.0MB. Max. memory is 16.1GB. [2023-11-22 20:54:18,349 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 20:54:18,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.77ms. Allocated memory was 151.0MB in the beginning and 216.0MB in the end (delta: 65.0MB). Free memory was 76.2MB in the beginning and 155.7MB in the end (delta: -79.4MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2023-11-22 20:54:18,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.42ms. Allocated memory is still 216.0MB. Free memory was 155.7MB in the beginning and 146.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-22 20:54:18,350 INFO L158 Benchmark]: Boogie Preprocessor took 63.05ms. Allocated memory is still 216.0MB. Free memory was 146.2MB in the beginning and 138.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-22 20:54:18,351 INFO L158 Benchmark]: RCFGBuilder took 1172.65ms. Allocated memory is still 216.0MB. Free memory was 138.9MB in the beginning and 139.6MB in the end (delta: -755.6kB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2023-11-22 20:54:18,351 INFO L158 Benchmark]: TraceAbstraction took 47388.65ms. Allocated memory was 216.0MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 138.6MB in the beginning and 750.6MB in the end (delta: -612.0MB). Peak memory consumption was 717.6MB. Max. memory is 16.1GB. [2023-11-22 20:54:18,351 INFO L158 Benchmark]: Witness Printer took 175.38ms. Allocated memory is still 1.2GB. Free memory was 750.6MB in the beginning and 729.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-22 20:54:18,352 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.14ms. Allocated memory is still 151.0MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 673.77ms. Allocated memory was 151.0MB in the beginning and 216.0MB in the end (delta: 65.0MB). Free memory was 76.2MB in the beginning and 155.7MB in the end (delta: -79.4MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.42ms. Allocated memory is still 216.0MB. Free memory was 155.7MB in the beginning and 146.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.05ms. Allocated memory is still 216.0MB. Free memory was 146.2MB in the beginning and 138.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1172.65ms. Allocated memory is still 216.0MB. Free memory was 138.9MB in the beginning and 139.6MB in the end (delta: -755.6kB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. * TraceAbstraction took 47388.65ms. Allocated memory was 216.0MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 138.6MB in the beginning and 750.6MB in the end (delta: -612.0MB). Peak memory consumption was 717.6MB. Max. memory is 16.1GB. * Witness Printer took 175.38ms. Allocated memory is still 1.2GB. Free memory was 750.6MB in the beginning and 729.6MB 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: 47.3s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 22.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6344 SdHoareTripleChecker+Valid, 16.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5801 mSDsluCounter, 14927 SdHoareTripleChecker+Invalid, 15.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9962 mSDsCounter, 2831 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10972 IncrementalHoareTripleChecker+Invalid, 13803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2831 mSolverCounterUnsat, 4965 mSDtfsCounter, 10972 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.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 4772 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 74 LocationsWithAnnotation, 3384 PreInvPairs, 3669 NumberOfFragments, 2236 HoareAnnotationTreeSize, 3384 FomulaSimplifications, 32470946 FormulaSimplificationTreeSizeReduction, 17.6s HoareSimplificationTime, 74 FomulaSimplificationsInter, 125742 FormulaSimplificationTreeSizeReductionInter, 4.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.1s 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 20:54:18,379 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