./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 true --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fba957c5 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 true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-fba957c-m [2023-11-23 10:04:40,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 10:04:40,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 10:04:40,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 10:04:40,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 10:04:40,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 10:04:40,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 10:04:40,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 10:04:40,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 10:04:40,403 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 10:04:40,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 10:04:40,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 10:04:40,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 10:04:40,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 10:04:40,405 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 10:04:40,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 10:04:40,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 10:04:40,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 10:04:40,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 10:04:40,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 10:04:40,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 10:04:40,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 10:04:40,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 10:04:40,407 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 10:04:40,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 10:04:40,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 10:04:40,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 10:04:40,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 10:04:40,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 10:04:40,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 10:04:40,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 10:04:40,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 10:04:40,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 10:04:40,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 10:04:40,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 10:04:40,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 10:04:40,410 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 10:04:40,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 10:04:40,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 10:04:40,411 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 -> true [2023-11-23 10:04:40,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 10:04:40,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 10:04:40,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 10:04:40,624 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 10:04:40,624 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 10:04:40,625 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-23 10:04:41,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 10:04:41,910 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 10:04:41,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2023-11-23 10:04:41,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d9005226/fec90e426617415d91b1df4e0882167d/FLAG878628bf6 [2023-11-23 10:04:41,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d9005226/fec90e426617415d91b1df4e0882167d [2023-11-23 10:04:41,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 10:04:41,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 10:04:41,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 10:04:41,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 10:04:41,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 10:04:41,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:04:41" (1/1) ... [2023-11-23 10:04:41,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76433180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:04:41, skipping insertion in model container [2023-11-23 10:04:41,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:04:41" (1/1) ... [2023-11-23 10:04:42,017 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 10:04:42,444 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-23 10:04:42,463 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 10:04:42,481 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 10:04:42,581 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-23 10:04:42,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 10:04:42,611 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 10:04:42,614 WARN L675 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 10:04:42,619 INFO L206 MainTranslator]: Completed translation [2023-11-23 10:04:42,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:04:42 WrapperNode [2023-11-23 10:04:42,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 10:04:42,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 10:04:42,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 10:04:42,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 10:04:42,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:04:42" (1/1) ... [2023-11-23 10:04:42,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:04:42" (1/1) ... [2023-11-23 10:04:42,699 INFO L138 Inliner]: procedures = 102, calls = 434, calls flagged for inlining = 49, calls inlined = 44, statements flattened = 1146 [2023-11-23 10:04:42,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 10:04:42,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 10:04:42,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 10:04:42,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 10:04:42,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:04:42" (1/1) ... [2023-11-23 10:04:42,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:04:42" (1/1) ... [2023-11-23 10:04:42,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:04:42" (1/1) ... [2023-11-23 10:04:42,845 INFO L175 MemorySlicer]: Split 235 memory accesses to 15 slices as follows [2, 18, 4, 7, 10, 4, 155, 5, 6, 8, 3, 3, 2, 4, 4]. 66 percent of accesses are in the largest equivalence class. The 84 initializations are split as follows [2, 0, 4, 7, 0, 4, 42, 5, 6, 0, 3, 3, 2, 3, 3]. The 46 writes are split as follows [0, 14, 0, 0, 0, 0, 32, 0, 0, 0, 0, 0, 0, 0, 0]. [2023-11-23 10:04:42,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:04:42" (1/1) ... [2023-11-23 10:04:42,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:04:42" (1/1) ... [2023-11-23 10:04:42,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:04:42" (1/1) ... [2023-11-23 10:04:42,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:04:42" (1/1) ... [2023-11-23 10:04:42,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:04:42" (1/1) ... [2023-11-23 10:04:42,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:04:42" (1/1) ... [2023-11-23 10:04:42,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 10:04:42,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 10:04:42,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 10:04:42,942 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 10:04:42,943 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:04:42" (1/1) ... [2023-11-23 10:04:42,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 10:04:42,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:04:42,968 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-23 10:04:42,981 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-23 10:04:43,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2023-11-23 10:04:43,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2023-11-23 10:04:43,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2023-11-23 10:04:43,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2023-11-23 10:04:43,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2023-11-23 10:04:43,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2023-11-23 10:04:43,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2023-11-23 10:04:43,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2023-11-23 10:04:43,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2023-11-23 10:04:43,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2023-11-23 10:04:43,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2023-11-23 10:04:43,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2023-11-23 10:04:43,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2023-11-23 10:04:43,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2023-11-23 10:04:43,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2023-11-23 10:04:43,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2023-11-23 10:04:43,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2023-11-23 10:04:43,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2023-11-23 10:04:43,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2023-11-23 10:04:43,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2023-11-23 10:04:43,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2023-11-23 10:04:43,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2023-11-23 10:04:43,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2023-11-23 10:04:43,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2023-11-23 10:04:43,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2023-11-23 10:04:43,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2023-11-23 10:04:43,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2023-11-23 10:04:43,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2023-11-23 10:04:43,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2023-11-23 10:04:43,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2023-11-23 10:04:43,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2023-11-23 10:04:43,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2023-11-23 10:04:43,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2023-11-23 10:04:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2023-11-23 10:04:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2023-11-23 10:04:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2023-11-23 10:04:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2023-11-23 10:04:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2023-11-23 10:04:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2023-11-23 10:04:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2023-11-23 10:04:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2023-11-23 10:04:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2023-11-23 10:04:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2023-11-23 10:04:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2023-11-23 10:04:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2023-11-23 10:04:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 10:04:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 10:04:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 10:04:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 10:04:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-23 10:04:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-23 10:04:43,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-23 10:04:43,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-23 10:04:43,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-23 10:04:43,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-11-23 10:04:43,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-11-23 10:04:43,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-11-23 10:04:43,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-11-23 10:04:43,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-11-23 10:04:43,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-11-23 10:04:43,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-23 10:04:43,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-23 10:04:43,026 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-23 10:04:43,027 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-23 10:04:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 10:04:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 10:04:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 10:04:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 10:04:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-23 10:04:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-23 10:04:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-23 10:04:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-23 10:04:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-11-23 10:04:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-11-23 10:04:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-11-23 10:04:43,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-11-23 10:04:43,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-11-23 10:04:43,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-11-23 10:04:43,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-11-23 10:04:43,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-23 10:04:43,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-23 10:04:43,029 INFO L130 BoogieDeclarations]: Found specification of procedure extract_value [2023-11-23 10:04:43,029 INFO L138 BoogieDeclarations]: Found implementation of procedure extract_value [2023-11-23 10:04:43,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 10:04:43,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 10:04:43,030 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2023-11-23 10:04:43,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2023-11-23 10:04:43,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 10:04:43,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 10:04:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 10:04:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-23 10:04:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-23 10:04:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-23 10:04:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-23 10:04:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-23 10:04:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-11-23 10:04:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-11-23 10:04:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-11-23 10:04:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-11-23 10:04:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-11-23 10:04:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-11-23 10:04:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-11-23 10:04:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2023-11-23 10:04:43,032 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2023-11-23 10:04:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 10:04:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-23 10:04:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-23 10:04:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_bmc_delete [2023-11-23 10:04:43,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_bmc_delete [2023-11-23 10:04:43,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 10:04:43,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 10:04:43,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 10:04:43,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-23 10:04:43,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-23 10:04:43,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-23 10:04:43,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-23 10:04:43,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-11-23 10:04:43,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-11-23 10:04:43,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-11-23 10:04:43,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-11-23 10:04:43,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-11-23 10:04:43,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-11-23 10:04:43,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-11-23 10:04:43,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-11-23 10:04:43,035 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-23 10:04:43,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-23 10:04:43,035 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_send_message [2023-11-23 10:04:43,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_send_message [2023-11-23 10:04:43,036 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2023-11-23 10:04:43,036 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2023-11-23 10:04:43,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 10:04:43,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 10:04:43,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 10:04:43,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 10:04:43,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-23 10:04:43,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-23 10:04:43,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-23 10:04:43,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-23 10:04:43,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-11-23 10:04:43,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-11-23 10:04:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-11-23 10:04:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-11-23 10:04:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-11-23 10:04:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-11-23 10:04:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-11-23 10:04:43,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-11-23 10:04:43,039 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-23 10:04:43,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-23 10:04:43,041 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2023-11-23 10:04:43,041 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2023-11-23 10:04:43,041 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2023-11-23 10:04:43,042 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2023-11-23 10:04:43,042 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-11-23 10:04:43,042 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-11-23 10:04:43,042 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2023-11-23 10:04:43,043 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2023-11-23 10:04:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 10:04:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 10:04:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 10:04:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 10:04:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-23 10:04:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-23 10:04:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-23 10:04:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-23 10:04:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-23 10:04:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-11-23 10:04:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-11-23 10:04:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-11-23 10:04:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-11-23 10:04:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-11-23 10:04:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-11-23 10:04:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2023-11-23 10:04:43,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2023-11-23 10:04:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2023-11-23 10:04:43,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2023-11-23 10:04:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2023-11-23 10:04:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2023-11-23 10:04:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2023-11-23 10:04:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2023-11-23 10:04:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2023-11-23 10:04:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2023-11-23 10:04:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2023-11-23 10:04:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2023-11-23 10:04:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2023-11-23 10:04:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2023-11-23 10:04:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2023-11-23 10:04:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2023-11-23 10:04:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2023-11-23 10:04:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2023-11-23 10:04:43,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2023-11-23 10:04:43,051 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2023-11-23 10:04:43,051 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2023-11-23 10:04:43,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 10:04:43,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 10:04:43,407 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 10:04:43,409 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 10:04:44,138 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 10:04:44,198 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 10:04:44,199 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 10:04:44,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:04:44 BoogieIcfgContainer [2023-11-23 10:04:44,199 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 10:04:44,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 10:04:44,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 10:04:44,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 10:04:44,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:04:41" (1/3) ... [2023-11-23 10:04:44,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a95f073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:04:44, skipping insertion in model container [2023-11-23 10:04:44,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:04:42" (2/3) ... [2023-11-23 10:04:44,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a95f073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:04:44, skipping insertion in model container [2023-11-23 10:04:44,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:04:44" (3/3) ... [2023-11-23 10:04:44,230 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2023-11-23 10:04:44,242 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 10:04:44,242 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 10:04:44,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 10:04:44,286 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;@47b9c44b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 10:04:44,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 10:04:44,291 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-23 10:04:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-23 10:04:44,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:04:44,304 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-23 10:04:44,304 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:04:44,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:04:44,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1376610380, now seen corresponding path program 1 times [2023-11-23 10:04:44,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:04:44,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015792031] [2023-11-23 10:04:44,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:04:44,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:04:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:44,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:04:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:44,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:04:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:44,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:44,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:44,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:04:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:44,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:04:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:44,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 10:04:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:44,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:04:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:44,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:04:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:44,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:04:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:44,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:04:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:44,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 10:04:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:44,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:45,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:45,004 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-23 10:04:45,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:04:45,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015792031] [2023-11-23 10:04:45,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015792031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:04:45,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:04:45,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:04:45,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632831265] [2023-11-23 10:04:45,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:04:45,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:04:45,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:04:45,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:04:45,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:04:45,039 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-23 10:04:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:04:46,483 INFO L93 Difference]: Finished difference Result 552 states and 806 transitions. [2023-11-23 10:04:46,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:04:46,486 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-23 10:04:46,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:04:46,494 INFO L225 Difference]: With dead ends: 552 [2023-11-23 10:04:46,494 INFO L226 Difference]: Without dead ends: 303 [2023-11-23 10:04:46,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 10:04:46,501 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 197 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-23 10:04:46,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 991 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-23 10:04:46,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-11-23 10:04:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 233. [2023-11-23 10:04:46,544 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-23 10:04:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 325 transitions. [2023-11-23 10:04:46,547 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 325 transitions. Word has length 99 [2023-11-23 10:04:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:04:46,547 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 325 transitions. [2023-11-23 10:04:46,547 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-23 10:04:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 325 transitions. [2023-11-23 10:04:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-23 10:04:46,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:04:46,551 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-23 10:04:46,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 10:04:46,552 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:04:46,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:04:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1901770316, now seen corresponding path program 1 times [2023-11-23 10:04:46,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:04:46,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018291804] [2023-11-23 10:04:46,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:04:46,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:04:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:04:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:04:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:04:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:04:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:04:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:04:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:04:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:04:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:04:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:04:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:04:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:46,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-23 10:04:46,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:04:46,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018291804] [2023-11-23 10:04:46,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018291804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:04:46,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:04:46,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 10:04:46,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45039684] [2023-11-23 10:04:46,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:04:46,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 10:04:46,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:04:46,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 10:04:46,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 10:04:46,729 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-23 10:04:47,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:04:47,485 INFO L93 Difference]: Finished difference Result 486 states and 684 transitions. [2023-11-23 10:04:47,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 10:04:47,486 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-23 10:04:47,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:04:47,488 INFO L225 Difference]: With dead ends: 486 [2023-11-23 10:04:47,488 INFO L226 Difference]: Without dead ends: 257 [2023-11-23 10:04:47,489 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-23 10:04:47,489 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 138 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 10:04:47,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 607 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 10:04:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-11-23 10:04:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 234. [2023-11-23 10:04:47,502 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-23 10:04:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 326 transitions. [2023-11-23 10:04:47,503 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 326 transitions. Word has length 105 [2023-11-23 10:04:47,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:04:47,504 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 326 transitions. [2023-11-23 10:04:47,504 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-23 10:04:47,504 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 326 transitions. [2023-11-23 10:04:47,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-23 10:04:47,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:04:47,506 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-23 10:04:47,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 10:04:47,507 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:04:47,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:04:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1956163214, now seen corresponding path program 1 times [2023-11-23 10:04:47,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:04:47,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269983688] [2023-11-23 10:04:47,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:04:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:04:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:04:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:04:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:04:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:04:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:04:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:04:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:04:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:04:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:04:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:04:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:04:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:47,690 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-23 10:04:47,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:04:47,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269983688] [2023-11-23 10:04:47,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269983688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:04:47,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:04:47,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:04:47,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52290720] [2023-11-23 10:04:47,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:04:47,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:04:47,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:04:47,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:04:47,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:04:47,693 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-23 10:04:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:04:48,855 INFO L93 Difference]: Finished difference Result 561 states and 802 transitions. [2023-11-23 10:04:48,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:04:48,860 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-23 10:04:48,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:04:48,862 INFO L225 Difference]: With dead ends: 561 [2023-11-23 10:04:48,862 INFO L226 Difference]: Without dead ends: 331 [2023-11-23 10:04:48,863 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-23 10:04:48,866 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 207 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-23 10:04:48,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1034 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-23 10:04:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-23 10:04:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 236. [2023-11-23 10:04:48,892 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-23 10:04:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 328 transitions. [2023-11-23 10:04:48,894 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 328 transitions. Word has length 105 [2023-11-23 10:04:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:04:48,896 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 328 transitions. [2023-11-23 10:04:48,896 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-23 10:04:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 328 transitions. [2023-11-23 10:04:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-23 10:04:48,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:04:48,899 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-23 10:04:48,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 10:04:48,900 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:04:48,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:04:48,901 INFO L85 PathProgramCache]: Analyzing trace with hash -32935180, now seen corresponding path program 1 times [2023-11-23 10:04:48,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:04:48,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095414165] [2023-11-23 10:04:48,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:04:48,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:04:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:04:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:04:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:04:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:04:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:04:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:04:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:04:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:04:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:04:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:04:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:04:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:49,124 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-23 10:04:49,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:04:49,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095414165] [2023-11-23 10:04:49,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095414165] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:04:49,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:04:49,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 10:04:49,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20744834] [2023-11-23 10:04:49,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:04:49,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 10:04:49,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:04:49,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 10:04:49,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 10:04:49,127 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-23 10:04:49,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:04:49,844 INFO L93 Difference]: Finished difference Result 492 states and 690 transitions. [2023-11-23 10:04:49,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 10:04:49,844 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-23 10:04:49,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:04:49,846 INFO L225 Difference]: With dead ends: 492 [2023-11-23 10:04:49,846 INFO L226 Difference]: Without dead ends: 260 [2023-11-23 10:04:49,847 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-23 10:04:49,847 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 138 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 10:04:49,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 608 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 10:04:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-23 10:04:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 237. [2023-11-23 10:04:49,856 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-23 10:04:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 329 transitions. [2023-11-23 10:04:49,857 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 329 transitions. Word has length 105 [2023-11-23 10:04:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:04:49,857 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 329 transitions. [2023-11-23 10:04:49,858 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-23 10:04:49,858 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 329 transitions. [2023-11-23 10:04:49,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-23 10:04:49,859 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:04:49,859 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-23 10:04:49,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 10:04:49,859 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:04:49,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:04:49,860 INFO L85 PathProgramCache]: Analyzing trace with hash -542408270, now seen corresponding path program 1 times [2023-11-23 10:04:49,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:04:49,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047960261] [2023-11-23 10:04:49,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:04:49,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:04:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:04:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:04:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:04:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:04:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:04:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:04:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:04:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:04:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:04:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:04:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:04:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:50,165 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-23 10:04:50,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:04:50,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047960261] [2023-11-23 10:04:50,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047960261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:04:50,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:04:50,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:04:50,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253425227] [2023-11-23 10:04:50,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:04:50,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:04:50,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:04:50,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:04:50,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:04:50,168 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-23 10:04:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:04:51,643 INFO L93 Difference]: Finished difference Result 766 states and 1085 transitions. [2023-11-23 10:04:51,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 10:04:51,644 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-23 10:04:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:04:51,647 INFO L225 Difference]: With dead ends: 766 [2023-11-23 10:04:51,647 INFO L226 Difference]: Without dead ends: 762 [2023-11-23 10:04:51,647 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-23 10:04:51,648 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 945 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-23 10:04:51,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 793 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-23 10:04:51,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2023-11-23 10:04:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 693. [2023-11-23 10:04:51,691 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-23 10:04:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 969 transitions. [2023-11-23 10:04:51,694 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 969 transitions. Word has length 105 [2023-11-23 10:04:51,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:04:51,696 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 969 transitions. [2023-11-23 10:04:51,696 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-23 10:04:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 969 transitions. [2023-11-23 10:04:51,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 10:04:51,698 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:04:51,698 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-23 10:04:51,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 10:04:51,699 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:04:51,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:04:51,699 INFO L85 PathProgramCache]: Analyzing trace with hash -594832168, now seen corresponding path program 1 times [2023-11-23 10:04:51,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:04:51,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607066408] [2023-11-23 10:04:51,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:04:51,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:04:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:04:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:04:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:04:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:04:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:04:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:04:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:04:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:04:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:04:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:04:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:04:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:04:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:51,928 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-23 10:04:51,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:04:51,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607066408] [2023-11-23 10:04:51,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607066408] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 10:04:51,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046308983] [2023-11-23 10:04:51,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:04:51,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:04:51,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:04:51,930 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-23 10:04:51,934 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-23 10:04:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:52,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 10:04:52,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 10:04:52,428 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-23 10:04:52,428 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 10:04:52,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046308983] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:04:52,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 10:04:52,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-23 10:04:52,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988145775] [2023-11-23 10:04:52,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:04:52,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 10:04:52,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:04:52,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 10:04:52,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 10:04:52,430 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-23 10:04:52,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:04:52,816 INFO L93 Difference]: Finished difference Result 1384 states and 1937 transitions. [2023-11-23 10:04:52,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 10:04:52,816 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-23 10:04:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:04:52,821 INFO L225 Difference]: With dead ends: 1384 [2023-11-23 10:04:52,821 INFO L226 Difference]: Without dead ends: 1151 [2023-11-23 10:04:52,822 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-23 10:04:52,823 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-23 10:04:52,823 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-23 10:04:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2023-11-23 10:04:52,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 921. [2023-11-23 10:04:52,863 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-23 10:04:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1286 transitions. [2023-11-23 10:04:52,867 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1286 transitions. Word has length 113 [2023-11-23 10:04:52,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:04:52,868 INFO L495 AbstractCegarLoop]: Abstraction has 921 states and 1286 transitions. [2023-11-23 10:04:52,868 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-23 10:04:52,868 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1286 transitions. [2023-11-23 10:04:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-23 10:04:52,871 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:04:52,871 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-23 10:04:52,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 10:04:53,080 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-23 10:04:53,080 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:04:53,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:04:53,081 INFO L85 PathProgramCache]: Analyzing trace with hash -584614501, now seen corresponding path program 1 times [2023-11-23 10:04:53,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:04:53,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223571652] [2023-11-23 10:04:53,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:04:53,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:04:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:04:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:04:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:04:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:04:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:04:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:04:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:04:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:04:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:04:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:04:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:04:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:04:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:04:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-23 10:04:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:53,316 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-23 10:04:53,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:04:53,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223571652] [2023-11-23 10:04:53,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223571652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:04:53,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:04:53,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:04:53,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772044972] [2023-11-23 10:04:53,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:04:53,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:04:53,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:04:53,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:04:53,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:04:53,318 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-23 10:04:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:04:54,653 INFO L93 Difference]: Finished difference Result 2430 states and 3513 transitions. [2023-11-23 10:04:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 10:04:54,654 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-23 10:04:54,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:04:54,661 INFO L225 Difference]: With dead ends: 2430 [2023-11-23 10:04:54,661 INFO L226 Difference]: Without dead ends: 1513 [2023-11-23 10:04:54,664 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-23 10:04:54,664 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 256 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-23 10:04:54,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1223 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-23 10:04:54,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2023-11-23 10:04:54,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 929. [2023-11-23 10:04:54,706 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-23 10:04:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1294 transitions. [2023-11-23 10:04:54,710 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1294 transitions. Word has length 150 [2023-11-23 10:04:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:04:54,710 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1294 transitions. [2023-11-23 10:04:54,710 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-23 10:04:54,710 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1294 transitions. [2023-11-23 10:04:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-23 10:04:54,713 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:04:54,713 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-23 10:04:54,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 10:04:54,713 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:04:54,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:04:54,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1864985629, now seen corresponding path program 1 times [2023-11-23 10:04:54,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:04:54,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868519951] [2023-11-23 10:04:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:04:54,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:04:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:04:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:04:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:04:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:04:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:04:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:04:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:04:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:04:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:04:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:04:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:04:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:04:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:04:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-23 10:04:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:54,956 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-23 10:04:54,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:04:54,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868519951] [2023-11-23 10:04:54,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868519951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:04:54,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:04:54,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 10:04:54,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218095087] [2023-11-23 10:04:54,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:04:54,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 10:04:54,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:04:54,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 10:04:54,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 10:04:54,958 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-23 10:04:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:04:55,727 INFO L93 Difference]: Finished difference Result 1950 states and 2739 transitions. [2023-11-23 10:04:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 10:04:55,727 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-23 10:04:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:04:55,731 INFO L225 Difference]: With dead ends: 1950 [2023-11-23 10:04:55,731 INFO L226 Difference]: Without dead ends: 1025 [2023-11-23 10:04:55,733 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-23 10:04:55,733 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 138 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 10:04:55,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 608 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 10:04:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2023-11-23 10:04:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 933. [2023-11-23 10:04:55,764 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-23 10:04:55,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1298 transitions. [2023-11-23 10:04:55,767 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1298 transitions. Word has length 150 [2023-11-23 10:04:55,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:04:55,767 INFO L495 AbstractCegarLoop]: Abstraction has 933 states and 1298 transitions. [2023-11-23 10:04:55,767 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-23 10:04:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1298 transitions. [2023-11-23 10:04:55,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-23 10:04:55,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:04:55,769 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-23 10:04:55,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 10:04:55,770 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:04:55,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:04:55,770 INFO L85 PathProgramCache]: Analyzing trace with hash 493178331, now seen corresponding path program 1 times [2023-11-23 10:04:55,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:04:55,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560820201] [2023-11-23 10:04:55,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:04:55,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:04:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:55,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:55,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:04:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:55,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:04:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:55,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:55,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:55,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:04:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:55,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:04:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:55,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:04:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:55,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:04:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:55,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:04:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:55,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:04:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:55,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:04:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:56,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:04:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:56,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:04:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:56,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:56,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:56,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:04:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:56,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:04:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-23 10:04:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:56,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:56,032 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-23 10:04:56,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:04:56,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560820201] [2023-11-23 10:04:56,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560820201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:04:56,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:04:56,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:04:56,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321472135] [2023-11-23 10:04:56,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:04:56,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:04:56,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:04:56,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:04:56,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:04:56,034 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-23 10:04:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:04:57,575 INFO L93 Difference]: Finished difference Result 2906 states and 4247 transitions. [2023-11-23 10:04:57,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 10:04:57,575 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-23 10:04:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:04:57,583 INFO L225 Difference]: With dead ends: 2906 [2023-11-23 10:04:57,583 INFO L226 Difference]: Without dead ends: 1977 [2023-11-23 10:04:57,585 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-23 10:04:57,587 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 405 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-23 10:04:57,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1421 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-23 10:04:57,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2023-11-23 10:04:57,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 941. [2023-11-23 10:04:57,635 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-23 10:04:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1306 transitions. [2023-11-23 10:04:57,639 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1306 transitions. Word has length 150 [2023-11-23 10:04:57,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:04:57,639 INFO L495 AbstractCegarLoop]: Abstraction has 941 states and 1306 transitions. [2023-11-23 10:04:57,639 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-23 10:04:57,640 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1306 transitions. [2023-11-23 10:04:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-23 10:04:57,641 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:04:57,641 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-23 10:04:57,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 10:04:57,642 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:04:57,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:04:57,642 INFO L85 PathProgramCache]: Analyzing trace with hash 79029050, now seen corresponding path program 1 times [2023-11-23 10:04:57,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:04:57,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833792859] [2023-11-23 10:04:57,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:04:57,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:04:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:04:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:04:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:04:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:04:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:04:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:04:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:04:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:04:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:04:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:04:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:04:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:04:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:04:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-23 10:04:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:57,911 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-23 10:04:57,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:04:57,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833792859] [2023-11-23 10:04:57,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833792859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:04:57,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:04:57,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:04:57,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210515408] [2023-11-23 10:04:57,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:04:57,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:04:57,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:04:57,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:04:57,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:04:57,913 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-23 10:04:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:04:59,454 INFO L93 Difference]: Finished difference Result 3090 states and 4533 transitions. [2023-11-23 10:04:59,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 10:04:59,454 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-23 10:04:59,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:04:59,462 INFO L225 Difference]: With dead ends: 3090 [2023-11-23 10:04:59,462 INFO L226 Difference]: Without dead ends: 2153 [2023-11-23 10:04:59,465 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-23 10:04:59,465 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 477 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-23 10:04:59,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1534 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-23 10:04:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2023-11-23 10:04:59,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 949. [2023-11-23 10:04:59,514 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-23 10:04:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1314 transitions. [2023-11-23 10:04:59,516 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1314 transitions. Word has length 151 [2023-11-23 10:04:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:04:59,517 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1314 transitions. [2023-11-23 10:04:59,517 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-23 10:04:59,517 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1314 transitions. [2023-11-23 10:04:59,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-23 10:04:59,519 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:04:59,519 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-23 10:04:59,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 10:04:59,519 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:04:59,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:04:59,520 INFO L85 PathProgramCache]: Analyzing trace with hash 258983410, now seen corresponding path program 1 times [2023-11-23 10:04:59,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:04:59,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71454044] [2023-11-23 10:04:59,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:04:59,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:04:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:04:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:04:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:04:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:04:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:04:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:04:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:04:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:04:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:04:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:04:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:04:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:04:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:04:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:04:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-23 10:04:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:04:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:04:59,799 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-23 10:04:59,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:04:59,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71454044] [2023-11-23 10:04:59,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71454044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:04:59,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:04:59,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:04:59,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752903246] [2023-11-23 10:04:59,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:04:59,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:04:59,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:04:59,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:04:59,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:04:59,801 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-23 10:05:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:05:00,917 INFO L93 Difference]: Finished difference Result 2278 states and 3223 transitions. [2023-11-23 10:05:00,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 10:05:00,917 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-23 10:05:00,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:05:00,922 INFO L225 Difference]: With dead ends: 2278 [2023-11-23 10:05:00,922 INFO L226 Difference]: Without dead ends: 1333 [2023-11-23 10:05:00,924 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-23 10:05:00,924 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 227 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 10:05:00,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 999 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 10:05:00,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2023-11-23 10:05:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1012. [2023-11-23 10:05:00,961 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-23 10:05:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1407 transitions. [2023-11-23 10:05:00,964 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1407 transitions. Word has length 151 [2023-11-23 10:05:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:05:00,964 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1407 transitions. [2023-11-23 10:05:00,964 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-23 10:05:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1407 transitions. [2023-11-23 10:05:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-23 10:05:00,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:05:00,966 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-23 10:05:00,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 10:05:00,966 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:05:00,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:05:00,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1845204848, now seen corresponding path program 1 times [2023-11-23 10:05:00,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:05:00,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687938640] [2023-11-23 10:05:00,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:05:00,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:05:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:05:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:05:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:05:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:05:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:05:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:05:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:05:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:05:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:05:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:05:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:05:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:05:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:05:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:05:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:05:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 10:05:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,213 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-23 10:05:01,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:05:01,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687938640] [2023-11-23 10:05:01,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687938640] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 10:05:01,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498344700] [2023-11-23 10:05:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:05:01,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:05:01,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:05:01,215 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-23 10:05:01,218 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-23 10:05:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:01,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 10:05:01,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 10:05:01,812 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-23 10:05:01,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 10:05:01,881 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-23 10:05:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498344700] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 10:05:01,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 10:05:01,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2023-11-23 10:05:01,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113687390] [2023-11-23 10:05:01,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 10:05:01,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 10:05:01,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:05:01,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 10:05:01,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 10:05:01,883 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-23 10:05:02,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:05:02,938 INFO L93 Difference]: Finished difference Result 2538 states and 3631 transitions. [2023-11-23 10:05:02,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 10:05:02,939 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-23 10:05:02,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:05:02,944 INFO L225 Difference]: With dead ends: 2538 [2023-11-23 10:05:02,944 INFO L226 Difference]: Without dead ends: 1530 [2023-11-23 10:05:02,946 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-23 10:05:02,947 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 208 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 10:05:02,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 998 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 10:05:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2023-11-23 10:05:03,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1316. [2023-11-23 10:05:03,006 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-23 10:05:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1855 transitions. [2023-11-23 10:05:03,009 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1855 transitions. Word has length 152 [2023-11-23 10:05:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:05:03,010 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1855 transitions. [2023-11-23 10:05:03,010 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-23 10:05:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1855 transitions. [2023-11-23 10:05:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-23 10:05:03,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:05:03,012 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-23 10:05:03,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-23 10:05:03,227 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-23 10:05:03,228 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:05:03,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:05:03,228 INFO L85 PathProgramCache]: Analyzing trace with hash -831682783, now seen corresponding path program 1 times [2023-11-23 10:05:03,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:05:03,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005802600] [2023-11-23 10:05:03,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:05:03,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:05:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:05:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:05:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:05:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:05:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:05:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:05:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:05:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:05:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:05:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:05:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:05:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:05:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:05:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:05:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:05:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 10:05:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-23 10:05:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:03,455 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-23 10:05:03,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:05:03,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005802600] [2023-11-23 10:05:03,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005802600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:05:03,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:05:03,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 10:05:03,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193356996] [2023-11-23 10:05:03,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:05:03,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 10:05:03,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:05:03,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 10:05:03,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 10:05:03,458 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-23 10:05:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:05:04,990 INFO L93 Difference]: Finished difference Result 2063 states and 2947 transitions. [2023-11-23 10:05:04,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 10:05:04,990 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-23 10:05:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:05:04,993 INFO L225 Difference]: With dead ends: 2063 [2023-11-23 10:05:04,993 INFO L226 Difference]: Without dead ends: 1057 [2023-11-23 10:05:04,995 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-23 10:05:04,995 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 396 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-23 10:05:04,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1031 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-23 10:05:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2023-11-23 10:05:05,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 983. [2023-11-23 10:05:05,026 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-23 10:05:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1371 transitions. [2023-11-23 10:05:05,029 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1371 transitions. Word has length 160 [2023-11-23 10:05:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:05:05,029 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 1371 transitions. [2023-11-23 10:05:05,029 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-23 10:05:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1371 transitions. [2023-11-23 10:05:05,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-11-23 10:05:05,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:05:05,032 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-23 10:05:05,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 10:05:05,032 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:05:05,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:05:05,032 INFO L85 PathProgramCache]: Analyzing trace with hash -611749994, now seen corresponding path program 1 times [2023-11-23 10:05:05,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:05:05,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449128617] [2023-11-23 10:05:05,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:05:05,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:05:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:05:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:05:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:05:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:05:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:05:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:05:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:05:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:05:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:05:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:05:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:05:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:05:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:05:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:05:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:05:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 10:05:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-23 10:05:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-23 10:05:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:05,257 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-23 10:05:05,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:05:05,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449128617] [2023-11-23 10:05:05,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449128617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:05:05,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:05:05,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:05:05,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844405909] [2023-11-23 10:05:05,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:05:05,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:05:05,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:05:05,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:05:05,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:05:05,259 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-23 10:05:06,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:05:06,455 INFO L93 Difference]: Finished difference Result 2634 states and 3786 transitions. [2023-11-23 10:05:06,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:05:06,456 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-23 10:05:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:05:06,469 INFO L225 Difference]: With dead ends: 2634 [2023-11-23 10:05:06,469 INFO L226 Difference]: Without dead ends: 1655 [2023-11-23 10:05:06,471 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-23 10:05:06,471 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 304 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-23 10:05:06,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1313 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-23 10:05:06,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2023-11-23 10:05:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 989. [2023-11-23 10:05:06,509 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-23 10:05:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1377 transitions. [2023-11-23 10:05:06,511 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1377 transitions. Word has length 180 [2023-11-23 10:05:06,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:05:06,511 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1377 transitions. [2023-11-23 10:05:06,511 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-23 10:05:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1377 transitions. [2023-11-23 10:05:06,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-23 10:05:06,514 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:05:06,514 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-23 10:05:06,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 10:05:06,514 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:05:06,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:05:06,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1212147252, now seen corresponding path program 1 times [2023-11-23 10:05:06,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:05:06,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884074073] [2023-11-23 10:05:06,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:05:06,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:05:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:05:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:05:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:05:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:05:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:05:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:05:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:05:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:05:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:05:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:05:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:05:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:05:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:05:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:05:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:05:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 10:05:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-23 10:05:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-23 10:05:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:06,735 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-23 10:05:06,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:05:06,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884074073] [2023-11-23 10:05:06,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884074073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:05:06,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:05:06,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 10:05:06,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202879831] [2023-11-23 10:05:06,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:05:06,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 10:05:06,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:05:06,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 10:05:06,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 10:05:06,738 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-23 10:05:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:05:07,811 INFO L93 Difference]: Finished difference Result 1899 states and 2651 transitions. [2023-11-23 10:05:07,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 10:05:07,812 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-23 10:05:07,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:05:07,815 INFO L225 Difference]: With dead ends: 1899 [2023-11-23 10:05:07,815 INFO L226 Difference]: Without dead ends: 914 [2023-11-23 10:05:07,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-23 10:05:07,817 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 470 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 10:05:07,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 610 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 10:05:07,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2023-11-23 10:05:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 843. [2023-11-23 10:05:07,877 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-23 10:05:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1155 transitions. [2023-11-23 10:05:07,879 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1155 transitions. Word has length 190 [2023-11-23 10:05:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:05:07,879 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 1155 transitions. [2023-11-23 10:05:07,879 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-23 10:05:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1155 transitions. [2023-11-23 10:05:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-23 10:05:07,882 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:05:07,882 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-23 10:05:07,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 10:05:07,882 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:05:07,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:05:07,882 INFO L85 PathProgramCache]: Analyzing trace with hash 836152208, now seen corresponding path program 2 times [2023-11-23 10:05:07,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:05:07,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201011363] [2023-11-23 10:05:07,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:05:07,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:05:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:05:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:05:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:05:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:05:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:05:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:05:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:05:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:05:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:05:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:05:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:05:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:05:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:05:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:05:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:05:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 10:05:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-23 10:05:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-23 10:05:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:05:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:05:08,292 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-23 10:05:08,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:05:08,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201011363] [2023-11-23 10:05:08,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201011363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:05:08,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:05:08,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 10:05:08,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509002104] [2023-11-23 10:05:08,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:05:08,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 10:05:08,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:05:08,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 10:05:08,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 10:05:08,295 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-23 10:05:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:05:09,372 INFO L93 Difference]: Finished difference Result 1214 states and 1697 transitions. [2023-11-23 10:05:09,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 10:05:09,376 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-23 10:05:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:05:09,377 INFO L225 Difference]: With dead ends: 1214 [2023-11-23 10:05:09,377 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 10:05:09,379 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-23 10:05:09,379 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 968 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 10:05:09,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 622 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 10:05:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 10:05:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 10:05:09,380 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-23 10:05:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 10:05:09,380 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 190 [2023-11-23 10:05:09,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:05:09,380 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 10:05:09,381 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-23 10:05:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 10:05:09,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 10:05:09,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 10:05:09,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 10:05:09,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 10:05:33,429 INFO L899 garLoopResultBuilder]: For program point L1630(line 1630) no Hoare annotation was computed. [2023-11-23 10:05:33,429 INFO L899 garLoopResultBuilder]: For program point L1629(lines 1629 1631) no Hoare annotation was computed. [2023-11-23 10:05:33,429 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1634 1643) no Hoare annotation was computed. [2023-11-23 10:05:33,429 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-23 10:05:33,429 INFO L902 garLoopResultBuilder]: At program point L1638(line 1638) the Hoare annotation is: true [2023-11-23 10:05:33,430 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1634 1643) no Hoare annotation was computed. [2023-11-23 10:05:33,430 INFO L899 garLoopResultBuilder]: For program point L1638-1(line 1638) no Hoare annotation was computed. [2023-11-23 10:05:33,430 INFO L899 garLoopResultBuilder]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2023-11-23 10:05:33,430 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 2594 2596) no Hoare annotation was computed. [2023-11-23 10:05:33,430 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-23 10:05:33,430 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 2412 2417) the Hoare annotation is: true [2023-11-23 10:05:33,430 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2415) no Hoare annotation was computed. [2023-11-23 10:05:33,430 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2412 2417) no Hoare annotation was computed. [2023-11-23 10:05:33,431 INFO L899 garLoopResultBuilder]: For program point L1567(line 1567) no Hoare annotation was computed. [2023-11-23 10:05:33,431 INFO L899 garLoopResultBuilder]: For program point L1567-2(line 1567) no Hoare annotation was computed. [2023-11-23 10:05:33,431 INFO L899 garLoopResultBuilder]: For program point L1567-4(line 1567) no Hoare annotation was computed. [2023-11-23 10:05:33,431 INFO L899 garLoopResultBuilder]: For program point extract_valueEXIT(lines 1676 1683) no Hoare annotation was computed. [2023-11-23 10:05:33,431 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1676 1683) the Hoare annotation is: true [2023-11-23 10:05:33,431 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2553 2555) the Hoare annotation is: true [2023-11-23 10:05:33,431 INFO L899 garLoopResultBuilder]: For program point ipmi_destroy_userEXIT(lines 2553 2555) no Hoare annotation was computed. [2023-11-23 10:05:33,431 INFO L899 garLoopResultBuilder]: For program point wait_for_completionEXIT(lines 2590 2592) no Hoare annotation was computed. [2023-11-23 10:05:33,431 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2590 2592) the Hoare annotation is: true [2023-11-23 10:05:33,431 INFO L899 garLoopResultBuilder]: For program point L2203-1(line 2203) no Hoare annotation was computed. [2023-11-23 10:05:33,432 INFO L902 garLoopResultBuilder]: At program point L2234(line 2234) the Hoare annotation is: true [2023-11-23 10:05:33,432 INFO L895 garLoopResultBuilder]: At program point L2203(line 2203) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-23 10:05:33,432 INFO L902 garLoopResultBuilder]: At program point L2232(line 2232) the Hoare annotation is: true [2023-11-23 10:05:33,432 INFO L902 garLoopResultBuilder]: At program point L2230(line 2230) the Hoare annotation is: true [2023-11-23 10:05:33,432 INFO L899 garLoopResultBuilder]: For program point L2232-1(line 2232) no Hoare annotation was computed. [2023-11-23 10:05:33,432 INFO L899 garLoopResultBuilder]: For program point ibmpex_bmc_deleteEXIT(lines 2197 2237) no Hoare annotation was computed. [2023-11-23 10:05:33,432 INFO L899 garLoopResultBuilder]: For program point L2230-1(line 2230) no Hoare annotation was computed. [2023-11-23 10:05:33,432 INFO L899 garLoopResultBuilder]: For program point L2224(lines 2201 2236) no Hoare annotation was computed. [2023-11-23 10:05:33,433 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2197 2237) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-23 10:05:33,433 INFO L899 garLoopResultBuilder]: For program point L2216(lines 2201 2236) no Hoare annotation was computed. [2023-11-23 10:05:33,433 INFO L902 garLoopResultBuilder]: At program point L2214(line 2214) the Hoare annotation is: true [2023-11-23 10:05:33,433 INFO L899 garLoopResultBuilder]: For program point $Ultimate##4(lines 2219 2222) no Hoare annotation was computed. [2023-11-23 10:05:33,433 INFO L899 garLoopResultBuilder]: For program point L2214-1(line 2214) no Hoare annotation was computed. [2023-11-23 10:05:33,433 INFO L899 garLoopResultBuilder]: For program point L2210(lines 2210 2213) no Hoare annotation was computed. [2023-11-23 10:05:33,433 INFO L895 garLoopResultBuilder]: At program point L2202(line 2202) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-23 10:05:33,433 INFO L899 garLoopResultBuilder]: For program point L2233-1(line 2233) no Hoare annotation was computed. [2023-11-23 10:05:33,433 INFO L899 garLoopResultBuilder]: For program point L2202-1(line 2202) no Hoare annotation was computed. [2023-11-23 10:05:33,433 INFO L902 garLoopResultBuilder]: At program point L2233(line 2233) the Hoare annotation is: true [2023-11-23 10:05:33,434 INFO L899 garLoopResultBuilder]: For program point L2231-1(line 2231) no Hoare annotation was computed. [2023-11-23 10:05:33,434 INFO L902 garLoopResultBuilder]: At program point L2231(line 2231) the Hoare annotation is: true [2023-11-23 10:05:33,434 INFO L899 garLoopResultBuilder]: For program point L2225(lines 2225 2228) no Hoare annotation was computed. [2023-11-23 10:05:33,434 INFO L899 garLoopResultBuilder]: For program point ibmpex_bmc_deleteFINAL(lines 2197 2237) no Hoare annotation was computed. [2023-11-23 10:05:33,434 INFO L899 garLoopResultBuilder]: For program point L2215-1(line 2215) no Hoare annotation was computed. [2023-11-23 10:05:33,434 INFO L902 garLoopResultBuilder]: At program point L2215(line 2215) the Hoare annotation is: true [2023-11-23 10:05:33,434 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 2424 2429) no Hoare annotation was computed. [2023-11-23 10:05:33,434 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2424 2429) the Hoare annotation is: true [2023-11-23 10:05:33,434 INFO L899 garLoopResultBuilder]: For program point ibmpex_send_messageEXIT(lines 1695 1719) no Hoare annotation was computed. [2023-11-23 10:05:33,435 INFO L899 garLoopResultBuilder]: For program point ibmpex_send_messageFINAL(lines 1695 1719) no Hoare annotation was computed. [2023-11-23 10:05:33,435 INFO L895 garLoopResultBuilder]: At program point L1716(line 1716) the Hoare annotation is: (let ((.cse2 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse0 (and (= |old(#memory_$Pointer$#6.offset)| |#memory_$Pointer$#6.offset|) (= |old(#memory_$Pointer$#6.base)| |#memory_$Pointer$#6.base|) (= |#memory_int#6| |old(#memory_int#6)|))) (.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))) (or .cse0 .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0))) (or .cse0 (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse1))) [2023-11-23 10:05:33,435 INFO L899 garLoopResultBuilder]: For program point L1716-1(line 1716) no Hoare annotation was computed. [2023-11-23 10:05:33,435 INFO L902 garLoopResultBuilder]: At program point L1713(line 1713) the Hoare annotation is: true [2023-11-23 10:05:33,435 INFO L899 garLoopResultBuilder]: For program point L1713-1(line 1713) no Hoare annotation was computed. [2023-11-23 10:05:33,435 INFO L899 garLoopResultBuilder]: For program point L1707(lines 1707 1710) no Hoare annotation was computed. [2023-11-23 10:05:33,435 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1695 1719) the Hoare annotation is: (let ((.cse2 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse0 (and (= |old(#memory_$Pointer$#6.offset)| |#memory_$Pointer$#6.offset|) (= |old(#memory_$Pointer$#6.base)| |#memory_$Pointer$#6.base|) (= |#memory_int#6| |old(#memory_int#6)|))) (.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))) (or .cse0 .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0))) (or .cse0 (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse1))) [2023-11-23 10:05:33,435 INFO L899 garLoopResultBuilder]: For program point L1700(lines 1700 1703) no Hoare annotation was computed. [2023-11-23 10:05:33,436 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 2536 2538) no Hoare annotation was computed. [2023-11-23 10:05:33,436 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2536 2538) the Hoare annotation is: true [2023-11-23 10:05:33,436 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-23 10:05:33,436 INFO L899 garLoopResultBuilder]: For program point L2476(lines 2476 2479) no Hoare annotation was computed. [2023-11-23 10:05:33,436 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-23 10:05:33,436 INFO L899 garLoopResultBuilder]: For program point L2473-1(lines 2473 2481) no Hoare annotation was computed. [2023-11-23 10:05:33,436 INFO L899 garLoopResultBuilder]: For program point L2473(lines 2473 2481) no Hoare annotation was computed. [2023-11-23 10:05:33,436 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-23 10:05:33,437 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2545 2547) the Hoare annotation is: true [2023-11-23 10:05:33,437 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 2545 2547) no Hoare annotation was computed. [2023-11-23 10:05:33,437 INFO L899 garLoopResultBuilder]: For program point dev_errEXIT(lines 2530 2532) no Hoare annotation was computed. [2023-11-23 10:05:33,437 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2530 2532) the Hoare annotation is: true [2023-11-23 10:05:33,437 INFO L899 garLoopResultBuilder]: For program point L1662(line 1662) no Hoare annotation was computed. [2023-11-23 10:05:33,437 INFO L899 garLoopResultBuilder]: For program point L1662-2(line 1662) no Hoare annotation was computed. [2023-11-23 10:05:33,437 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-23 10:05:33,437 INFO L899 garLoopResultBuilder]: For program point L1662-5(line 1662) no Hoare annotation was computed. [2023-11-23 10:05:33,438 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-23 10:05:33,438 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 1658 1665) no Hoare annotation was computed. [2023-11-23 10:05:33,438 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-23 10:05:33,438 INFO L899 garLoopResultBuilder]: For program point L1646-1(line 1646) no Hoare annotation was computed. [2023-11-23 10:05:33,438 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-23 10:05:33,438 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 1649 1656) no Hoare annotation was computed. [2023-11-23 10:05:33,438 INFO L899 garLoopResultBuilder]: For program point ldv_handler_precallEXIT(lines 2578 2580) no Hoare annotation was computed. [2023-11-23 10:05:33,438 INFO L902 garLoopResultBuilder]: At program point ldv_handler_precallFINAL(lines 2578 2580) the Hoare annotation is: true [2023-11-23 10:05:33,438 INFO L899 garLoopResultBuilder]: For program point ipmi_free_recv_msgEXIT(lines 2556 2558) no Hoare annotation was computed. [2023-11-23 10:05:33,439 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2556 2558) the Hoare annotation is: true [2023-11-23 10:05:33,439 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2539 2541) the Hoare annotation is: true [2023-11-23 10:05:33,439 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 2539 2541) no Hoare annotation was computed. [2023-11-23 10:05:33,439 INFO L899 garLoopResultBuilder]: For program point ibmpex_query_sensor_name_returnLabel#1(lines 1755 1769) no Hoare annotation was computed. [2023-11-23 10:05:33,439 INFO L899 garLoopResultBuilder]: For program point L2282(line 2282) no Hoare annotation was computed. [2023-11-23 10:05:33,439 INFO L899 garLoopResultBuilder]: For program point L2249-1(lines 2238 2252) no Hoare annotation was computed. [2023-11-23 10:05:33,439 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-23 10:05:33,439 INFO L899 garLoopResultBuilder]: For program point L2084(lines 2084 2087) no Hoare annotation was computed. [2023-11-23 10:05:33,439 INFO L899 garLoopResultBuilder]: For program point L1985(lines 1985 1988) no Hoare annotation was computed. [2023-11-23 10:05:33,440 INFO L899 garLoopResultBuilder]: For program point ibmpex_find_sensors_returnLabel#1(lines 2012 2130) no Hoare annotation was computed. [2023-11-23 10:05:33,440 INFO L899 garLoopResultBuilder]: For program point L1920(lines 1920 1923) no Hoare annotation was computed. [2023-11-23 10:05:33,440 INFO L899 garLoopResultBuilder]: For program point L2350(line 2350) no Hoare annotation was computed. [2023-11-23 10:05:33,440 INFO L899 garLoopResultBuilder]: For program point L2383-1(line 2383) no Hoare annotation was computed. [2023-11-23 10:05:33,440 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-23 10:05:33,440 INFO L899 garLoopResultBuilder]: For program point L1954(lines 1954 1957) no Hoare annotation was computed. [2023-11-23 10:05:33,440 INFO L899 garLoopResultBuilder]: For program point L2351-1(line 2351) no Hoare annotation was computed. [2023-11-23 10:05:33,440 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-23 10:05:33,440 INFO L899 garLoopResultBuilder]: For program point L2153(lines 2153 2158) no Hoare annotation was computed. [2023-11-23 10:05:33,441 INFO L899 garLoopResultBuilder]: For program point L1856(lines 1856 1859) no Hoare annotation was computed. [2023-11-23 10:05:33,441 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-23 10:05:33,441 INFO L899 garLoopResultBuilder]: For program point L2154-1(lines 2154 2155) no Hoare annotation was computed. [2023-11-23 10:05:33,441 INFO L899 garLoopResultBuilder]: For program point L1989(lines 1989 1995) no Hoare annotation was computed. [2023-11-23 10:05:33,441 INFO L899 garLoopResultBuilder]: For program point L2122(lines 2024 2129) no Hoare annotation was computed. [2023-11-23 10:05:33,441 INFO L899 garLoopResultBuilder]: For program point L2089(lines 2089 2092) no Hoare annotation was computed. [2023-11-23 10:05:33,441 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-23 10:05:33,441 INFO L899 garLoopResultBuilder]: For program point L1726-1(line 1726) no Hoare annotation was computed. [2023-11-23 10:05:33,441 INFO L899 garLoopResultBuilder]: For program point L2354(line 2354) no Hoare annotation was computed. [2023-11-23 10:05:33,442 INFO L899 garLoopResultBuilder]: For program point L2189-1(line 2189) no Hoare annotation was computed. [2023-11-23 10:05:33,442 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-23 10:05:33,442 INFO L899 garLoopResultBuilder]: For program point L2123(lines 2123 2126) no Hoare annotation was computed. [2023-11-23 10:05:33,442 INFO L899 garLoopResultBuilder]: For program point L2057(lines 2057 2064) no Hoare annotation was computed. [2023-11-23 10:05:33,442 INFO L899 garLoopResultBuilder]: For program point L2057-1(lines 2048 2065) no Hoare annotation was computed. [2023-11-23 10:05:33,442 INFO L899 garLoopResultBuilder]: For program point L1925(lines 1925 1928) no Hoare annotation was computed. [2023-11-23 10:05:33,442 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-23 10:05:33,442 INFO L899 garLoopResultBuilder]: For program point L1727-1(line 1727) no Hoare annotation was computed. [2023-11-23 10:05:33,442 INFO L899 garLoopResultBuilder]: For program point L2355-1(line 2355) no Hoare annotation was computed. [2023-11-23 10:05:33,443 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-23 10:05:33,443 INFO L899 garLoopResultBuilder]: For program point L2190(lines 2138 2195) no Hoare annotation was computed. [2023-11-23 10:05:33,443 INFO L899 garLoopResultBuilder]: For program point L1992(lines 1992 1995) no Hoare annotation was computed. [2023-11-23 10:05:33,443 INFO L899 garLoopResultBuilder]: For program point L1992-2(lines 1989 1995) no Hoare annotation was computed. [2023-11-23 10:05:33,443 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-23 10:05:33,443 INFO L899 garLoopResultBuilder]: For program point L1728(line 1728) no Hoare annotation was computed. [2023-11-23 10:05:33,443 INFO L899 garLoopResultBuilder]: For program point L1761-1(line 1761) no Hoare annotation was computed. [2023-11-23 10:05:33,443 INFO L899 garLoopResultBuilder]: For program point L1728-2(lines 1728 1731) no Hoare annotation was computed. [2023-11-23 10:05:33,443 INFO L899 garLoopResultBuilder]: For program point L2191-1(line 2191) no Hoare annotation was computed. [2023-11-23 10:05:33,444 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-23 10:05:33,444 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-23 10:05:33,444 INFO L899 garLoopResultBuilder]: For program point L1762-1(line 1762) no Hoare annotation was computed. [2023-11-23 10:05:33,444 INFO L899 garLoopResultBuilder]: For program point L2489-1(lines 2489 2497) no Hoare annotation was computed. [2023-11-23 10:05:33,444 INFO L899 garLoopResultBuilder]: For program point L2489(lines 2489 2497) no Hoare annotation was computed. [2023-11-23 10:05:33,444 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-23 10:05:33,444 INFO L899 garLoopResultBuilder]: For program point L1763(line 1763) no Hoare annotation was computed. [2023-11-23 10:05:33,444 INFO L899 garLoopResultBuilder]: For program point L1763-2(lines 1763 1766) no Hoare annotation was computed. [2023-11-23 10:05:33,444 INFO L899 garLoopResultBuilder]: For program point L2358(line 2358) no Hoare annotation was computed. [2023-11-23 10:05:33,445 INFO L899 garLoopResultBuilder]: For program point L2193(line 2193) no Hoare annotation was computed. [2023-11-23 10:05:33,445 INFO L899 garLoopResultBuilder]: For program point L2094(lines 2094 2097) no Hoare annotation was computed. [2023-11-23 10:05:33,445 INFO L899 garLoopResultBuilder]: For program point L2127-1(line 2127) no Hoare annotation was computed. [2023-11-23 10:05:33,445 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-23 10:05:33,445 INFO L899 garLoopResultBuilder]: For program point L2028(lines 2028 2031) no Hoare annotation was computed. [2023-11-23 10:05:33,445 INFO L899 garLoopResultBuilder]: For program point L2359-1(line 2359) no Hoare annotation was computed. [2023-11-23 10:05:33,445 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-23 10:05:33,445 INFO L899 garLoopResultBuilder]: For program point L1963(lines 1963 1966) no Hoare annotation was computed. [2023-11-23 10:05:33,445 INFO L899 garLoopResultBuilder]: For program point L2492(lines 2492 2495) no Hoare annotation was computed. [2023-11-23 10:05:33,446 INFO L899 garLoopResultBuilder]: For program point L2261(lines 2261 2267) no Hoare annotation was computed. [2023-11-23 10:05:33,446 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-23 10:05:33,446 INFO L899 garLoopResultBuilder]: For program point L2262-1(lines 2262 2263) no Hoare annotation was computed. [2023-11-23 10:05:33,446 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-23 10:05:33,446 INFO L899 garLoopResultBuilder]: For program point L1734-1(line 1734) no Hoare annotation was computed. [2023-11-23 10:05:33,446 INFO L895 garLoopResultBuilder]: At program point L2494(line 2494) the Hoare annotation is: false [2023-11-23 10:05:33,446 INFO L899 garLoopResultBuilder]: For program point ibmpex_register_bmc_returnLabel#1(lines 2131 2196) no Hoare annotation was computed. [2023-11-23 10:05:33,446 INFO L899 garLoopResultBuilder]: For program point L2362(line 2362) no Hoare annotation was computed. [2023-11-23 10:05:33,446 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-23 10:05:33,447 INFO L899 garLoopResultBuilder]: For program point L2264-1(lines 2254 2286) no Hoare annotation was computed. [2023-11-23 10:05:33,447 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-23 10:05:33,447 INFO L899 garLoopResultBuilder]: For program point L2033-1(line 2033) no Hoare annotation was computed. [2023-11-23 10:05:33,447 INFO L899 garLoopResultBuilder]: For program point L2166(lines 2166 2169) no Hoare annotation was computed. [2023-11-23 10:05:33,447 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-23 10:05:33,447 INFO L899 garLoopResultBuilder]: For program point L2100-1(line 2100) no Hoare annotation was computed. [2023-11-23 10:05:33,447 INFO L899 garLoopResultBuilder]: For program point L2365(lines 2337 2377) no Hoare annotation was computed. [2023-11-23 10:05:33,447 INFO L899 garLoopResultBuilder]: For program point L2101-1(line 2101) no Hoare annotation was computed. [2023-11-23 10:05:33,448 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-23 10:05:33,448 INFO L899 garLoopResultBuilder]: For program point L2035(lines 2035 2038) no Hoare annotation was computed. [2023-11-23 10:05:33,449 INFO L899 garLoopResultBuilder]: For program point L1936(lines 1936 1939) no Hoare annotation was computed. [2023-11-23 10:05:33,449 INFO L899 garLoopResultBuilder]: For program point L2399-1(line 2399) no Hoare annotation was computed. [2023-11-23 10:05:33,449 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-23 10:05:33,449 INFO L899 garLoopResultBuilder]: For program point $Ultimate##93(lines 1864 1867) no Hoare annotation was computed. [2023-11-23 10:05:33,449 INFO L899 garLoopResultBuilder]: For program point is_power_sensor_returnLabel#1(lines 1916 1931) no Hoare annotation was computed. [2023-11-23 10:05:33,449 INFO L899 garLoopResultBuilder]: For program point L2003(lines 2003 2008) no Hoare annotation was computed. [2023-11-23 10:05:33,449 INFO L899 garLoopResultBuilder]: For program point $Ultimate##83(lines 2117 2120) no Hoare annotation was computed. [2023-11-23 10:05:33,449 INFO L899 garLoopResultBuilder]: For program point get_bmc_data_returnLabel#1(lines 1842 1870) no Hoare annotation was computed. [2023-11-23 10:05:33,450 INFO L899 garLoopResultBuilder]: For program point L2368(lines 2368 2371) no Hoare annotation was computed. [2023-11-23 10:05:33,450 INFO L899 garLoopResultBuilder]: For program point L2269(lines 2269 2273) no Hoare annotation was computed. [2023-11-23 10:05:33,450 INFO L902 garLoopResultBuilder]: At program point ibmpex_exit_ldv_17748#1(lines 2302 2320) the Hoare annotation is: true [2023-11-23 10:05:33,450 INFO L899 garLoopResultBuilder]: For program point L2269-2(lines 2269 2273) no Hoare annotation was computed. [2023-11-23 10:05:33,450 INFO L899 garLoopResultBuilder]: For program point L2071(lines 2071 2074) no Hoare annotation was computed. [2023-11-23 10:05:33,450 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-23 10:05:33,450 INFO L899 garLoopResultBuilder]: For program point L2005-1(line 2005) no Hoare annotation was computed. [2023-11-23 10:05:33,451 INFO L899 garLoopResultBuilder]: For program point create_sensor_returnLabel#1(lines 1976 2011) no Hoare annotation was computed. [2023-11-23 10:05:33,451 INFO L899 garLoopResultBuilder]: For program point $Ultimate##73(lines 2077 2080) no Hoare annotation was computed. [2023-11-23 10:05:33,451 INFO L899 garLoopResultBuilder]: For program point ibmpex_find_sensors_exit_remove#1(lines 2024 2129) no Hoare annotation was computed. [2023-11-23 10:05:33,451 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 10:05:33,451 INFO L899 garLoopResultBuilder]: For program point L2172(lines 2172 2177) no Hoare annotation was computed. [2023-11-23 10:05:33,452 INFO L899 garLoopResultBuilder]: For program point L2139-1(line 2139) no Hoare annotation was computed. [2023-11-23 10:05:33,452 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-23 10:05:33,452 INFO L899 garLoopResultBuilder]: For program point L1941(lines 1941 1944) no Hoare annotation was computed. [2023-11-23 10:05:33,452 INFO L899 garLoopResultBuilder]: For program point L2173-1(lines 2173 2174) no Hoare annotation was computed. [2023-11-23 10:05:33,452 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-23 10:05:33,452 INFO L902 garLoopResultBuilder]: At program point L2372(line 2372) the Hoare annotation is: true [2023-11-23 10:05:33,452 INFO L899 garLoopResultBuilder]: For program point $Ultimate##45(lines 1969 1972) no Hoare annotation was computed. [2023-11-23 10:05:33,452 INFO L899 garLoopResultBuilder]: For program point L2372-1(line 2372) no Hoare annotation was computed. [2023-11-23 10:05:33,452 INFO L899 garLoopResultBuilder]: For program point L2108(lines 2108 2111) no Hoare annotation was computed. [2023-11-23 10:05:33,453 INFO L899 garLoopResultBuilder]: For program point L2141(lines 2141 2145) no Hoare annotation was computed. [2023-11-23 10:05:33,453 INFO L899 garLoopResultBuilder]: For program point ibmpex_ver_check_returnLabel#1(lines 1720 1740) no Hoare annotation was computed. [2023-11-23 10:05:33,453 INFO L899 garLoopResultBuilder]: For program point is_temp_sensor_returnLabel#1(lines 1932 1947) no Hoare annotation was computed. [2023-11-23 10:05:33,453 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-23 10:05:33,453 INFO L899 garLoopResultBuilder]: For program point L2274(lines 2274 2281) no Hoare annotation was computed. [2023-11-23 10:05:33,453 INFO L899 garLoopResultBuilder]: For program point L2340-1(line 2340) no Hoare annotation was computed. [2023-11-23 10:05:33,453 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-23 10:05:33,453 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-23 10:05:33,453 INFO L899 garLoopResultBuilder]: For program point L2142-1(line 2142) no Hoare annotation was computed. [2023-11-23 10:05:33,454 INFO L899 garLoopResultBuilder]: For program point L2043(lines 2043 2046) no Hoare annotation was computed. [2023-11-23 10:05:33,454 INFO L899 garLoopResultBuilder]: For program point power_sensor_multiplier_returnLabel#1(lines 1948 1975) no Hoare annotation was computed. [2023-11-23 10:05:33,454 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-23 10:05:33,454 INFO L899 garLoopResultBuilder]: For program point L1746-1(line 1746) no Hoare annotation was computed. [2023-11-23 10:05:33,454 INFO L899 garLoopResultBuilder]: For program point L2407-1(line 2407) no Hoare annotation was computed. [2023-11-23 10:05:33,454 INFO L899 garLoopResultBuilder]: For program point L2374(lines 2337 2377) no Hoare annotation was computed. [2023-11-23 10:05:33,454 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-23 10:05:33,454 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-23 10:05:33,454 INFO L899 garLoopResultBuilder]: For program point L1747-1(line 1747) no Hoare annotation was computed. [2023-11-23 10:05:33,455 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 10:05:33,455 INFO L899 garLoopResultBuilder]: For program point L2342(lines 2342 2345) no Hoare annotation was computed. [2023-11-23 10:05:33,455 INFO L899 garLoopResultBuilder]: For program point L1748(line 1748) no Hoare annotation was computed. [2023-11-23 10:05:33,455 INFO L899 garLoopResultBuilder]: For program point L1748-2(lines 1748 1751) no Hoare annotation was computed. [2023-11-23 10:05:33,455 INFO L899 garLoopResultBuilder]: For program point L2310(line 2310) no Hoare annotation was computed. [2023-11-23 10:05:33,455 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-23 10:05:33,455 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-23 10:05:33,455 INFO L899 garLoopResultBuilder]: For program point L2178-1(line 2178) no Hoare annotation was computed. [2023-11-23 10:05:33,455 INFO L899 garLoopResultBuilder]: For program point L2112-1(line 2112) no Hoare annotation was computed. [2023-11-23 10:05:33,456 INFO L899 garLoopResultBuilder]: For program point L2245(lines 2245 2248) no Hoare annotation was computed. [2023-11-23 10:05:33,456 INFO L899 garLoopResultBuilder]: For program point L2113-1(line 2113) no Hoare annotation was computed. [2023-11-23 10:05:33,456 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-23 10:05:33,456 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-23 10:05:33,456 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-23 10:05:33,456 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2023-11-23 10:05:33,456 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-23 10:05:33,456 INFO L899 garLoopResultBuilder]: For program point L2114(lines 2024 2129) no Hoare annotation was computed. [2023-11-23 10:05:33,456 INFO L899 garLoopResultBuilder]: For program point L2081(lines 2024 2129) no Hoare annotation was computed. [2023-11-23 10:05:33,457 INFO L899 garLoopResultBuilder]: For program point L2048(lines 2048 2065) no Hoare annotation was computed. [2023-11-23 10:05:33,457 INFO L899 garLoopResultBuilder]: For program point ibmpex_query_sensor_count_returnLabel#1(lines 1741 1754) no Hoare annotation was computed. [2023-11-23 10:05:33,457 INFO L899 garLoopResultBuilder]: For program point L2181(lines 2181 2186) no Hoare annotation was computed. [2023-11-23 10:05:33,457 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-23 10:05:33,457 INFO L899 garLoopResultBuilder]: For program point $Ultimate##117(lines 2315 2318) no Hoare annotation was computed. [2023-11-23 10:05:33,457 INFO L899 garLoopResultBuilder]: For program point L1983-1(line 1983) no Hoare annotation was computed. [2023-11-23 10:05:33,457 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-23 10:05:33,457 INFO L899 garLoopResultBuilder]: For program point L2182-1(lines 2182 2183) no Hoare annotation was computed. [2023-11-23 10:05:33,457 INFO L899 garLoopResultBuilder]: For program point L2083(lines 2024 2129) no Hoare annotation was computed. [2023-11-23 10:05:33,460 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:05:33,462 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 10:05:33,477 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-23 10:05:33,477 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-23 10:05:33,478 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-23 10:05:33,478 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-23 10:05:33,478 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-23 10:05:33,478 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-23 10:05:33,478 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-23 10:05:33,478 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-23 10:05:33,478 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-23 10:05:33,478 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-23 10:05:33,479 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-23 10:05:33,479 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-23 10:05:33,479 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-23 10:05:33,479 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-23 10:05:33,479 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-23 10:05:33,479 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-23 10:05:33,479 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-23 10:05:33,480 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-23 10:05:33,480 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-23 10:05:33,480 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-23 10:05:33,480 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-23 10:05:33,480 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-23 10:05:33,480 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-23 10:05:33,480 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-23 10:05:33,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:05:33 BoogieIcfgContainer [2023-11-23 10:05:33,481 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 10:05:33,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 10:05:33,481 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 10:05:33,482 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 10:05:33,482 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:04:44" (3/4) ... [2023-11-23 10:05:33,484 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 10:05:33,486 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2023-11-23 10:05:33,486 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_destroy_user [2023-11-23 10:05:33,486 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-23 10:05:33,487 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2023-11-23 10:05:33,487 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure wait_for_completion [2023-11-23 10:05:33,487 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2023-11-23 10:05:33,487 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2023-11-23 10:05:33,487 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2023-11-23 10:05:33,487 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_free_recv_msg [2023-11-23 10:05:33,487 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-11-23 10:05:33,487 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_send_message [2023-11-23 10:05:33,487 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2023-11-23 10:05:33,487 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2023-11-23 10:05:33,487 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2023-11-23 10:05:33,487 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2023-11-23 10:05:33,488 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure extract_value [2023-11-23 10:05:33,488 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_bmc_delete [2023-11-23 10:05:33,488 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2023-11-23 10:05:33,507 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 167 nodes and edges [2023-11-23 10:05:33,508 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2023-11-23 10:05:33,509 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-11-23 10:05:33,510 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-23 10:05:33,511 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 10:05:33,512 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 10:05:33,642 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 10:05:33,642 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 10:05:33,642 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 10:05:33,643 INFO L158 Benchmark]: Toolchain (without parser) took 51699.97ms. Allocated memory was 146.8MB in the beginning and 1.1GB in the end (delta: 935.3MB). Free memory was 69.5MB in the beginning and 1.0GB in the end (delta: -950.6MB). Peak memory consumption was 627.2MB. Max. memory is 16.1GB. [2023-11-23 10:05:33,643 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 10:05:33,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 676.73ms. Allocated memory was 146.8MB in the beginning and 197.1MB in the end (delta: 50.3MB). Free memory was 69.4MB in the beginning and 126.8MB in the end (delta: -57.4MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2023-11-23 10:05:33,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.66ms. Allocated memory is still 197.1MB. Free memory was 126.8MB in the beginning and 117.5MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-23 10:05:33,644 INFO L158 Benchmark]: Boogie Preprocessor took 227.55ms. Allocated memory is still 197.1MB. Free memory was 117.5MB in the beginning and 87.1MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-23 10:05:33,644 INFO L158 Benchmark]: RCFGBuilder took 1257.78ms. Allocated memory is still 197.1MB. Free memory was 87.1MB in the beginning and 72.7MB in the end (delta: 14.3MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2023-11-23 10:05:33,644 INFO L158 Benchmark]: TraceAbstraction took 49255.14ms. Allocated memory was 197.1MB in the beginning and 1.1GB in the end (delta: 885.0MB). Free memory was 150.4MB in the beginning and 398.1MB in the end (delta: -247.8MB). Peak memory consumption was 661.5MB. Max. memory is 16.1GB. [2023-11-23 10:05:33,644 INFO L158 Benchmark]: Witness Printer took 160.80ms. Allocated memory is still 1.1GB. Free memory was 398.1MB in the beginning and 1.0GB in the end (delta: -621.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-23 10:05:33,645 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 676.73ms. Allocated memory was 146.8MB in the beginning and 197.1MB in the end (delta: 50.3MB). Free memory was 69.4MB in the beginning and 126.8MB in the end (delta: -57.4MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.66ms. Allocated memory is still 197.1MB. Free memory was 126.8MB in the beginning and 117.5MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 227.55ms. Allocated memory is still 197.1MB. Free memory was 117.5MB in the beginning and 87.1MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1257.78ms. Allocated memory is still 197.1MB. Free memory was 87.1MB in the beginning and 72.7MB in the end (delta: 14.3MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. * TraceAbstraction took 49255.14ms. Allocated memory was 197.1MB in the beginning and 1.1GB in the end (delta: 885.0MB). Free memory was 150.4MB in the beginning and 398.1MB in the end (delta: -247.8MB). Peak memory consumption was 661.5MB. Max. memory is 16.1GB. * Witness Printer took 160.80ms. Allocated memory is still 1.1GB. Free memory was 398.1MB in the beginning and 1.0GB in the end (delta: -621.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2415]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 239 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.2s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 24.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6332 SdHoareTripleChecker+Valid, 16.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5785 mSDsluCounter, 15196 SdHoareTripleChecker+Invalid, 15.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10213 mSDsCounter, 2833 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10748 IncrementalHoareTripleChecker+Invalid, 13581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2833 mSolverCounterUnsat, 4983 mSDtfsCounter, 10748 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1171 GetRequests, 1067 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1316occurred in iteration=12, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 4772 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 74 LocationsWithAnnotation, 3384 PreInvPairs, 3669 NumberOfFragments, 2236 HoareAnnotationTreeSize, 3384 FomulaSimplifications, 32470958 FormulaSimplificationTreeSizeReduction, 19.2s HoareSimplificationTime, 74 FomulaSimplificationsInter, 125730 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.2s 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-23 10:05:33,664 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