./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 07:51:04,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 07:51:04,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-13 07:51:04,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 07:51:04,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 07:51:04,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 07:51:04,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 07:51:04,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 07:51:04,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 07:51:04,492 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 07:51:04,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 07:51:04,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 07:51:04,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 07:51:04,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 07:51:04,493 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 07:51:04,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 07:51:04,493 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 07:51:04,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 07:51:04,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 07:51:04,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 07:51:04,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 07:51:04,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 07:51:04,498 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 07:51:04,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 07:51:04,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 07:51:04,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 07:51:04,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 07:51:04,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 07:51:04,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 07:51:04,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 07:51:04,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 07:51:04,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 07:51:04,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 07:51:04,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 07:51:04,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 07:51:04,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 07:51:04,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 07:51:04,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 07:51:04,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 07:51:04,501 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 [2024-10-13 07:51:04,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 07:51:04,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 07:51:04,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 07:51:04,741 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 07:51:04,742 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 07:51:04,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2024-10-13 07:51:06,083 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 07:51:06,389 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 07:51:06,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2024-10-13 07:51:06,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d3dfc55/5bdc579e01b94c25acfe8f4584835158/FLAG3a1e1d996 [2024-10-13 07:51:06,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d3dfc55/5bdc579e01b94c25acfe8f4584835158 [2024-10-13 07:51:06,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 07:51:06,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 07:51:06,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 07:51:06,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 07:51:06,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 07:51:06,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:51:06" (1/1) ... [2024-10-13 07:51:06,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78b00cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:06, skipping insertion in model container [2024-10-13 07:51:06,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:51:06" (1/1) ... [2024-10-13 07:51:06,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 07:51:07,286 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2024-10-13 07:51:07,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 07:51:07,333 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 07:51:07,446 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2024-10-13 07:51:07,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 07:51:07,489 INFO L204 MainTranslator]: Completed translation [2024-10-13 07:51:07,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:07 WrapperNode [2024-10-13 07:51:07,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 07:51:07,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 07:51:07,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 07:51:07,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 07:51:07,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:07" (1/1) ... [2024-10-13 07:51:07,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:07" (1/1) ... [2024-10-13 07:51:07,597 INFO L138 Inliner]: procedures = 102, calls = 421, calls flagged for inlining = 49, calls inlined = 44, statements flattened = 1152 [2024-10-13 07:51:07,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 07:51:07,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 07:51:07,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 07:51:07,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 07:51:07,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:07" (1/1) ... [2024-10-13 07:51:07,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:07" (1/1) ... [2024-10-13 07:51:07,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:07" (1/1) ... [2024-10-13 07:51:07,755 INFO L175 MemorySlicer]: Split 229 memory accesses to 13 slices as follows [2, 8, 157, 10, 7, 5, 6, 3, 3, 2, 4, 4, 18]. 69 percent of accesses are in the largest equivalence class. The 76 initializations are split as follows [2, 0, 42, 0, 7, 5, 6, 3, 3, 2, 3, 3, 0]. The 48 writes are split as follows [0, 0, 34, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14]. [2024-10-13 07:51:07,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:07" (1/1) ... [2024-10-13 07:51:07,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:07" (1/1) ... [2024-10-13 07:51:07,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:07" (1/1) ... [2024-10-13 07:51:07,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:07" (1/1) ... [2024-10-13 07:51:07,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:07" (1/1) ... [2024-10-13 07:51:07,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:07" (1/1) ... [2024-10-13 07:51:07,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 07:51:07,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 07:51:07,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 07:51:07,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 07:51:07,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:07" (1/1) ... [2024-10-13 07:51:07,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 07:51:07,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:51:07,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 07:51:07,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 07:51:07,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-13 07:51:07,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-13 07:51:07,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-13 07:51:07,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-13 07:51:07,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-13 07:51:07,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-13 07:51:07,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-13 07:51:07,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-13 07:51:07,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-10-13 07:51:07,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-10-13 07:51:07,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-10-13 07:51:07,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2024-10-13 07:51:07,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2024-10-13 07:51:07,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-13 07:51:07,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-13 07:51:07,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-13 07:51:07,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-13 07:51:07,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-13 07:51:07,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-13 07:51:07,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-13 07:51:07,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-10-13 07:51:07,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2024-10-13 07:51:07,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2024-10-13 07:51:07,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2024-10-13 07:51:07,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2024-10-13 07:51:07,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2024-10-13 07:51:07,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-13 07:51:07,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-13 07:51:07,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-13 07:51:07,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-13 07:51:07,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-13 07:51:07,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-13 07:51:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-13 07:51:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-13 07:51:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-10-13 07:51:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-10-13 07:51:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2024-10-13 07:51:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2024-10-13 07:51:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2024-10-13 07:51:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 07:51:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 07:51:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 07:51:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 07:51:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 07:51:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 07:51:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-13 07:51:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-13 07:51:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-13 07:51:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-13 07:51:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-13 07:51:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-13 07:51:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-13 07:51:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-13 07:51:07,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-13 07:51:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-13 07:51:07,914 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-13 07:51:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 07:51:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 07:51:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 07:51:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 07:51:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 07:51:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 07:51:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-13 07:51:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-13 07:51:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-13 07:51:07,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-13 07:51:07,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-13 07:51:07,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-13 07:51:07,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-13 07:51:07,916 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-13 07:51:07,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-13 07:51:07,916 INFO L130 BoogieDeclarations]: Found specification of procedure extract_value [2024-10-13 07:51:07,917 INFO L138 BoogieDeclarations]: Found implementation of procedure extract_value [2024-10-13 07:51:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 07:51:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 07:51:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2024-10-13 07:51:07,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2024-10-13 07:51:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 07:51:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 07:51:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 07:51:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-13 07:51:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-13 07:51:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-13 07:51:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-13 07:51:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-13 07:51:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-13 07:51:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-13 07:51:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-13 07:51:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-13 07:51:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-13 07:51:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2024-10-13 07:51:07,918 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2024-10-13 07:51:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 07:51:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_bmc_delete [2024-10-13 07:51:07,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_bmc_delete [2024-10-13 07:51:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 07:51:07,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 07:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 07:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-13 07:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-13 07:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-13 07:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-13 07:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-13 07:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-13 07:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-13 07:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-13 07:51:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-13 07:51:07,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-13 07:51:07,921 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-10-13 07:51:07,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-10-13 07:51:07,921 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_send_message [2024-10-13 07:51:07,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_send_message [2024-10-13 07:51:07,921 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2024-10-13 07:51:07,921 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2024-10-13 07:51:07,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 07:51:07,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 07:51:07,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 07:51:07,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 07:51:07,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-13 07:51:07,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-13 07:51:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-13 07:51:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-13 07:51:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-13 07:51:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-13 07:51:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-13 07:51:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-13 07:51:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-13 07:51:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-13 07:51:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2024-10-13 07:51:07,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2024-10-13 07:51:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2024-10-13 07:51:07,924 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2024-10-13 07:51:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-13 07:51:07,925 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-13 07:51:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2024-10-13 07:51:07,925 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2024-10-13 07:51:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-13 07:51:07,925 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-13 07:51:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 07:51:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 07:51:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 07:51:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 07:51:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 07:51:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 07:51:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-13 07:51:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-13 07:51:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-13 07:51:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-13 07:51:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-13 07:51:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-13 07:51:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-13 07:51:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2024-10-13 07:51:07,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2024-10-13 07:51:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2024-10-13 07:51:07,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2024-10-13 07:51:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-13 07:51:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-13 07:51:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-13 07:51:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-13 07:51:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-13 07:51:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-13 07:51:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-13 07:51:07,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-10-13 07:51:07,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2024-10-13 07:51:07,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2024-10-13 07:51:07,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2024-10-13 07:51:07,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2024-10-13 07:51:07,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2024-10-13 07:51:07,927 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2024-10-13 07:51:07,927 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2024-10-13 07:51:07,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 07:51:07,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 07:51:08,181 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 07:51:08,183 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 07:51:09,127 INFO L? ?]: Removed 485 outVars from TransFormulas that were not future-live. [2024-10-13 07:51:09,128 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 07:51:09,242 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 07:51:09,243 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 07:51:09,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:51:09 BoogieIcfgContainer [2024-10-13 07:51:09,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 07:51:09,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 07:51:09,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 07:51:09,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 07:51:09,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:51:06" (1/3) ... [2024-10-13 07:51:09,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2942d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:51:09, skipping insertion in model container [2024-10-13 07:51:09,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:07" (2/3) ... [2024-10-13 07:51:09,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2942d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:51:09, skipping insertion in model container [2024-10-13 07:51:09,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:51:09" (3/3) ... [2024-10-13 07:51:09,253 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2024-10-13 07:51:09,268 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 07:51:09,269 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 07:51:09,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 07:51:09,346 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1401166e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 07:51:09,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 07:51:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 242 states, 168 states have (on average 1.4047619047619047) internal successors, (236), 174 states have internal predecessors, (236), 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) [2024-10-13 07:51:09,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 07:51:09,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:09,406 INFO L215 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] [2024-10-13 07:51:09,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:51:09,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:09,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1637811404, now seen corresponding path program 1 times [2024-10-13 07:51:09,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:09,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290091608] [2024-10-13 07:51:09,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:09,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:09,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:09,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:51:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:09,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:51:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:09,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:09,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:09,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:09,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:51:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 07:51:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 07:51:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:10,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 07:51:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:10,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 07:51:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:10,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 07:51:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:10,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 07:51:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:10,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:10,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 07:51:10,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:10,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290091608] [2024-10-13 07:51:10,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290091608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:10,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:10,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 07:51:10,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484322492] [2024-10-13 07:51:10,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:10,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 07:51:10,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:10,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 07:51:10,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 07:51:10,086 INFO L87 Difference]: Start difference. First operand has 242 states, 168 states have (on average 1.4047619047619047) internal successors, (236), 174 states have internal predecessors, (236), 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) [2024-10-13 07:51:11,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:11,352 INFO L93 Difference]: Finished difference Result 504 states and 730 transitions. [2024-10-13 07:51:11,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 07:51:11,355 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 [2024-10-13 07:51:11,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:11,364 INFO L225 Difference]: With dead ends: 504 [2024-10-13 07:51:11,364 INFO L226 Difference]: Without dead ends: 259 [2024-10-13 07:51:11,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 07:51:11,373 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 142 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:11,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 810 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 07:51:11,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-13 07:51:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 236. [2024-10-13 07:51:11,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 166 states have (on average 1.3734939759036144) internal successors, (228), 170 states have internal predecessors, (228), 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) [2024-10-13 07:51:11,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 330 transitions. [2024-10-13 07:51:11,441 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 330 transitions. Word has length 99 [2024-10-13 07:51:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:11,442 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 330 transitions. [2024-10-13 07:51:11,442 INFO L472 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) [2024-10-13 07:51:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 330 transitions. [2024-10-13 07:51:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 07:51:11,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:11,454 INFO L215 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] [2024-10-13 07:51:11,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 07:51:11,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:51:11,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1163858420, now seen corresponding path program 1 times [2024-10-13 07:51:11,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:11,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086975626] [2024-10-13 07:51:11,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:11,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:51:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:51:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:51:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 07:51:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 07:51:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:51:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 07:51:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 07:51:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 07:51:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:51:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:11,725 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 07:51:11,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:11,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086975626] [2024-10-13 07:51:11,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086975626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:11,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:11,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 07:51:11,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981569810] [2024-10-13 07:51:11,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:11,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 07:51:11,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:11,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 07:51:11,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 07:51:11,731 INFO L87 Difference]: Start difference. First operand 236 states and 330 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) [2024-10-13 07:51:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:12,522 INFO L93 Difference]: Finished difference Result 492 states and 694 transitions. [2024-10-13 07:51:12,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 07:51:12,522 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 [2024-10-13 07:51:12,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:12,526 INFO L225 Difference]: With dead ends: 492 [2024-10-13 07:51:12,527 INFO L226 Difference]: Without dead ends: 260 [2024-10-13 07:51:12,528 INFO L431 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 [2024-10-13 07:51:12,529 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 142 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:12,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 618 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 07:51:12,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-13 07:51:12,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 237. [2024-10-13 07:51:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 167 states have (on average 1.3712574850299402) internal successors, (229), 171 states have internal predecessors, (229), 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) [2024-10-13 07:51:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 331 transitions. [2024-10-13 07:51:12,566 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 331 transitions. Word has length 105 [2024-10-13 07:51:12,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:12,568 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 331 transitions. [2024-10-13 07:51:12,568 INFO L472 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) [2024-10-13 07:51:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 331 transitions. [2024-10-13 07:51:12,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 07:51:12,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:12,571 INFO L215 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] [2024-10-13 07:51:12,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 07:51:12,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:51:12,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:12,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1109465522, now seen corresponding path program 1 times [2024-10-13 07:51:12,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:12,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678526534] [2024-10-13 07:51:12,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:12,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:51:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:51:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:51:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 07:51:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 07:51:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:51:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 07:51:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 07:51:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 07:51:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:51:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 07:51:12,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:12,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678526534] [2024-10-13 07:51:12,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678526534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:12,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:12,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 07:51:12,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572634984] [2024-10-13 07:51:12,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:12,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 07:51:12,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:12,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 07:51:12,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 07:51:12,871 INFO L87 Difference]: Start difference. First operand 237 states and 331 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) [2024-10-13 07:51:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:13,712 INFO L93 Difference]: Finished difference Result 495 states and 697 transitions. [2024-10-13 07:51:13,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 07:51:13,712 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 [2024-10-13 07:51:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:13,714 INFO L225 Difference]: With dead ends: 495 [2024-10-13 07:51:13,714 INFO L226 Difference]: Without dead ends: 262 [2024-10-13 07:51:13,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 07:51:13,716 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 142 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:13,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 777 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 07:51:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-13 07:51:13,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 239. [2024-10-13 07:51:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 173 states have internal predecessors, (231), 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) [2024-10-13 07:51:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 333 transitions. [2024-10-13 07:51:13,731 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 333 transitions. Word has length 105 [2024-10-13 07:51:13,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:13,732 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 333 transitions. [2024-10-13 07:51:13,732 INFO L472 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) [2024-10-13 07:51:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 333 transitions. [2024-10-13 07:51:13,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 07:51:13,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:13,733 INFO L215 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] [2024-10-13 07:51:13,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 07:51:13,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:51:13,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:13,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1262273740, now seen corresponding path program 1 times [2024-10-13 07:51:13,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:13,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487196089] [2024-10-13 07:51:13,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:13,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:51:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:51:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:51:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 07:51:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 07:51:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:51:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 07:51:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 07:51:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 07:51:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:51:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 07:51:13,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:13,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487196089] [2024-10-13 07:51:13,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487196089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:13,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:13,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 07:51:13,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97162733] [2024-10-13 07:51:13,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:13,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 07:51:13,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:13,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 07:51:13,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 07:51:13,912 INFO L87 Difference]: Start difference. First operand 239 states and 333 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) [2024-10-13 07:51:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:14,660 INFO L93 Difference]: Finished difference Result 498 states and 700 transitions. [2024-10-13 07:51:14,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 07:51:14,661 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 [2024-10-13 07:51:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:14,665 INFO L225 Difference]: With dead ends: 498 [2024-10-13 07:51:14,665 INFO L226 Difference]: Without dead ends: 263 [2024-10-13 07:51:14,666 INFO L431 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 [2024-10-13 07:51:14,666 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 142 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:14,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 617 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 07:51:14,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-13 07:51:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 240. [2024-10-13 07:51:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 170 states have (on average 1.3647058823529412) internal successors, (232), 174 states have internal predecessors, (232), 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) [2024-10-13 07:51:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 334 transitions. [2024-10-13 07:51:14,680 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 334 transitions. Word has length 105 [2024-10-13 07:51:14,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:14,680 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 334 transitions. [2024-10-13 07:51:14,680 INFO L472 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) [2024-10-13 07:51:14,680 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 334 transitions. [2024-10-13 07:51:14,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 07:51:14,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:14,681 INFO L215 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] [2024-10-13 07:51:14,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 07:51:14,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:51:14,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:14,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1771746830, now seen corresponding path program 1 times [2024-10-13 07:51:14,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:14,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501486901] [2024-10-13 07:51:14,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:14,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:14,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:14,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:51:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:14,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:51:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:14,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:14,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:15,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:15,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:51:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:15,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 07:51:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:15,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 07:51:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:15,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:51:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:15,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 07:51:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:15,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 07:51:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:15,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 07:51:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:15,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:51:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:15,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 07:51:15,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:15,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501486901] [2024-10-13 07:51:15,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501486901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:15,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:15,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 07:51:15,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576049298] [2024-10-13 07:51:15,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:15,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 07:51:15,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:15,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 07:51:15,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 07:51:15,092 INFO L87 Difference]: Start difference. First operand 240 states and 334 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) [2024-10-13 07:51:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:16,711 INFO L93 Difference]: Finished difference Result 775 states and 1100 transitions. [2024-10-13 07:51:16,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 07:51:16,712 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 [2024-10-13 07:51:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:16,720 INFO L225 Difference]: With dead ends: 775 [2024-10-13 07:51:16,722 INFO L226 Difference]: Without dead ends: 771 [2024-10-13 07:51:16,723 INFO L431 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 [2024-10-13 07:51:16,724 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 784 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:16,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 899 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 07:51:16,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-10-13 07:51:16,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 702. [2024-10-13 07:51:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 500 states have (on average 1.364) internal successors, (682), 510 states have internal predecessors, (682), 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) [2024-10-13 07:51:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 984 transitions. [2024-10-13 07:51:16,792 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 984 transitions. Word has length 105 [2024-10-13 07:51:16,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:16,794 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 984 transitions. [2024-10-13 07:51:16,795 INFO L472 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) [2024-10-13 07:51:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 984 transitions. [2024-10-13 07:51:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 07:51:16,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:16,796 INFO L215 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] [2024-10-13 07:51:16,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 07:51:16,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:51:16,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:16,799 INFO L85 PathProgramCache]: Analyzing trace with hash 450287181, now seen corresponding path program 1 times [2024-10-13 07:51:16,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:16,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612670296] [2024-10-13 07:51:16,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:16,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:51:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:51:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:51:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 07:51:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 07:51:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:51:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 07:51:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 07:51:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 07:51:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:51:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 07:51:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 07:51:17,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:17,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612670296] [2024-10-13 07:51:17,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612670296] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:51:17,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917285456] [2024-10-13 07:51:17,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:17,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:51:17,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:51:17,157 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) [2024-10-13 07:51:17,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 07:51:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:17,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 07:51:17,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:51:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 07:51:17,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 07:51:17,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917285456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:17,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 07:51:17,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-13 07:51:17,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135176308] [2024-10-13 07:51:17,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:17,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 07:51:17,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:17,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 07:51:17,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 07:51:17,630 INFO L87 Difference]: Start difference. First operand 702 states and 984 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) [2024-10-13 07:51:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:18,040 INFO L93 Difference]: Finished difference Result 1402 states and 1967 transitions. [2024-10-13 07:51:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 07:51:18,041 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 [2024-10-13 07:51:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:18,046 INFO L225 Difference]: With dead ends: 1402 [2024-10-13 07:51:18,046 INFO L226 Difference]: Without dead ends: 1166 [2024-10-13 07:51:18,063 INFO L431 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 [2024-10-13 07:51:18,066 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 316 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 819 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.4s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:18,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 819 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 07:51:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2024-10-13 07:51:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 933. [2024-10-13 07:51:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 665 states have (on average 1.362406015037594) internal successors, (906), 678 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) [2024-10-13 07:51:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1306 transitions. [2024-10-13 07:51:18,114 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1306 transitions. Word has length 113 [2024-10-13 07:51:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:18,116 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1306 transitions. [2024-10-13 07:51:18,116 INFO L472 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) [2024-10-13 07:51:18,116 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1306 transitions. [2024-10-13 07:51:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 07:51:18,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:18,119 INFO L215 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] [2024-10-13 07:51:18,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 07:51:18,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 07:51:18,324 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:51:18,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:18,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1652180295, now seen corresponding path program 1 times [2024-10-13 07:51:18,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:18,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524462344] [2024-10-13 07:51:18,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:51:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:51:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:51:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 07:51:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 07:51:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:51:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 07:51:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 07:51:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 07:51:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:51:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 07:51:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 07:51:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 07:51:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-13 07:51:18,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:18,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524462344] [2024-10-13 07:51:18,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524462344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:18,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:18,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 07:51:18,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771986104] [2024-10-13 07:51:18,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:18,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 07:51:18,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:18,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 07:51:18,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 07:51:18,610 INFO L87 Difference]: Start difference. First operand 933 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) [2024-10-13 07:51:19,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:19,562 INFO L93 Difference]: Finished difference Result 1962 states and 2767 transitions. [2024-10-13 07:51:19,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 07:51:19,563 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 [2024-10-13 07:51:19,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:19,569 INFO L225 Difference]: With dead ends: 1962 [2024-10-13 07:51:19,569 INFO L226 Difference]: Without dead ends: 1033 [2024-10-13 07:51:19,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 07:51:19,573 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 142 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:19,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 787 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 07:51:19,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2024-10-13 07:51:19,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 941. [2024-10-13 07:51:19,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 673 states have (on average 1.3580980683506687) internal successors, (914), 686 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) [2024-10-13 07:51:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1314 transitions. [2024-10-13 07:51:19,626 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1314 transitions. Word has length 151 [2024-10-13 07:51:19,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:19,627 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1314 transitions. [2024-10-13 07:51:19,627 INFO L472 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) [2024-10-13 07:51:19,627 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1314 transitions. [2024-10-13 07:51:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 07:51:19,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:19,629 INFO L215 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] [2024-10-13 07:51:19,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 07:51:19,630 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:51:19,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:19,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1538583004, now seen corresponding path program 1 times [2024-10-13 07:51:19,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:19,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455089114] [2024-10-13 07:51:19,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:19,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:51:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:51:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:51:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 07:51:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 07:51:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:51:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 07:51:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 07:51:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 07:51:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:51:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 07:51:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 07:51:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 07:51:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:19,994 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-13 07:51:19,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:19,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455089114] [2024-10-13 07:51:19,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455089114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:19,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:19,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 07:51:19,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100775568] [2024-10-13 07:51:19,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:19,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 07:51:19,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:19,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 07:51:19,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 07:51:19,997 INFO L87 Difference]: Start difference. First operand 941 states and 1314 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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) [2024-10-13 07:51:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:21,041 INFO L93 Difference]: Finished difference Result 1978 states and 2783 transitions. [2024-10-13 07:51:21,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 07:51:21,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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 152 [2024-10-13 07:51:21,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:21,048 INFO L225 Difference]: With dead ends: 1978 [2024-10-13 07:51:21,048 INFO L226 Difference]: Without dead ends: 1041 [2024-10-13 07:51:21,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 07:51:21,054 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 155 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:21,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 761 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 07:51:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2024-10-13 07:51:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 949. [2024-10-13 07:51:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 681 states have (on average 1.353891336270191) internal successors, (922), 694 states have internal predecessors, (922), 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) [2024-10-13 07:51:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1322 transitions. [2024-10-13 07:51:21,103 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1322 transitions. Word has length 152 [2024-10-13 07:51:21,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:21,104 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1322 transitions. [2024-10-13 07:51:21,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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) [2024-10-13 07:51:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1322 transitions. [2024-10-13 07:51:21,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 07:51:21,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:21,106 INFO L215 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] [2024-10-13 07:51:21,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 07:51:21,106 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:51:21,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:21,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1114936282, now seen corresponding path program 1 times [2024-10-13 07:51:21,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:21,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480912136] [2024-10-13 07:51:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:21,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:51:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:51:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:51:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 07:51:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 07:51:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:51:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 07:51:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 07:51:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 07:51:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:51:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 07:51:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 07:51:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 07:51:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-13 07:51:21,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:21,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480912136] [2024-10-13 07:51:21,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480912136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:21,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:21,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 07:51:21,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257135194] [2024-10-13 07:51:21,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:21,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 07:51:21,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:21,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 07:51:21,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 07:51:21,366 INFO L87 Difference]: Start difference. First operand 949 states and 1322 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 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) [2024-10-13 07:51:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:22,173 INFO L93 Difference]: Finished difference Result 1990 states and 2795 transitions. [2024-10-13 07:51:22,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 07:51:22,174 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), 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 152 [2024-10-13 07:51:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:22,179 INFO L225 Difference]: With dead ends: 1990 [2024-10-13 07:51:22,179 INFO L226 Difference]: Without dead ends: 1045 [2024-10-13 07:51:22,182 INFO L431 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 [2024-10-13 07:51:22,183 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 142 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:22,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 618 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 07:51:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2024-10-13 07:51:22,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 953. [2024-10-13 07:51:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 685 states have (on average 1.3518248175182481) internal successors, (926), 698 states have internal predecessors, (926), 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) [2024-10-13 07:51:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1326 transitions. [2024-10-13 07:51:22,224 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1326 transitions. Word has length 152 [2024-10-13 07:51:22,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:22,225 INFO L471 AbstractCegarLoop]: Abstraction has 953 states and 1326 transitions. [2024-10-13 07:51:22,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 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) [2024-10-13 07:51:22,225 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1326 transitions. [2024-10-13 07:51:22,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 07:51:22,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:22,227 INFO L215 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] [2024-10-13 07:51:22,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 07:51:22,227 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:51:22,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:22,228 INFO L85 PathProgramCache]: Analyzing trace with hash -866789788, now seen corresponding path program 1 times [2024-10-13 07:51:22,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:22,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315093443] [2024-10-13 07:51:22,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:22,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:51:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:51:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:51:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 07:51:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 07:51:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:51:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 07:51:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 07:51:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 07:51:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:51:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 07:51:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 07:51:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 07:51:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-13 07:51:22,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:22,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315093443] [2024-10-13 07:51:22,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315093443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:22,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:22,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 07:51:22,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986276609] [2024-10-13 07:51:22,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:22,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 07:51:22,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:22,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 07:51:22,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 07:51:22,534 INFO L87 Difference]: Start difference. First operand 953 states and 1326 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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) [2024-10-13 07:51:23,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:23,417 INFO L93 Difference]: Finished difference Result 2002 states and 2807 transitions. [2024-10-13 07:51:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 07:51:23,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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 152 [2024-10-13 07:51:23,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:23,423 INFO L225 Difference]: With dead ends: 2002 [2024-10-13 07:51:23,424 INFO L226 Difference]: Without dead ends: 1053 [2024-10-13 07:51:23,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 07:51:23,426 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 142 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:23,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 785 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 07:51:23,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-10-13 07:51:23,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 961. [2024-10-13 07:51:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 693 states have (on average 1.3477633477633477) internal successors, (934), 706 states have internal predecessors, (934), 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) [2024-10-13 07:51:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1334 transitions. [2024-10-13 07:51:23,468 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1334 transitions. Word has length 152 [2024-10-13 07:51:23,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:23,469 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1334 transitions. [2024-10-13 07:51:23,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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) [2024-10-13 07:51:23,469 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1334 transitions. [2024-10-13 07:51:23,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 07:51:23,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:23,471 INFO L215 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] [2024-10-13 07:51:23,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 07:51:23,471 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:51:23,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:23,471 INFO L85 PathProgramCache]: Analyzing trace with hash 416828076, now seen corresponding path program 1 times [2024-10-13 07:51:23,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:23,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304820115] [2024-10-13 07:51:23,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:23,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:51:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:51:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:51:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 07:51:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 07:51:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:51:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 07:51:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 07:51:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 07:51:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:51:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 07:51:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 07:51:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 07:51:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-13 07:51:23,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:23,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304820115] [2024-10-13 07:51:23,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304820115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:23,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:23,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 07:51:23,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632184109] [2024-10-13 07:51:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:23,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 07:51:23,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:23,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 07:51:23,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 07:51:23,821 INFO L87 Difference]: Start difference. First operand 961 states and 1334 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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) [2024-10-13 07:51:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:24,862 INFO L93 Difference]: Finished difference Result 2278 states and 3229 transitions. [2024-10-13 07:51:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 07:51:24,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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 152 [2024-10-13 07:51:24,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:24,871 INFO L225 Difference]: With dead ends: 2278 [2024-10-13 07:51:24,871 INFO L226 Difference]: Without dead ends: 1321 [2024-10-13 07:51:24,874 INFO L431 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 [2024-10-13 07:51:24,875 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 215 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:24,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1045 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 07:51:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2024-10-13 07:51:24,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1028. [2024-10-13 07:51:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 752 states have (on average 1.3550531914893618) internal successors, (1019), 765 states have internal predecessors, (1019), 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) [2024-10-13 07:51:24,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1435 transitions. [2024-10-13 07:51:24,929 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1435 transitions. Word has length 152 [2024-10-13 07:51:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:24,931 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1435 transitions. [2024-10-13 07:51:24,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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) [2024-10-13 07:51:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1435 transitions. [2024-10-13 07:51:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 07:51:24,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:24,935 INFO L215 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, 1] [2024-10-13 07:51:24,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 07:51:24,935 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:51:24,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:24,935 INFO L85 PathProgramCache]: Analyzing trace with hash -539901550, now seen corresponding path program 1 times [2024-10-13 07:51:24,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:24,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843238243] [2024-10-13 07:51:24,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:24,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:51:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:51:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:51:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 07:51:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 07:51:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:51:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 07:51:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 07:51:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 07:51:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:51:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 07:51:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 07:51:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 07:51:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-13 07:51:25,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:25,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843238243] [2024-10-13 07:51:25,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843238243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:25,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:25,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 07:51:25,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198104258] [2024-10-13 07:51:25,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:25,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 07:51:25,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:25,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 07:51:25,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 07:51:25,220 INFO L87 Difference]: Start difference. First operand 1028 states and 1435 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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) [2024-10-13 07:51:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:26,208 INFO L93 Difference]: Finished difference Result 2337 states and 3306 transitions. [2024-10-13 07:51:26,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 07:51:26,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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 153 [2024-10-13 07:51:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:26,220 INFO L225 Difference]: With dead ends: 2337 [2024-10-13 07:51:26,221 INFO L226 Difference]: Without dead ends: 1313 [2024-10-13 07:51:26,224 INFO L431 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 [2024-10-13 07:51:26,225 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 209 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:26,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1009 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 07:51:26,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2024-10-13 07:51:26,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1020. [2024-10-13 07:51:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 744 states have (on average 1.342741935483871) internal successors, (999), 757 states have internal predecessors, (999), 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) [2024-10-13 07:51:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1415 transitions. [2024-10-13 07:51:26,281 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1415 transitions. Word has length 153 [2024-10-13 07:51:26,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:26,282 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1415 transitions. [2024-10-13 07:51:26,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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) [2024-10-13 07:51:26,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1415 transitions. [2024-10-13 07:51:26,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 07:51:26,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:26,284 INFO L215 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, 1] [2024-10-13 07:51:26,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 07:51:26,285 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:51:26,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:26,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1997944823, now seen corresponding path program 1 times [2024-10-13 07:51:26,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:26,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078871699] [2024-10-13 07:51:26,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:26,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:51:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:51:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:51:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 07:51:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 07:51:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:51:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 07:51:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 07:51:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 07:51:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:51:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 07:51:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 07:51:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 07:51:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-13 07:51:26,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:26,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078871699] [2024-10-13 07:51:26,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078871699] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 07:51:26,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893767864] [2024-10-13 07:51:26,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:26,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 07:51:26,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 07:51:26,604 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) [2024-10-13 07:51:26,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 07:51:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:27,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 07:51:27,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 07:51:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-13 07:51:27,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 07:51:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-13 07:51:27,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893767864] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 07:51:27,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 07:51:27,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2024-10-13 07:51:27,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161717288] [2024-10-13 07:51:27,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 07:51:27,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 07:51:27,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:27,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 07:51:27,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 07:51:27,320 INFO L87 Difference]: Start difference. First operand 1020 states and 1415 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 6 states have internal predecessors, (115), 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) [2024-10-13 07:51:28,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:28,463 INFO L93 Difference]: Finished difference Result 2562 states and 3655 transitions. [2024-10-13 07:51:28,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 07:51:28,466 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 6 states have internal predecessors, (115), 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 153 [2024-10-13 07:51:28,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:28,474 INFO L225 Difference]: With dead ends: 2562 [2024-10-13 07:51:28,474 INFO L226 Difference]: Without dead ends: 1546 [2024-10-13 07:51:28,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 342 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 07:51:28,477 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 241 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:28,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 976 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 07:51:28,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2024-10-13 07:51:28,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1332. [2024-10-13 07:51:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1008 states have (on average 1.3482142857142858) internal successors, (1359), 1021 states have internal predecessors, (1359), 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) [2024-10-13 07:51:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1871 transitions. [2024-10-13 07:51:28,534 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1871 transitions. Word has length 153 [2024-10-13 07:51:28,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:28,535 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 1871 transitions. [2024-10-13 07:51:28,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 6 states have internal predecessors, (115), 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) [2024-10-13 07:51:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1871 transitions. [2024-10-13 07:51:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 07:51:28,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:28,538 INFO L215 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, 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] [2024-10-13 07:51:28,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 07:51:28,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 07:51:28,739 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:51:28,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:28,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1421034742, now seen corresponding path program 1 times [2024-10-13 07:51:28,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:28,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445846602] [2024-10-13 07:51:28,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:28,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:28,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:28,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:51:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:51:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:28,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:28,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:28,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:51:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:28,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 07:51:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:28,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 07:51:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:28,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:51:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:29,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 07:51:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:29,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 07:51:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:29,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 07:51:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:29,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:51:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:29,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:29,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:29,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 07:51:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:29,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 07:51:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:29,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 07:51:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:29,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:29,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 07:51:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:29,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-13 07:51:29,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:29,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445846602] [2024-10-13 07:51:29,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445846602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:29,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:29,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 07:51:29,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669789597] [2024-10-13 07:51:29,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:29,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 07:51:29,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:29,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 07:51:29,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 07:51:29,039 INFO L87 Difference]: Start difference. First operand 1332 states and 1871 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 5 states have internal predecessors, (85), 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) [2024-10-13 07:51:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:31,073 INFO L93 Difference]: Finished difference Result 3397 states and 4821 transitions. [2024-10-13 07:51:31,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 07:51:31,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 5 states have internal predecessors, (85), 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 162 [2024-10-13 07:51:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:31,082 INFO L225 Difference]: With dead ends: 3397 [2024-10-13 07:51:31,082 INFO L226 Difference]: Without dead ends: 1021 [2024-10-13 07:51:31,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-13 07:51:31,088 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 402 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:31,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1678 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 07:51:31,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-10-13 07:51:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 927. [2024-10-13 07:51:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 695 states have (on average 1.3122302158273382) internal successors, (912), 705 states have internal predecessors, (912), 180 states have call successors, (180), 52 states have call predecessors, (180), 51 states have return successors, (180), 178 states have call predecessors, (180), 178 states have call successors, (180) [2024-10-13 07:51:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1272 transitions. [2024-10-13 07:51:31,129 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1272 transitions. Word has length 162 [2024-10-13 07:51:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:31,129 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1272 transitions. [2024-10-13 07:51:31,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 5 states have internal predecessors, (85), 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) [2024-10-13 07:51:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1272 transitions. [2024-10-13 07:51:31,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-13 07:51:31,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:31,132 INFO L215 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, 1] [2024-10-13 07:51:31,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 07:51:31,133 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:51:31,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:31,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1108713247, now seen corresponding path program 1 times [2024-10-13 07:51:31,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:31,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053992644] [2024-10-13 07:51:31,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:31,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:51:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:51:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:51:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 07:51:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 07:51:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:51:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 07:51:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 07:51:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 07:51:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:51:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 07:51:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 07:51:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 07:51:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 07:51:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 07:51:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-13 07:51:31,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:31,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053992644] [2024-10-13 07:51:31,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053992644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:31,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:31,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 07:51:31,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714941664] [2024-10-13 07:51:31,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:31,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 07:51:31,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:31,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 07:51:31,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 07:51:31,493 INFO L87 Difference]: Start difference. First operand 927 states and 1272 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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) [2024-10-13 07:51:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:32,309 INFO L93 Difference]: Finished difference Result 1857 states and 2569 transitions. [2024-10-13 07:51:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 07:51:32,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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 181 [2024-10-13 07:51:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:32,315 INFO L225 Difference]: With dead ends: 1857 [2024-10-13 07:51:32,315 INFO L226 Difference]: Without dead ends: 934 [2024-10-13 07:51:32,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 07:51:32,318 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 156 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:32,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 757 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 07:51:32,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-13 07:51:32,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 851. [2024-10-13 07:51:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 627 states have (on average 1.3014354066985645) internal successors, (816), 637 states have internal predecessors, (816), 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) [2024-10-13 07:51:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1160 transitions. [2024-10-13 07:51:32,357 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1160 transitions. Word has length 181 [2024-10-13 07:51:32,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:32,358 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1160 transitions. [2024-10-13 07:51:32,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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) [2024-10-13 07:51:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1160 transitions. [2024-10-13 07:51:32,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-13 07:51:32,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 07:51:32,361 INFO L215 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, 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] [2024-10-13 07:51:32,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 07:51:32,361 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 07:51:32,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 07:51:32,361 INFO L85 PathProgramCache]: Analyzing trace with hash 58714759, now seen corresponding path program 1 times [2024-10-13 07:51:32,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 07:51:32,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112540229] [2024-10-13 07:51:32,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 07:51:32,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 07:51:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 07:51:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 07:51:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 07:51:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 07:51:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 07:51:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 07:51:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 07:51:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 07:51:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 07:51:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 07:51:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 07:51:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 07:51:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 07:51:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 07:51:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 07:51:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 07:51:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 07:51:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 07:51:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 07:51:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-13 07:51:32,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 07:51:32,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112540229] [2024-10-13 07:51:32,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112540229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 07:51:32,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 07:51:32,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 07:51:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650875450] [2024-10-13 07:51:32,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 07:51:32,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 07:51:32,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 07:51:32,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 07:51:32,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 07:51:32,883 INFO L87 Difference]: Start difference. First operand 851 states and 1160 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-10-13 07:51:33,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 07:51:33,980 INFO L93 Difference]: Finished difference Result 1225 states and 1704 transitions. [2024-10-13 07:51:33,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 07:51:33,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 5 states have internal predecessors, (106), 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 193 [2024-10-13 07:51:33,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 07:51:33,983 INFO L225 Difference]: With dead ends: 1225 [2024-10-13 07:51:33,983 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 07:51:33,986 INFO L431 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 [2024-10-13 07:51:33,986 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 1184 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 570 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 07:51:33,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 628 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [570 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 07:51:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 07:51:33,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 07:51:33,987 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) [2024-10-13 07:51:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 07:51:33,988 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 193 [2024-10-13 07:51:33,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 07:51:33,989 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 07:51:33,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-10-13 07:51:33,989 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 07:51:33,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 07:51:33,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 07:51:33,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 07:51:33,994 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 07:51:33,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 07:52:23,129 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 07:52:23,140 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-10-13 07:52:23,141 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-10-13 07:52:23,143 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-13 07:52:23,143 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-13 07:52:23,143 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-13 07:52:23,143 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-13 07:52:23,146 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2024-10-13 07:52:23,146 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_count_2~0 [2024-10-13 07:52:23,146 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_count_1~0 [2024-10-13 07:52:23,146 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_count_1~0 [2024-10-13 07:52:23,146 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_count_2~0 [2024-10-13 07:52:23,147 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2024-10-13 07:52:23,147 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_count_2~0 [2024-10-13 07:52:23,147 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_count_1~0 [2024-10-13 07:52:23,147 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2024-10-13 07:52:23,147 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2024-10-13 07:52:23,147 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2024-10-13 07:52:23,147 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_count_2~0 [2024-10-13 07:52:23,147 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_count_1~0 [2024-10-13 07:52:23,148 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_count_1~0 [2024-10-13 07:52:23,148 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_count_2~0 [2024-10-13 07:52:23,148 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2024-10-13 07:52:23,148 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_count_2~0 [2024-10-13 07:52:23,148 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_count_1~0 [2024-10-13 07:52:23,151 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2024-10-13 07:52:23,151 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2024-10-13 07:52:23,151 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2024-10-13 07:52:23,151 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2024-10-13 07:52:23,152 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2024-10-13 07:52:23,152 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2024-10-13 07:52:23,152 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2024-10-13 07:52:23,152 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2024-10-13 07:52:23,152 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2024-10-13 07:52:23,152 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2024-10-13 07:52:23,152 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2024-10-13 07:52:23,152 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2024-10-13 07:52:23,153 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2024-10-13 07:52:23,153 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2024-10-13 07:52:23,153 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2024-10-13 07:52:23,153 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2024-10-13 07:52:23,153 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2024-10-13 07:52:23,153 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2024-10-13 07:52:23,153 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2024-10-13 07:52:23,153 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2024-10-13 07:52:23,153 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sensor_type~0 [2024-10-13 07:52:23,154 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~j~0 [2024-10-13 07:52:23,162 WARN L155 FloydHoareUtils]: Requires clause for kfree contained old-variable. Original clause: (and (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and .cse1 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse1 .cse0))) (= |old(#valid)| |#valid|)) Eliminated clause: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and .cse1 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse1 .cse0))) [2024-10-13 07:52:23,187 WARN L155 FloydHoareUtils]: Requires clause for ldv_device_create_file_dev_attr_of_sensor_device_attribute contained old-variable. Original clause: (let ((.cse0 (+ 5 |old(~ldv_count_2~0)|)) (.cse2 (= |old(~ldv_count_2~0)| 0)) (.cse4 (+ |old(~ldv_count_2~0)| 1)) (.cse1 (< |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)| 1))) (and (or (< ~ldv_count_1~0 (+ 2 |old(~ldv_count_2~0)|)) (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0)) (or (< ~ldv_count_1~0 .cse0) (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse1) (or (not .cse2) (< ~ldv_count_1~0 6) (= ~ldv_count_2~0 0)) (let ((.cse5 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse3 (<= 1 |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)|))) (or (and (<= .cse0 ~ldv_count_1~0) .cse3) (and (<= .cse4 ~ldv_count_1~0) .cse5) (and .cse5 .cse3) (and (<= 6 ~ldv_count_1~0) .cse2))) (or (< ~ldv_count_1~0 .cse4) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (or (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0) .cse1))) Eliminated clause: (exists ((|old(~ldv_count_2~0)| Int) (|old(~ldv_call_dev_attr_of_sensor_device_attribute~0)| Int)) (let ((.cse1 (+ |old(~ldv_count_2~0)| 1)) (.cse0 (= |old(~ldv_count_2~0)| 0)) (.cse3 (+ 5 |old(~ldv_count_2~0)|)) (.cse2 (< |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)| 1))) (and (or (< (+ ~ldv_count_2~0 1) ~ldv_count_1~0) (< ~ldv_count_1~0 (+ 2 |old(~ldv_count_2~0)|))) (or (not .cse0) (< ~ldv_count_1~0 6) (= ~ldv_count_2~0 0)) (or (< ~ldv_count_2~0 ~ldv_count_1~0) (< ~ldv_count_1~0 .cse1)) (or (< 0 ~ldv_call_dev_attr_of_sensor_device_attribute~0) .cse2) (let ((.cse5 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse4 (<= 1 |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)|))) (or (and (<= .cse3 ~ldv_count_1~0) .cse4) (and (<= .cse1 ~ldv_count_1~0) .cse5) (and .cse5 .cse4) (and (<= 6 ~ldv_count_1~0) .cse0))) (or (< ~ldv_count_1~0 .cse3) (< (+ 4 ~ldv_count_2~0) ~ldv_count_1~0) .cse2)))) [2024-10-13 07:52:23,193 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-13 07:52:23,208 WARN L155 FloydHoareUtils]: Requires clause for ldv_malloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and .cse1 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse1 .cse0))) (= |old(#valid)| |#valid|)) Eliminated clause: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and .cse1 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse1 .cse0))) [2024-10-13 07:52:23,218 WARN L155 FloydHoareUtils]: Requires clause for ibmpex_send_message contained old-variable. Original clause: (and (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and .cse1 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse1 .cse0))) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|)) Eliminated clause: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and .cse1 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse1 .cse0))) [2024-10-13 07:52:23,221 WARN L155 FloydHoareUtils]: Requires clause for kzalloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and .cse1 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse1 .cse0))) (= |old(#valid)| |#valid|)) Eliminated clause: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and .cse1 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse1 .cse0))) [2024-10-13 07:52:23,226 WARN L155 FloydHoareUtils]: Requires clause for kmalloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and .cse1 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse1 .cse0))) (= |old(#valid)| |#valid|)) Eliminated clause: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and .cse0 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and (<= 6 ~ldv_count_1~0) (= ~ldv_count_2~0 0)) (and .cse1 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse1 .cse0))) [2024-10-13 07:52:23,235 WARN L155 FloydHoareUtils]: Requires clause for ibmpex_bmc_delete contained old-variable. Original clause: (= |old(#valid)| |#valid|) Eliminated clause: true [2024-10-13 07:52:23,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:52:23 BoogieIcfgContainer [2024-10-13 07:52:23,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 07:52:23,237 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 07:52:23,237 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 07:52:23,237 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 07:52:23,238 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:51:09" (3/4) ... [2024-10-13 07:52:23,239 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 07:52:23,242 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2024-10-13 07:52:23,242 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_destroy_user [2024-10-13 07:52:23,242 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2024-10-13 07:52:23,242 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2024-10-13 07:52:23,242 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure wait_for_completion [2024-10-13 07:52:23,242 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2024-10-13 07:52:23,242 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2024-10-13 07:52:23,242 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2024-10-13 07:52:23,243 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_free_recv_msg [2024-10-13 07:52:23,243 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-10-13 07:52:23,243 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_send_message [2024-10-13 07:52:23,243 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2024-10-13 07:52:23,243 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2024-10-13 07:52:23,243 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2024-10-13 07:52:23,243 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2024-10-13 07:52:23,243 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure extract_value [2024-10-13 07:52:23,243 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_bmc_delete [2024-10-13 07:52:23,244 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2024-10-13 07:52:23,257 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 161 nodes and edges [2024-10-13 07:52:23,259 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 59 nodes and edges [2024-10-13 07:52:23,260 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-13 07:52:23,261 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 07:52:23,262 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 07:52:23,263 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 07:52:23,414 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 07:52:23,414 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 07:52:23,414 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 07:52:23,414 INFO L158 Benchmark]: Toolchain (without parser) took 76759.96ms. Allocated memory was 148.9MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 74.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. [2024-10-13 07:52:23,415 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 07:52:23,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 829.64ms. Allocated memory was 148.9MB in the beginning and 211.8MB in the end (delta: 62.9MB). Free memory was 74.6MB in the beginning and 149.3MB in the end (delta: -74.7MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2024-10-13 07:52:23,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.09ms. Allocated memory is still 211.8MB. Free memory was 149.3MB in the beginning and 140.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 07:52:23,415 INFO L158 Benchmark]: Boogie Preprocessor took 230.92ms. Allocated memory is still 211.8MB. Free memory was 140.9MB in the beginning and 110.5MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-13 07:52:23,415 INFO L158 Benchmark]: RCFGBuilder took 1414.40ms. Allocated memory is still 211.8MB. Free memory was 109.5MB in the beginning and 82.1MB in the end (delta: 27.4MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. [2024-10-13 07:52:23,415 INFO L158 Benchmark]: TraceAbstraction took 73990.11ms. Allocated memory was 211.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 81.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 753.3MB. Max. memory is 16.1GB. [2024-10-13 07:52:23,415 INFO L158 Benchmark]: Witness Printer took 176.99ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 07:52:23,416 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.17ms. Allocated memory is still 148.9MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 829.64ms. Allocated memory was 148.9MB in the beginning and 211.8MB in the end (delta: 62.9MB). Free memory was 74.6MB in the beginning and 149.3MB in the end (delta: -74.7MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.09ms. Allocated memory is still 211.8MB. Free memory was 149.3MB in the beginning and 140.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 230.92ms. Allocated memory is still 211.8MB. Free memory was 140.9MB in the beginning and 110.5MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1414.40ms. Allocated memory is still 211.8MB. Free memory was 109.5MB in the beginning and 82.1MB in the end (delta: 27.4MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. * TraceAbstraction took 73990.11ms. Allocated memory was 211.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 81.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 753.3MB. Max. memory is 16.1GB. * Witness Printer took 176.99ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_call_dev_attr_of_sensor_device_attribute~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_call_dev_attr_of_sensor_device_attribute~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_call_dev_attr_of_sensor_device_attribute~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_call_dev_attr_of_sensor_device_attribute~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~sensor_type~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~j~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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, 242 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.7s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4999 SdHoareTripleChecker+Valid, 15.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4656 mSDsluCounter, 13584 SdHoareTripleChecker+Invalid, 13.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9419 mSDsCounter, 2619 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10647 IncrementalHoareTripleChecker+Invalid, 13266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2619 mSolverCounterUnsat, 4165 mSDtfsCounter, 10647 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1158 GetRequests, 1057 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1332occurred in iteration=13, InterpolantAutomatonStates: 122, 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, 1739 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2499 NumberOfCodeBlocks, 2499 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2633 ConstructedInterpolants, 0 QuantifiedInterpolants, 4492 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2656 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 1236/1240 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]: Location Invariant Derived location invariant: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - InvariantResult [Line: 2192]: Location Invariant Derived location invariant: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (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]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 1990]: Loop Invariant Derived loop invariant: ((((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) 2 + ldv_count_2) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) - InvariantResult [Line: 1993]: Loop Invariant Derived loop invariant: ((((((6 <= ldv_count_1) && (ldv_count_2 == 0)) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) 2 + ldv_count_2) <= ldv_count_1))) - ProcedureContractResult [Line: 2594]: Procedure Contract for kfree Derived contract for procedure kfree. Requires: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) Ensures: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - ProcedureContractResult [Line: 2553]: Procedure Contract for ipmi_destroy_user Derived contract for procedure ipmi_destroy_user. Requires: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) Ensures: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - ProcedureContractResult [Line: 2470]: Procedure Contract for ldv_device_create_file_dev_attr_of_sensor_device_attribute Derived contract for procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute. Ensures: (((((((ldv_count_2 < ldv_count_1) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) && (((((long) ldv_count_2 + 1) < ldv_count_1) || (ldv_count_1 < ((long) 2 + \old(ldv_count_2)))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute)))) && ((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || (ldv_count_1 < ((long) 5 + \old(ldv_count_2)))) || (\old(ldv_call_dev_attr_of_sensor_device_attribute) < 1))) && (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || (\old(ldv_count_2) != 0)) || (ldv_count_1 < 6)) || (ldv_count_2 == 0))) && (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) || (0 < ldv_call_dev_attr_of_sensor_device_attribute)) || (\old(ldv_call_dev_attr_of_sensor_device_attribute) < 1))) && (((((((long) 5 + \old(ldv_count_2)) <= ldv_count_1) && (1 <= \old(ldv_call_dev_attr_of_sensor_device_attribute))) || ((((long) \old(ldv_count_2) + 1) <= ldv_count_1) && (ldv_call_dev_attr_of_sensor_device_attribute_2 != 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= \old(ldv_call_dev_attr_of_sensor_device_attribute)))) || ((6 <= ldv_count_1) && (\old(ldv_count_2) == 0)))) - ProcedureContractResult [Line: 2590]: Procedure Contract for wait_for_completion Derived contract for procedure wait_for_completion. Requires: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) Ensures: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - ProcedureContractResult [Line: 2424]: Procedure Contract for ldv_is_err Derived contract for procedure ldv_is_err. Requires: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) Ensures: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - ProcedureContractResult [Line: 2545]: Procedure Contract for hwmon_device_unregister Derived contract for procedure hwmon_device_unregister. Requires: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) Ensures: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - ProcedureContractResult [Line: 2530]: Procedure Contract for dev_err Derived contract for procedure dev_err. Requires: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) Ensures: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - ProcedureContractResult [Line: 2556]: Procedure Contract for ipmi_free_recv_msg Derived contract for procedure ipmi_free_recv_msg. Requires: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) Ensures: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - ProcedureContractResult [Line: 1634]: Procedure Contract for ldv_malloc Derived contract for procedure ldv_malloc. Requires: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) Ensures: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - ProcedureContractResult [Line: 1695]: Procedure Contract for ibmpex_send_message Derived contract for procedure ibmpex_send_message. Requires: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) Ensures: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - ProcedureContractResult [Line: 2412]: Procedure Contract for ldv_error Derived contract for procedure ldv_error. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 1658]: Procedure Contract for kzalloc Derived contract for procedure kzalloc. Requires: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) Ensures: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - ProcedureContractResult [Line: 1649]: Procedure Contract for kmalloc Derived contract for procedure kmalloc. Requires: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) Ensures: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - ProcedureContractResult [Line: 2539]: Procedure Contract for device_remove_file Derived contract for procedure device_remove_file. Requires: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) Ensures: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - ProcedureContractResult [Line: 1676]: Procedure Contract for extract_value Derived contract for procedure extract_value. Requires: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) Ensures: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - ProcedureContractResult [Line: 2536]: Procedure Contract for dev_set_drvdata Derived contract for procedure dev_set_drvdata. Requires: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) Ensures: (((((1 <= ldv_call_dev_attr_of_sensor_device_attribute) && (((long) 5 + ldv_count_2) <= ldv_count_1)) || ((6 <= ldv_count_1) && (ldv_count_2 == 0))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (((long) ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 != 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) RESULT: Ultimate proved your program to be correct! [2024-10-13 07:52:23,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE