./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 Calling Ultimate with: /usr/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 ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.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.graphml --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 f91d2143e2aa98b5d48c7de2c4b17a3507ecfb748f26bae9be6d0588f4557bb1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 04:12:43,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 04:12:43,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 04:12:43,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 04:12:43,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 04:12:43,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 04:12:43,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 04:12:43,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 04:12:43,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 04:12:43,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 04:12:43,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 04:12:43,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 04:12:43,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 04:12:43,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 04:12:43,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 04:12:43,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 04:12:43,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 04:12:43,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 04:12:43,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 04:12:43,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 04:12:43,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 04:12:43,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 04:12:43,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 04:12:43,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 04:12:43,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 04:12:43,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 04:12:43,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 04:12:43,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 04:12:43,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 04:12:43,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 04:12:43,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 04:12:43,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 04:12:43,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 04:12:43,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 04:12:43,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 04:12:43,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 04:12:43,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 04:12:43,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 04:12:43,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 04:12:43,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 04:12:43,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 04:12:43,685 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-28 04:12:43,712 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 04:12:43,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 04:12:43,713 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 04:12:43,714 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 04:12:43,714 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 04:12:43,714 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 04:12:43,715 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 04:12:43,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 04:12:43,716 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 04:12:43,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 04:12:43,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 04:12:43,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 04:12:43,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 04:12:43,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 04:12:43,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 04:12:43,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 04:12:43,717 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 04:12:43,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 04:12:43,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 04:12:43,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 04:12:43,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 04:12:43,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 04:12:43,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 04:12:43,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 04:12:43,719 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 04:12:43,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 04:12:43,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 04:12:43,719 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 04:12:43,719 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 04:12:43,719 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 04:12:43,719 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> f91d2143e2aa98b5d48c7de2c4b17a3507ecfb748f26bae9be6d0588f4557bb1 [2021-12-28 04:12:43,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 04:12:43,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 04:12:43,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 04:12:44,000 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 04:12:44,001 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 04:12:44,002 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2021-12-28 04:12:44,044 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3e8e8f4/b0343c24422d47ffa592baf583c0ba49/FLAG99a253d4c [2021-12-28 04:12:44,548 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 04:12:44,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2021-12-28 04:12:44,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3e8e8f4/b0343c24422d47ffa592baf583c0ba49/FLAG99a253d4c [2021-12-28 04:12:44,815 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3e8e8f4/b0343c24422d47ffa592baf583c0ba49 [2021-12-28 04:12:44,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 04:12:44,830 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 04:12:44,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 04:12:44,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 04:12:44,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 04:12:44,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 04:12:44" (1/1) ... [2021-12-28 04:12:44,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e4c5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:12:44, skipping insertion in model container [2021-12-28 04:12:44,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 04:12:44" (1/1) ... [2021-12-28 04:12:44,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 04:12:44,938 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 04:12:45,479 WARN L230 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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i[183784,183797] [2021-12-28 04:12:45,514 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 04:12:45,536 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 04:12:45,704 WARN L230 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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i[183784,183797] [2021-12-28 04:12:45,713 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 04:12:45,739 INFO L208 MainTranslator]: Completed translation [2021-12-28 04:12:45,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:12:45 WrapperNode [2021-12-28 04:12:45,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 04:12:45,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 04:12:45,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 04:12:45,742 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 04:12:45,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:12:45" (1/1) ... [2021-12-28 04:12:45,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:12:45" (1/1) ... [2021-12-28 04:12:45,810 INFO L137 Inliner]: procedures = 68, calls = 170, calls flagged for inlining = 22, calls inlined = 15, statements flattened = 343 [2021-12-28 04:12:45,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 04:12:45,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 04:12:45,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 04:12:45,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 04:12:45,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:12:45" (1/1) ... [2021-12-28 04:12:45,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:12:45" (1/1) ... [2021-12-28 04:12:45,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:12:45" (1/1) ... [2021-12-28 04:12:45,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:12:45" (1/1) ... [2021-12-28 04:12:45,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:12:45" (1/1) ... [2021-12-28 04:12:45,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:12:45" (1/1) ... [2021-12-28 04:12:45,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:12:45" (1/1) ... [2021-12-28 04:12:45,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 04:12:45,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 04:12:45,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 04:12:45,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 04:12:45,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:12:45" (1/1) ... [2021-12-28 04:12:45,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 04:12:45,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 04:12:45,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 04:12:45,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 04:12:45,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 04:12:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 04:12:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-28 04:12:45,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-28 04:12:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 04:12:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-28 04:12:45,951 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-28 04:12:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 04:12:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2021-12-28 04:12:45,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2021-12-28 04:12:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 04:12:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 04:12:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-12-28 04:12:45,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-12-28 04:12:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2021-12-28 04:12:45,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2021-12-28 04:12:45,953 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-28 04:12:45,953 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-28 04:12:45,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 04:12:45,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 04:12:45,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 04:12:45,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 04:12:45,953 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2021-12-28 04:12:45,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2021-12-28 04:12:46,114 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 04:12:46,115 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 04:12:46,180 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-28 04:12:46,420 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 04:12:46,425 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 04:12:46,425 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 04:12:46,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 04:12:46 BoogieIcfgContainer [2021-12-28 04:12:46,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 04:12:46,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 04:12:46,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 04:12:46,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 04:12:46,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 04:12:44" (1/3) ... [2021-12-28 04:12:46,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b5b118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 04:12:46, skipping insertion in model container [2021-12-28 04:12:46,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:12:45" (2/3) ... [2021-12-28 04:12:46,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b5b118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 04:12:46, skipping insertion in model container [2021-12-28 04:12:46,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 04:12:46" (3/3) ... [2021-12-28 04:12:46,432 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2021-12-28 04:12:46,435 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 04:12:46,435 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 04:12:46,470 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 04:12:46,477 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 04:12:46,477 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 04:12:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 77 states have internal predecessors, (99), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-28 04:12:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-28 04:12:46,496 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 04:12:46,496 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 04:12:46,496 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 04:12:46,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 04:12:46,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1422532354, now seen corresponding path program 1 times [2021-12-28 04:12:46,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 04:12:46,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671103233] [2021-12-28 04:12:46,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:46,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 04:12:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:46,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 04:12:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:46,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:46,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:46,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 04:12:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:46,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:46,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:46,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 04:12:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:46,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 04:12:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-28 04:12:46,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 04:12:46,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671103233] [2021-12-28 04:12:46,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671103233] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 04:12:46,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 04:12:46,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 04:12:46,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499333943] [2021-12-28 04:12:46,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 04:12:46,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 04:12:46,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 04:12:46,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 04:12:46,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 04:12:47,000 INFO L87 Difference]: Start difference. First operand has 91 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 77 states have internal predecessors, (99), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-28 04:12:47,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 04:12:47,150 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2021-12-28 04:12:47,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 04:12:47,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2021-12-28 04:12:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 04:12:47,165 INFO L225 Difference]: With dead ends: 181 [2021-12-28 04:12:47,165 INFO L226 Difference]: Without dead ends: 85 [2021-12-28 04:12:47,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-28 04:12:47,172 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 32 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 04:12:47,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 266 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 04:12:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-28 04:12:47,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2021-12-28 04:12:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 67 states have internal predecessors, (88), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-28 04:12:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2021-12-28 04:12:47,198 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 61 [2021-12-28 04:12:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 04:12:47,199 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2021-12-28 04:12:47,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-28 04:12:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2021-12-28 04:12:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-28 04:12:47,201 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 04:12:47,201 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 04:12:47,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 04:12:47,202 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 04:12:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 04:12:47,202 INFO L85 PathProgramCache]: Analyzing trace with hash 147371386, now seen corresponding path program 1 times [2021-12-28 04:12:47,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 04:12:47,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781454412] [2021-12-28 04:12:47,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:47,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 04:12:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 04:12:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 04:12:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 04:12:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 04:12:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,368 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-28 04:12:47,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 04:12:47,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781454412] [2021-12-28 04:12:47,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781454412] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 04:12:47,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 04:12:47,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 04:12:47,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128971303] [2021-12-28 04:12:47,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 04:12:47,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 04:12:47,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 04:12:47,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 04:12:47,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 04:12:47,372 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-28 04:12:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 04:12:47,518 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2021-12-28 04:12:47,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 04:12:47,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2021-12-28 04:12:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 04:12:47,520 INFO L225 Difference]: With dead ends: 179 [2021-12-28 04:12:47,520 INFO L226 Difference]: Without dead ends: 128 [2021-12-28 04:12:47,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-28 04:12:47,521 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 98 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 04:12:47,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 369 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 04:12:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-28 04:12:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2021-12-28 04:12:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.375) internal successors, (143), 105 states have internal predecessors, (143), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-28 04:12:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 161 transitions. [2021-12-28 04:12:47,543 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 161 transitions. Word has length 61 [2021-12-28 04:12:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 04:12:47,544 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 161 transitions. [2021-12-28 04:12:47,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-28 04:12:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 161 transitions. [2021-12-28 04:12:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-28 04:12:47,545 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 04:12:47,546 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 04:12:47,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 04:12:47,546 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 04:12:47,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 04:12:47,546 INFO L85 PathProgramCache]: Analyzing trace with hash 668155054, now seen corresponding path program 1 times [2021-12-28 04:12:47,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 04:12:47,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039521094] [2021-12-28 04:12:47,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:47,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 04:12:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 04:12:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 04:12:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 04:12:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 04:12:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-28 04:12:47,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 04:12:47,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039521094] [2021-12-28 04:12:47,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039521094] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 04:12:47,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 04:12:47,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 04:12:47,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968481167] [2021-12-28 04:12:47,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 04:12:47,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 04:12:47,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 04:12:47,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 04:12:47,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 04:12:47,703 INFO L87 Difference]: Start difference. First operand 121 states and 161 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-28 04:12:47,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 04:12:47,770 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2021-12-28 04:12:47,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 04:12:47,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2021-12-28 04:12:47,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 04:12:47,772 INFO L225 Difference]: With dead ends: 135 [2021-12-28 04:12:47,772 INFO L226 Difference]: Without dead ends: 130 [2021-12-28 04:12:47,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-12-28 04:12:47,773 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 126 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 04:12:47,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 249 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 04:12:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-28 04:12:47,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2021-12-28 04:12:47,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 105 states have internal predecessors, (142), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-28 04:12:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 160 transitions. [2021-12-28 04:12:47,780 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 160 transitions. Word has length 64 [2021-12-28 04:12:47,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 04:12:47,781 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 160 transitions. [2021-12-28 04:12:47,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-28 04:12:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 160 transitions. [2021-12-28 04:12:47,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-28 04:12:47,782 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 04:12:47,782 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 04:12:47,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 04:12:47,782 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 04:12:47,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 04:12:47,783 INFO L85 PathProgramCache]: Analyzing trace with hash 725413356, now seen corresponding path program 1 times [2021-12-28 04:12:47,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 04:12:47,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081738623] [2021-12-28 04:12:47,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:47,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 04:12:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 04:12:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 04:12:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 04:12:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 04:12:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-28 04:12:47,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 04:12:47,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081738623] [2021-12-28 04:12:47,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081738623] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 04:12:47,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 04:12:47,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 04:12:47,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904682550] [2021-12-28 04:12:47,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 04:12:47,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 04:12:47,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 04:12:47,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 04:12:47,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 04:12:47,892 INFO L87 Difference]: Start difference. First operand 121 states and 160 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-28 04:12:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 04:12:47,990 INFO L93 Difference]: Finished difference Result 304 states and 419 transitions. [2021-12-28 04:12:47,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 04:12:47,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 64 [2021-12-28 04:12:47,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 04:12:47,992 INFO L225 Difference]: With dead ends: 304 [2021-12-28 04:12:47,992 INFO L226 Difference]: Without dead ends: 209 [2021-12-28 04:12:47,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-12-28 04:12:47,993 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 115 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 04:12:47,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 360 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 04:12:47,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-28 04:12:48,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 201. [2021-12-28 04:12:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 180 states have (on average 1.3944444444444444) internal successors, (251), 181 states have internal predecessors, (251), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-28 04:12:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 273 transitions. [2021-12-28 04:12:48,003 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 273 transitions. Word has length 64 [2021-12-28 04:12:48,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 04:12:48,003 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 273 transitions. [2021-12-28 04:12:48,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-28 04:12:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 273 transitions. [2021-12-28 04:12:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-28 04:12:48,004 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 04:12:48,004 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 04:12:48,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 04:12:48,005 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 04:12:48,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 04:12:48,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1104607523, now seen corresponding path program 1 times [2021-12-28 04:12:48,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 04:12:48,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685696535] [2021-12-28 04:12:48,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:48,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 04:12:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 04:12:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 04:12:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 04:12:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 04:12:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-28 04:12:48,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 04:12:48,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685696535] [2021-12-28 04:12:48,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685696535] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 04:12:48,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 04:12:48,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 04:12:48,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428859337] [2021-12-28 04:12:48,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 04:12:48,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 04:12:48,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 04:12:48,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 04:12:48,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 04:12:48,106 INFO L87 Difference]: Start difference. First operand 201 states and 273 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-28 04:12:48,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 04:12:48,186 INFO L93 Difference]: Finished difference Result 443 states and 613 transitions. [2021-12-28 04:12:48,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 04:12:48,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 70 [2021-12-28 04:12:48,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 04:12:48,187 INFO L225 Difference]: With dead ends: 443 [2021-12-28 04:12:48,188 INFO L226 Difference]: Without dead ends: 272 [2021-12-28 04:12:48,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-12-28 04:12:48,189 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 104 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 04:12:48,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 246 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 04:12:48,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-12-28 04:12:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 261. [2021-12-28 04:12:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 240 states have (on average 1.3958333333333333) internal successors, (335), 241 states have internal predecessors, (335), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-28 04:12:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 357 transitions. [2021-12-28 04:12:48,199 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 357 transitions. Word has length 70 [2021-12-28 04:12:48,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 04:12:48,199 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 357 transitions. [2021-12-28 04:12:48,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-28 04:12:48,199 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 357 transitions. [2021-12-28 04:12:48,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-28 04:12:48,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 04:12:48,200 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 04:12:48,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 04:12:48,201 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 04:12:48,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 04:12:48,201 INFO L85 PathProgramCache]: Analyzing trace with hash -49701621, now seen corresponding path program 1 times [2021-12-28 04:12:48,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 04:12:48,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812319348] [2021-12-28 04:12:48,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:48,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 04:12:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 04:12:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 04:12:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 04:12:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 04:12:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-28 04:12:48,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 04:12:48,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812319348] [2021-12-28 04:12:48,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812319348] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 04:12:48,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491877492] [2021-12-28 04:12:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:48,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 04:12:48,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 04:12:48,372 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) [2021-12-28 04:12:48,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 04:12:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:48,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-28 04:12:48,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 04:12:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-28 04:12:48,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 04:12:48,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491877492] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 04:12:48,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 04:12:48,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2021-12-28 04:12:48,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588669661] [2021-12-28 04:12:48,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 04:12:48,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 04:12:48,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 04:12:48,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 04:12:48,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-28 04:12:48,692 INFO L87 Difference]: Start difference. First operand 261 states and 357 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-28 04:12:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 04:12:48,712 INFO L93 Difference]: Finished difference Result 504 states and 696 transitions. [2021-12-28 04:12:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 04:12:48,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 81 [2021-12-28 04:12:48,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 04:12:48,713 INFO L225 Difference]: With dead ends: 504 [2021-12-28 04:12:48,714 INFO L226 Difference]: Without dead ends: 262 [2021-12-28 04:12:48,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-28 04:12:48,715 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 3 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 04:12:48,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 301 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 04:12:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-12-28 04:12:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2021-12-28 04:12:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 241 states have (on average 1.3941908713692945) internal successors, (336), 242 states have internal predecessors, (336), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-28 04:12:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 358 transitions. [2021-12-28 04:12:48,722 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 358 transitions. Word has length 81 [2021-12-28 04:12:48,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 04:12:48,722 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 358 transitions. [2021-12-28 04:12:48,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-28 04:12:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 358 transitions. [2021-12-28 04:12:48,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-28 04:12:48,723 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 04:12:48,723 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 04:12:48,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 04:12:48,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-28 04:12:48,942 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 04:12:48,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 04:12:48,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1260616323, now seen corresponding path program 1 times [2021-12-28 04:12:48,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 04:12:48,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076154377] [2021-12-28 04:12:48,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:48,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 04:12:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 04:12:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 04:12:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 04:12:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 04:12:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-28 04:12:49,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 04:12:49,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076154377] [2021-12-28 04:12:49,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076154377] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 04:12:49,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799023292] [2021-12-28 04:12:49,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:49,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 04:12:49,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 04:12:49,155 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) [2021-12-28 04:12:49,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 04:12:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-28 04:12:49,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 04:12:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-28 04:12:49,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 04:12:49,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799023292] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 04:12:49,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 04:12:49,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2021-12-28 04:12:49,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663785500] [2021-12-28 04:12:49,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 04:12:49,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 04:12:49,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 04:12:49,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 04:12:49,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-28 04:12:49,469 INFO L87 Difference]: Start difference. First operand 262 states and 358 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-28 04:12:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 04:12:49,504 INFO L93 Difference]: Finished difference Result 825 states and 1152 transitions. [2021-12-28 04:12:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 04:12:49,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 83 [2021-12-28 04:12:49,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 04:12:49,507 INFO L225 Difference]: With dead ends: 825 [2021-12-28 04:12:49,507 INFO L226 Difference]: Without dead ends: 594 [2021-12-28 04:12:49,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-28 04:12:49,508 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 224 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 04:12:49,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 496 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 04:12:49,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-12-28 04:12:49,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 268. [2021-12-28 04:12:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 247 states have (on average 1.3765182186234817) internal successors, (340), 248 states have internal predecessors, (340), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-28 04:12:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 362 transitions. [2021-12-28 04:12:49,517 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 362 transitions. Word has length 83 [2021-12-28 04:12:49,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 04:12:49,518 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 362 transitions. [2021-12-28 04:12:49,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-28 04:12:49,518 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 362 transitions. [2021-12-28 04:12:49,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-28 04:12:49,518 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 04:12:49,519 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 04:12:49,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-28 04:12:49,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-28 04:12:49,732 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 04:12:49,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 04:12:49,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1940674693, now seen corresponding path program 1 times [2021-12-28 04:12:49,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 04:12:49,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152173205] [2021-12-28 04:12:49,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:49,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 04:12:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 04:12:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 04:12:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 04:12:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 04:12:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 04:12:49,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 04:12:49,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152173205] [2021-12-28 04:12:49,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152173205] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 04:12:49,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715376698] [2021-12-28 04:12:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:49,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 04:12:49,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 04:12:49,852 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 04:12:49,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 04:12:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 04:12:50,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 04:12:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-28 04:12:50,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 04:12:50,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715376698] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 04:12:50,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 04:12:50,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-28 04:12:50,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152693682] [2021-12-28 04:12:50,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 04:12:50,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 04:12:50,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 04:12:50,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 04:12:50,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-28 04:12:50,213 INFO L87 Difference]: Start difference. First operand 268 states and 362 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-28 04:12:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 04:12:50,226 INFO L93 Difference]: Finished difference Result 643 states and 888 transitions. [2021-12-28 04:12:50,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 04:12:50,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 83 [2021-12-28 04:12:50,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 04:12:50,229 INFO L225 Difference]: With dead ends: 643 [2021-12-28 04:12:50,229 INFO L226 Difference]: Without dead ends: 406 [2021-12-28 04:12:50,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-28 04:12:50,230 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 39 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 04:12:50,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 243 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 04:12:50,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-12-28 04:12:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 255. [2021-12-28 04:12:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 238 states have (on average 1.3739495798319328) internal successors, (327), 239 states have internal predecessors, (327), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-28 04:12:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 345 transitions. [2021-12-28 04:12:50,239 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 345 transitions. Word has length 83 [2021-12-28 04:12:50,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 04:12:50,239 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 345 transitions. [2021-12-28 04:12:50,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-28 04:12:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 345 transitions. [2021-12-28 04:12:50,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-28 04:12:50,240 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 04:12:50,240 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 04:12:50,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-28 04:12:50,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 04:12:50,460 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 04:12:50,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 04:12:50,460 INFO L85 PathProgramCache]: Analyzing trace with hash 587922057, now seen corresponding path program 1 times [2021-12-28 04:12:50,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 04:12:50,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412516907] [2021-12-28 04:12:50,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:50,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 04:12:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 04:12:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 04:12:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 04:12:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 04:12:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-28 04:12:50,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 04:12:50,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412516907] [2021-12-28 04:12:50,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412516907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 04:12:50,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 04:12:50,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 04:12:50,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085525308] [2021-12-28 04:12:50,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 04:12:50,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 04:12:50,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 04:12:50,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 04:12:50,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 04:12:50,607 INFO L87 Difference]: Start difference. First operand 255 states and 345 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-28 04:12:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 04:12:50,756 INFO L93 Difference]: Finished difference Result 384 states and 524 transitions. [2021-12-28 04:12:50,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 04:12:50,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 85 [2021-12-28 04:12:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 04:12:50,758 INFO L225 Difference]: With dead ends: 384 [2021-12-28 04:12:50,758 INFO L226 Difference]: Without dead ends: 381 [2021-12-28 04:12:50,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-28 04:12:50,759 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 137 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 04:12:50,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 617 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 04:12:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-12-28 04:12:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 374. [2021-12-28 04:12:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 353 states have (on average 1.388101983002833) internal successors, (490), 354 states have internal predecessors, (490), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-28 04:12:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 514 transitions. [2021-12-28 04:12:50,770 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 514 transitions. Word has length 85 [2021-12-28 04:12:50,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 04:12:50,771 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 514 transitions. [2021-12-28 04:12:50,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-28 04:12:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 514 transitions. [2021-12-28 04:12:50,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-28 04:12:50,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 04:12:50,772 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 04:12:50,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 04:12:50,772 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 04:12:50,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 04:12:50,773 INFO L85 PathProgramCache]: Analyzing trace with hash 138660115, now seen corresponding path program 1 times [2021-12-28 04:12:50,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 04:12:50,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913512163] [2021-12-28 04:12:50,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:50,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 04:12:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 04:12:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 04:12:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 04:12:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 04:12:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-28 04:12:50,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 04:12:50,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913512163] [2021-12-28 04:12:50,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913512163] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 04:12:50,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 04:12:50,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 04:12:50,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500588347] [2021-12-28 04:12:50,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 04:12:50,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 04:12:50,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 04:12:50,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 04:12:50,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 04:12:50,866 INFO L87 Difference]: Start difference. First operand 374 states and 514 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-28 04:12:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 04:12:50,954 INFO L93 Difference]: Finished difference Result 773 states and 1076 transitions. [2021-12-28 04:12:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 04:12:50,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2021-12-28 04:12:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 04:12:50,957 INFO L225 Difference]: With dead ends: 773 [2021-12-28 04:12:50,957 INFO L226 Difference]: Without dead ends: 525 [2021-12-28 04:12:50,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-28 04:12:50,958 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 65 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 04:12:50,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 541 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 04:12:50,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-12-28 04:12:50,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 374. [2021-12-28 04:12:50,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 353 states have (on average 1.3767705382436262) internal successors, (486), 354 states have internal predecessors, (486), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-28 04:12:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 510 transitions. [2021-12-28 04:12:50,975 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 510 transitions. Word has length 92 [2021-12-28 04:12:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 04:12:50,975 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 510 transitions. [2021-12-28 04:12:50,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-28 04:12:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 510 transitions. [2021-12-28 04:12:50,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-28 04:12:50,977 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 04:12:50,977 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 04:12:50,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 04:12:50,977 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 04:12:50,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 04:12:50,978 INFO L85 PathProgramCache]: Analyzing trace with hash -882408239, now seen corresponding path program 1 times [2021-12-28 04:12:50,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 04:12:50,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32288840] [2021-12-28 04:12:50,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:50,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 04:12:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 04:12:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 04:12:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 04:12:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 04:12:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-28 04:12:51,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 04:12:51,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32288840] [2021-12-28 04:12:51,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32288840] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 04:12:51,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 04:12:51,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 04:12:51,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897159245] [2021-12-28 04:12:51,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 04:12:51,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 04:12:51,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 04:12:51,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 04:12:51,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 04:12:51,119 INFO L87 Difference]: Start difference. First operand 374 states and 510 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-28 04:12:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 04:12:51,298 INFO L93 Difference]: Finished difference Result 940 states and 1311 transitions. [2021-12-28 04:12:51,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 04:12:51,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2021-12-28 04:12:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 04:12:51,301 INFO L225 Difference]: With dead ends: 940 [2021-12-28 04:12:51,301 INFO L226 Difference]: Without dead ends: 692 [2021-12-28 04:12:51,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-28 04:12:51,302 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 245 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 04:12:51,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 730 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 04:12:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-12-28 04:12:51,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 374. [2021-12-28 04:12:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 353 states have (on average 1.3654390934844192) internal successors, (482), 354 states have internal predecessors, (482), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-28 04:12:51,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 506 transitions. [2021-12-28 04:12:51,322 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 506 transitions. Word has length 92 [2021-12-28 04:12:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 04:12:51,322 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 506 transitions. [2021-12-28 04:12:51,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-28 04:12:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 506 transitions. [2021-12-28 04:12:51,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-28 04:12:51,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 04:12:51,325 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 04:12:51,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 04:12:51,325 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 04:12:51,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 04:12:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2027716343, now seen corresponding path program 1 times [2021-12-28 04:12:51,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 04:12:51,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087623354] [2021-12-28 04:12:51,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:51,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 04:12:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 04:12:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 04:12:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 04:12:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-28 04:12:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 04:12:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,608 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-28 04:12:51,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 04:12:51,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087623354] [2021-12-28 04:12:51,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087623354] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 04:12:51,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684065979] [2021-12-28 04:12:51,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:51,608 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 04:12:51,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 04:12:51,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 04:12:51,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-28 04:12:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:51,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-28 04:12:51,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 04:12:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 04:12:51,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 04:12:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-28 04:12:52,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684065979] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 04:12:52,176 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 04:12:52,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2021-12-28 04:12:52,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319441815] [2021-12-28 04:12:52,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 04:12:52,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 04:12:52,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 04:12:52,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 04:12:52,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-12-28 04:12:52,177 INFO L87 Difference]: Start difference. First operand 374 states and 506 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 10 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-28 04:12:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 04:12:52,414 INFO L93 Difference]: Finished difference Result 739 states and 1006 transitions. [2021-12-28 04:12:52,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 04:12:52,415 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 10 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2021-12-28 04:12:52,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 04:12:52,416 INFO L225 Difference]: With dead ends: 739 [2021-12-28 04:12:52,417 INFO L226 Difference]: Without dead ends: 381 [2021-12-28 04:12:52,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2021-12-28 04:12:52,418 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 77 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 04:12:52,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 362 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 04:12:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-12-28 04:12:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2021-12-28 04:12:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 358 states have (on average 1.3603351955307263) internal successors, (487), 361 states have internal predecessors, (487), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2021-12-28 04:12:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 513 transitions. [2021-12-28 04:12:52,433 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 513 transitions. Word has length 99 [2021-12-28 04:12:52,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 04:12:52,433 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 513 transitions. [2021-12-28 04:12:52,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 10 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-28 04:12:52,434 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 513 transitions. [2021-12-28 04:12:52,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-28 04:12:52,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 04:12:52,435 INFO L514 BasicCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 04:12:52,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-28 04:12:52,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 04:12:52,655 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 04:12:52,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 04:12:52,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1894269569, now seen corresponding path program 2 times [2021-12-28 04:12:52,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 04:12:52,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460756358] [2021-12-28 04:12:52,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:52,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 04:12:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:52,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 04:12:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:52,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:52,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:52,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 04:12:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:52,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:52,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:52,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 04:12:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:52,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 04:12:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:52,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 04:12:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-28 04:12:52,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 04:12:52,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460756358] [2021-12-28 04:12:52,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460756358] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 04:12:52,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 04:12:52,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 04:12:52,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198063554] [2021-12-28 04:12:52,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 04:12:52,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 04:12:52,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 04:12:52,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 04:12:52,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-28 04:12:52,817 INFO L87 Difference]: Start difference. First operand 381 states and 513 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 04:12:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 04:12:53,018 INFO L93 Difference]: Finished difference Result 964 states and 1323 transitions. [2021-12-28 04:12:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 04:12:53,018 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 105 [2021-12-28 04:12:53,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 04:12:53,020 INFO L225 Difference]: With dead ends: 964 [2021-12-28 04:12:53,020 INFO L226 Difference]: Without dead ends: 617 [2021-12-28 04:12:53,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-12-28 04:12:53,021 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 82 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 04:12:53,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 784 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 04:12:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-12-28 04:12:53,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 393. [2021-12-28 04:12:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 370 states have (on average 1.3486486486486486) internal successors, (499), 373 states have internal predecessors, (499), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2021-12-28 04:12:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 525 transitions. [2021-12-28 04:12:53,038 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 525 transitions. Word has length 105 [2021-12-28 04:12:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 04:12:53,038 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 525 transitions. [2021-12-28 04:12:53,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 04:12:53,039 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 525 transitions. [2021-12-28 04:12:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-28 04:12:53,039 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 04:12:53,040 INFO L514 BasicCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 04:12:53,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 04:12:53,040 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 04:12:53,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 04:12:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1192669695, now seen corresponding path program 1 times [2021-12-28 04:12:53,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 04:12:53,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895483054] [2021-12-28 04:12:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:53,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 04:12:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:53,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 04:12:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:53,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:53,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:53,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 04:12:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:53,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:53,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:53,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 04:12:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:53,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 04:12:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:54,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 04:12:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-28 04:12:54,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 04:12:54,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895483054] [2021-12-28 04:12:54,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895483054] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 04:12:54,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603215654] [2021-12-28 04:12:54,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:54,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 04:12:54,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 04:12:54,223 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 04:12:54,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-28 04:12:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:54,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-28 04:12:54,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 04:12:54,809 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 04:12:54,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 72 [2021-12-28 04:12:54,821 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 04:12:54,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 51 [2021-12-28 04:12:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-28 04:12:54,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 04:12:54,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603215654] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 04:12:54,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 04:12:54,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [23] total 28 [2021-12-28 04:12:54,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036356970] [2021-12-28 04:12:54,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 04:12:54,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 04:12:54,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 04:12:54,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 04:12:54,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2021-12-28 04:12:54,972 INFO L87 Difference]: Start difference. First operand 393 states and 525 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 04:12:55,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 04:12:55,207 INFO L93 Difference]: Finished difference Result 870 states and 1171 transitions. [2021-12-28 04:12:55,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 04:12:55,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 105 [2021-12-28 04:12:55,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 04:12:55,210 INFO L225 Difference]: With dead ends: 870 [2021-12-28 04:12:55,210 INFO L226 Difference]: Without dead ends: 602 [2021-12-28 04:12:55,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2021-12-28 04:12:55,211 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 204 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 04:12:55,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 1115 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 04:12:55,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2021-12-28 04:12:55,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 284. [2021-12-28 04:12:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 265 states have (on average 1.3132075471698113) internal successors, (348), 266 states have internal predecessors, (348), 12 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-28 04:12:55,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 370 transitions. [2021-12-28 04:12:55,231 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 370 transitions. Word has length 105 [2021-12-28 04:12:55,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 04:12:55,232 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 370 transitions. [2021-12-28 04:12:55,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 04:12:55,232 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 370 transitions. [2021-12-28 04:12:55,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-28 04:12:55,234 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 04:12:55,234 INFO L514 BasicCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 04:12:55,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-28 04:12:55,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-28 04:12:55,454 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 04:12:55,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 04:12:55,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1062893161, now seen corresponding path program 1 times [2021-12-28 04:12:55,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 04:12:55,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693672194] [2021-12-28 04:12:55,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:55,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 04:12:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 04:12:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 04:12:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 04:12:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 04:12:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 04:12:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-28 04:12:55,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 04:12:55,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693672194] [2021-12-28 04:12:55,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693672194] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 04:12:55,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 04:12:55,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 04:12:55,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994216033] [2021-12-28 04:12:55,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 04:12:55,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 04:12:55,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 04:12:55,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 04:12:55,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-28 04:12:55,653 INFO L87 Difference]: Start difference. First operand 284 states and 370 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 04:12:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 04:12:55,819 INFO L93 Difference]: Finished difference Result 286 states and 371 transitions. [2021-12-28 04:12:55,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 04:12:55,820 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 107 [2021-12-28 04:12:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 04:12:55,821 INFO L225 Difference]: With dead ends: 286 [2021-12-28 04:12:55,821 INFO L226 Difference]: Without dead ends: 279 [2021-12-28 04:12:55,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-12-28 04:12:55,823 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 226 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 04:12:55,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 342 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 04:12:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-28 04:12:55,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2021-12-28 04:12:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 11 states have call successors, (11), 9 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-28 04:12:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 361 transitions. [2021-12-28 04:12:55,841 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 361 transitions. Word has length 107 [2021-12-28 04:12:55,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 04:12:55,841 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 361 transitions. [2021-12-28 04:12:55,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 04:12:55,842 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 361 transitions. [2021-12-28 04:12:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-28 04:12:55,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 04:12:55,843 INFO L514 BasicCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 04:12:55,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 04:12:55,843 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 04:12:55,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 04:12:55,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1411237866, now seen corresponding path program 1 times [2021-12-28 04:12:55,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 04:12:55,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725203431] [2021-12-28 04:12:55,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:55,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 04:12:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 04:12:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 04:12:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 04:12:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 04:12:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 04:12:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 04:12:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 04:12:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-28 04:12:55,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 04:12:55,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725203431] [2021-12-28 04:12:55,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725203431] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 04:12:55,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248848746] [2021-12-28 04:12:55,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 04:12:55,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 04:12:55,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 04:12:55,990 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 04:12:55,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-28 04:12:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 04:12:56,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 04:12:56,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 04:12:56,414 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-28 04:12:56,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 04:12:56,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248848746] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 04:12:56,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 04:12:56,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2021-12-28 04:12:56,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267002800] [2021-12-28 04:12:56,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 04:12:56,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 04:12:56,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 04:12:56,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 04:12:56,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-28 04:12:56,415 INFO L87 Difference]: Start difference. First operand 279 states and 361 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-28 04:12:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 04:12:56,449 INFO L93 Difference]: Finished difference Result 279 states and 361 transitions. [2021-12-28 04:12:56,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 04:12:56,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 118 [2021-12-28 04:12:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 04:12:56,450 INFO L225 Difference]: With dead ends: 279 [2021-12-28 04:12:56,450 INFO L226 Difference]: Without dead ends: 0 [2021-12-28 04:12:56,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-28 04:12:56,451 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 73 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 04:12:56,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 162 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 04:12:56,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-28 04:12:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-28 04:12:56,452 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) [2021-12-28 04:12:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-28 04:12:56,452 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2021-12-28 04:12:56,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 04:12:56,452 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 04:12:56,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-28 04:12:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-28 04:12:56,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-28 04:12:56,455 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 04:12:56,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-28 04:12:56,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-28 04:12:56,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-28 04:12:58,646 INFO L858 garLoopResultBuilder]: For program point ldv_init_zallocFINAL(lines 5894 5904) no Hoare annotation was computed. [2021-12-28 04:12:58,647 INFO L854 garLoopResultBuilder]: At program point L5899(line 5899) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (= |#memory_int| |old(#memory_int)|) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0))) [2021-12-28 04:12:58,647 INFO L858 garLoopResultBuilder]: For program point L5899-1(line 5899) no Hoare annotation was computed. [2021-12-28 04:12:58,647 INFO L861 garLoopResultBuilder]: At program point L5901(line 5901) the Hoare annotation is: true [2021-12-28 04:12:58,647 INFO L858 garLoopResultBuilder]: For program point ldv_init_zallocEXIT(lines 5894 5904) no Hoare annotation was computed. [2021-12-28 04:12:58,647 INFO L858 garLoopResultBuilder]: For program point L5901-1(line 5901) no Hoare annotation was computed. [2021-12-28 04:12:58,647 INFO L854 garLoopResultBuilder]: At program point ldv_init_zallocENTRY(lines 5894 5904) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) [2021-12-28 04:12:58,647 INFO L858 garLoopResultBuilder]: For program point L5858-2(lines 5857 5859) no Hoare annotation was computed. [2021-12-28 04:12:58,647 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5857 5859) the Hoare annotation is: true [2021-12-28 04:12:58,647 INFO L858 garLoopResultBuilder]: For program point L5858(line 5858) no Hoare annotation was computed. [2021-12-28 04:12:58,647 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5857 5859) no Hoare annotation was computed. [2021-12-28 04:12:58,647 INFO L858 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 6260 6266) no Hoare annotation was computed. [2021-12-28 04:12:58,647 INFO L861 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 6260 6266) the Hoare annotation is: true [2021-12-28 04:12:58,647 INFO L858 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6264) no Hoare annotation was computed. [2021-12-28 04:12:58,647 INFO L858 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 6260 6266) no Hoare annotation was computed. [2021-12-28 04:12:58,647 INFO L858 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5929 5935) no Hoare annotation was computed. [2021-12-28 04:12:58,647 INFO L861 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5929 5935) the Hoare annotation is: true [2021-12-28 04:12:58,647 INFO L858 garLoopResultBuilder]: For program point L6113-2(lines 6113 6116) no Hoare annotation was computed. [2021-12-28 04:12:58,647 INFO L858 garLoopResultBuilder]: For program point L6113(lines 6113 6116) no Hoare annotation was computed. [2021-12-28 04:12:58,648 INFO L854 garLoopResultBuilder]: At program point L6394(lines 6393 6395) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_0~0 1) (= ~ldv_retval_0~0 0)) [2021-12-28 04:12:58,648 INFO L854 garLoopResultBuilder]: At program point L6237(lines 6167 6242) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-12-28 04:12:58,648 INFO L858 garLoopResultBuilder]: For program point L6204(lines 6204 6209) no Hoare annotation was computed. [2021-12-28 04:12:58,648 INFO L854 garLoopResultBuilder]: At program point L6328(lines 6314 6330) the Hoare annotation is: (let ((.cse7 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse5 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse7)) (.cse6 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse7)))) (let ((.cse3 (select (select |#memory_$Pointer$.base| .cse5) .cse6)) (.cse4 (select (select |#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse0 (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse4)) (.cse1 (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse3)) (.cse2 (= ~ldv_retval_0~0 0))) (or (and (= ~ldv_module_refcounter~0 1) .cse0 .cse1 (= |ULTIMATE.start_ldv_try_module_get_#res#1| 0) .cse2) (and (<= 2 ~ldv_module_refcounter~0) (not (= (mod (+ .cse3 .cse4) 18446744073709551616) 0)) .cse0 .cse1 (<= ~ldv_module_refcounter~0 2) .cse2 (= |ULTIMATE.start_ldv_try_module_get_#res#1| 1))))))) [2021-12-28 04:12:58,648 INFO L858 garLoopResultBuilder]: For program point L6320(lines 6320 6325) no Hoare annotation was computed. [2021-12-28 04:12:58,648 INFO L854 garLoopResultBuilder]: At program point L6221(lines 6167 6242) the Hoare annotation is: (= ~ldv_module_refcounter~0 1) [2021-12-28 04:12:58,648 INFO L858 garLoopResultBuilder]: For program point L6180(lines 6180 6236) no Hoare annotation was computed. [2021-12-28 04:12:58,648 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-28 04:12:58,648 INFO L858 garLoopResultBuilder]: For program point L6362(lines 6362 6365) no Hoare annotation was computed. [2021-12-28 04:12:58,648 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-28 04:12:58,648 INFO L861 garLoopResultBuilder]: At program point L6362-1(lines 6359 6368) the Hoare annotation is: true [2021-12-28 04:12:58,648 INFO L854 garLoopResultBuilder]: At program point L6255(line 6255) the Hoare annotation is: (let ((.cse4 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4)))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (.cse0 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (and (not (= (mod (+ |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.offset| |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.base|) 18446744073709551616) 0)) (<= (div |ULTIMATE.start_pppox_create_~tmp~8#1| 256) 0) (<= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 1) (<= 2 ~ldv_module_refcounter~0) (not (= (mod (+ .cse0 .cse1) 18446744073709551616) 0)) (<= 1 |ULTIMATE.start_pppox_create_~tmp~8#1|) (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1) (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0) (<= ~ldv_module_refcounter~0 2) (= |ULTIMATE.start_pppox_create_~tmp___0~3#1| 0) (= ~ldv_retval_0~0 0) (= |ULTIMATE.start_ldv_try_module_get_#res#1| 1) (<= 1 |ULTIMATE.start_ldv_try_module_get_5_#res#1|))))) [2021-12-28 04:12:58,648 INFO L854 garLoopResultBuilder]: At program point L6255-1(lines 6252 6258) the Hoare annotation is: (let ((.cse4 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4)))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (.cse0 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (and (= ~ldv_module_refcounter~0 1) (not (= (mod (+ |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.offset| |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.base|) 18446744073709551616) 0)) (<= (div |ULTIMATE.start_pppox_create_~tmp~8#1| 256) 0) (<= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 1) (not (= (mod (+ .cse0 .cse1) 18446744073709551616) 0)) (<= 1 |ULTIMATE.start_pppox_create_~tmp~8#1|) (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1) (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0) (= |ULTIMATE.start_pppox_create_~tmp___0~3#1| 0) (= ~ldv_retval_0~0 0) (= |ULTIMATE.start_ldv_try_module_get_#res#1| 1) (<= 1 |ULTIMATE.start_ldv_try_module_get_5_#res#1|))))) [2021-12-28 04:12:58,648 INFO L858 garLoopResultBuilder]: For program point L6214(lines 6214 6218) no Hoare annotation was computed. [2021-12-28 04:12:58,648 INFO L858 garLoopResultBuilder]: For program point L6181(line 6181) no Hoare annotation was computed. [2021-12-28 04:12:58,648 INFO L858 garLoopResultBuilder]: For program point L6214-2(lines 6212 6224) no Hoare annotation was computed. [2021-12-28 04:12:58,648 INFO L854 garLoopResultBuilder]: At program point L6363(line 6363) the Hoare annotation is: false [2021-12-28 04:12:58,648 INFO L854 garLoopResultBuilder]: At program point L6173(line 6173) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-12-28 04:12:58,648 INFO L858 garLoopResultBuilder]: For program point L6173-1(line 6173) no Hoare annotation was computed. [2021-12-28 04:12:58,649 INFO L858 garLoopResultBuilder]: For program point L6182(lines 6182 6197) no Hoare annotation was computed. [2021-12-28 04:12:58,649 INFO L854 garLoopResultBuilder]: At program point L6174(line 6174) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-12-28 04:12:58,649 INFO L854 garLoopResultBuilder]: At program point L5918(lines 5913 5920) the Hoare annotation is: (let ((.cse4 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4)))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (.cse0 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (and (= ~ldv_module_refcounter~0 1) (not (= (mod (+ .cse0 .cse1) 18446744073709551616) 0)) (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1) (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0) (= ~ldv_retval_0~0 0))))) [2021-12-28 04:12:58,649 INFO L858 garLoopResultBuilder]: For program point L6174-1(line 6174) no Hoare annotation was computed. [2021-12-28 04:12:58,649 INFO L858 garLoopResultBuilder]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2021-12-28 04:12:58,649 INFO L854 garLoopResultBuilder]: At program point L6397(lines 6396 6398) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-12-28 04:12:58,649 INFO L858 garLoopResultBuilder]: For program point L6199(line 6199) no Hoare annotation was computed. [2021-12-28 04:12:58,649 INFO L854 garLoopResultBuilder]: At program point L6133(lines 6106 6135) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-12-28 04:12:58,649 INFO L854 garLoopResultBuilder]: At program point L6150(lines 6146 6152) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-12-28 04:12:58,649 INFO L854 garLoopResultBuilder]: At program point L6249(lines 6244 6251) the Hoare annotation is: (let ((.cse7 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse5 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse7)) (.cse6 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse7)))) (let ((.cse3 (select (select |#memory_$Pointer$.base| .cse5) .cse6)) (.cse4 (select (select |#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse0 (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse4)) (.cse1 (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse3)) (.cse2 (= ~ldv_retval_0~0 0))) (or (and (= ~ldv_module_refcounter~0 1) (= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 0) .cse0 .cse1 (= |ULTIMATE.start_ldv_try_module_get_#res#1| 0) .cse2) (and (<= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 1) (<= 2 ~ldv_module_refcounter~0) (not (= (mod (+ .cse3 .cse4) 18446744073709551616) 0)) .cse0 .cse1 (<= ~ldv_module_refcounter~0 2) .cse2 (= |ULTIMATE.start_ldv_try_module_get_#res#1| 1) (<= 1 |ULTIMATE.start_ldv_try_module_get_5_#res#1|))))))) [2021-12-28 04:12:58,649 INFO L858 garLoopResultBuilder]: For program point L6117(lines 6117 6130) no Hoare annotation was computed. [2021-12-28 04:12:58,649 INFO L861 garLoopResultBuilder]: At program point L6241(lines 6156 6243) the Hoare annotation is: true [2021-12-28 04:12:58,649 INFO L854 garLoopResultBuilder]: At program point L6134(lines 6101 6136) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-12-28 04:12:58,649 INFO L858 garLoopResultBuilder]: For program point L6200(lines 6200 6232) no Hoare annotation was computed. [2021-12-28 04:12:58,649 INFO L858 garLoopResultBuilder]: For program point L6192(line 6192) no Hoare annotation was computed. [2021-12-28 04:12:58,649 INFO L858 garLoopResultBuilder]: For program point L6184(lines 6184 6194) no Hoare annotation was computed. [2021-12-28 04:12:58,649 INFO L854 garLoopResultBuilder]: At program point L6143(lines 6138 6145) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_0~0 1) (= ~ldv_retval_0~0 0)) [2021-12-28 04:12:58,649 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-28 04:12:58,649 INFO L858 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-12-28 04:12:58,649 INFO L858 garLoopResultBuilder]: For program point L6234(line 6234) no Hoare annotation was computed. [2021-12-28 04:12:58,649 INFO L858 garLoopResultBuilder]: For program point L6168-1(line 6168) no Hoare annotation was computed. [2021-12-28 04:12:58,649 INFO L854 garLoopResultBuilder]: At program point L6168(line 6168) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-12-28 04:12:58,649 INFO L861 garLoopResultBuilder]: At program point L6193(line 6193) the Hoare annotation is: true [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point L6185(line 6185) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L861 garLoopResultBuilder]: At program point L6235(line 6235) the Hoare annotation is: true [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point L6202(lines 6202 6229) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point L6227(line 6227) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point L6318(lines 6318 6327) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point L6186(lines 6186 6190) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point L6211(line 6211) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point L6203(line 6203) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L854 garLoopResultBuilder]: At program point L6170(line 6170) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point L6170-1(line 6170) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L861 garLoopResultBuilder]: At program point L6228(line 6228) the Hoare annotation is: true [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point L6121-2(lines 6119 6130) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point L6121(lines 6121 6125) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L854 garLoopResultBuilder]: At program point L6377(lines 6376 6378) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point L6212(lines 6212 6225) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point L6334(lines 6334 6341) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point L6335-1(lines 6335 6338) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point L6335(lines 6335 6338) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L854 garLoopResultBuilder]: At program point L6336(line 6336) the Hoare annotation is: (or (not (<= |old(~ldv_module_refcounter~0)| 2)) (not (= ~ldv_retval_0~0 0)) (not (<= 2 |old(~ldv_module_refcounter~0)|))) [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point L6334-2(lines 6331 6344) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L854 garLoopResultBuilder]: At program point ldv_module_putENTRY(lines 6331 6344) the Hoare annotation is: (or (not (<= |old(~ldv_module_refcounter~0)| 2)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= ~ldv_retval_0~0 0)) (not (<= 2 |old(~ldv_module_refcounter~0)|))) [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point ldv_module_putEXIT(lines 6331 6344) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point ldv_memsetFINAL(lines 5905 5912) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L861 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-12-28 04:12:58,650 INFO L858 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-12-28 04:12:58,650 INFO L854 garLoopResultBuilder]: At program point ldv_memsetENTRY(lines 5905 5912) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0))) [2021-12-28 04:12:58,651 INFO L858 garLoopResultBuilder]: For program point ldv_memsetEXIT(lines 5905 5912) no Hoare annotation was computed. [2021-12-28 04:12:58,651 INFO L854 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (= |#memory_int| |old(#memory_int)|) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0))) [2021-12-28 04:12:58,651 INFO L858 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2021-12-28 04:12:58,651 INFO L858 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2021-12-28 04:12:58,653 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 04:12:58,654 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 04:12:58,660 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,661 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,661 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,661 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,661 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,661 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,661 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,689 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,709 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,713 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,713 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,714 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,714 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,714 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,714 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,715 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,715 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,719 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,719 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 04:12:58 BoogieIcfgContainer [2021-12-28 04:12:58,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 04:12:58,722 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 04:12:58,722 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 04:12:58,723 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 04:12:58,723 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 04:12:46" (3/4) ... [2021-12-28 04:12:58,725 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-28 04:12:58,729 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2021-12-28 04:12:58,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2021-12-28 04:12:58,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2021-12-28 04:12:58,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2021-12-28 04:12:58,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-28 04:12:58,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2021-12-28 04:12:58,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2021-12-28 04:12:58,735 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2021-12-28 04:12:58,736 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-12-28 04:12:58,736 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-28 04:12:58,736 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-28 04:12:58,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((ldv_module_refcounter == 1 && !((ldv_func_arg1 + ldv_func_arg1) % 18446744073709551616 == 0)) && tmp / 256 <= 0) && \result <= 1) && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && 1 <= tmp) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && tmp___0 == 0) && ldv_retval_0 == 0) && \result == 1) && 1 <= \result [2021-12-28 04:12:58,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_module_refcounter == 1 && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && \result == 0) && ldv_retval_0 == 0) || ((((((2 <= ldv_module_refcounter && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && ldv_module_refcounter <= 2) && ldv_retval_0 == 0) && \result == 1) [2021-12-28 04:12:58,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((ldv_module_refcounter == 1 && \result == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && \result == 0) && ldv_retval_0 == 0) || ((((((((\result <= 1 && 2 <= ldv_module_refcounter) && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && ldv_module_refcounter <= 2) && ldv_retval_0 == 0) && \result == 1) && 1 <= \result) [2021-12-28 04:12:58,780 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 04:12:58,780 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 04:12:58,781 INFO L158 Benchmark]: Toolchain (without parser) took 13950.77ms. Allocated memory was 60.8MB in the beginning and 388.0MB in the end (delta: 327.2MB). Free memory was 34.2MB in the beginning and 303.5MB in the end (delta: -269.4MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2021-12-28 04:12:58,781 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 60.8MB. Free memory was 43.9MB in the beginning and 43.9MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 04:12:58,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 909.04ms. Allocated memory was 60.8MB in the beginning and 90.2MB in the end (delta: 29.4MB). Free memory was 34.0MB in the beginning and 40.7MB in the end (delta: -6.7MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2021-12-28 04:12:58,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.98ms. Allocated memory is still 90.2MB. Free memory was 40.7MB in the beginning and 37.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 04:12:58,782 INFO L158 Benchmark]: Boogie Preprocessor took 62.35ms. Allocated memory is still 90.2MB. Free memory was 37.3MB in the beginning and 33.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-28 04:12:58,782 INFO L158 Benchmark]: RCFGBuilder took 551.62ms. Allocated memory was 90.2MB in the beginning and 180.4MB in the end (delta: 90.2MB). Free memory was 33.7MB in the beginning and 131.0MB in the end (delta: -97.3MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2021-12-28 04:12:58,782 INFO L158 Benchmark]: TraceAbstraction took 12293.90ms. Allocated memory was 180.4MB in the beginning and 388.0MB in the end (delta: 207.6MB). Free memory was 130.6MB in the beginning and 315.1MB in the end (delta: -184.5MB). Peak memory consumption was 231.8MB. Max. memory is 16.1GB. [2021-12-28 04:12:58,782 INFO L158 Benchmark]: Witness Printer took 58.16ms. Allocated memory is still 388.0MB. Free memory was 315.1MB in the beginning and 303.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-28 04:12:58,795 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 60.8MB. Free memory was 43.9MB in the beginning and 43.9MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 909.04ms. Allocated memory was 60.8MB in the beginning and 90.2MB in the end (delta: 29.4MB). Free memory was 34.0MB in the beginning and 40.7MB in the end (delta: -6.7MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.98ms. Allocated memory is still 90.2MB. Free memory was 40.7MB in the beginning and 37.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.35ms. Allocated memory is still 90.2MB. Free memory was 37.3MB in the beginning and 33.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 551.62ms. Allocated memory was 90.2MB in the beginning and 180.4MB in the end (delta: 90.2MB). Free memory was 33.7MB in the beginning and 131.0MB in the end (delta: -97.3MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12293.90ms. Allocated memory was 180.4MB in the beginning and 388.0MB in the end (delta: 207.6MB). Free memory was 130.6MB in the beginning and 315.1MB in the end (delta: -184.5MB). Peak memory consumption was 231.8MB. Max. memory is 16.1GB. * Witness Printer took 58.16ms. Allocated memory is still 388.0MB. Free memory was 315.1MB in the beginning and 303.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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: 6264]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 16, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1863 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1850 mSDsluCounter, 7183 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5212 mSDsCounter, 363 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1151 IncrementalHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 363 mSolverCounterUnsat, 1971 mSDtfsCounter, 1151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1078 GetRequests, 915 SyntacticMatches, 2 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=13, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 1534 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 171 PreInvPairs, 242 NumberOfFragments, 973 HoareAnnotationTreeSize, 171 FomulaSimplifications, 24915 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 35 FomulaSimplificationsInter, 47270 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1939 NumberOfCodeBlocks, 1939 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2015 ConstructedInterpolants, 0 QuantifiedInterpolants, 5452 SizeOfPredicates, 41 NumberOfNonLiveVariables, 5310 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 822/896 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: 6244]: Loop Invariant [2021-12-28 04:12:58,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,821 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,821 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,821 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,821 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,821 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,821 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,821 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((ldv_module_refcounter == 1 && \result == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && \result == 0) && ldv_retval_0 == 0) || ((((((((\result <= 1 && 2 <= ldv_module_refcounter) && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && ldv_module_refcounter <= 2) && ldv_retval_0 == 0) && \result == 1) && 1 <= \result) - InvariantResult [Line: 6396]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 6146]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 6138]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_state_variable_0 == 1) && ldv_retval_0 == 0 - InvariantResult [Line: 6314]: Loop Invariant [2021-12-28 04:12:58,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,831 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,831 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,831 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,831 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,831 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,831 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,832 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,832 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,832 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,832 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,832 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,832 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((ldv_module_refcounter == 1 && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && \result == 0) && ldv_retval_0 == 0) || ((((((2 <= ldv_module_refcounter && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && ldv_module_refcounter <= 2) && ldv_retval_0 == 0) && \result == 1) - InvariantResult [Line: 6252]: Loop Invariant [2021-12-28 04:12:58,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,838 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,839 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,839 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,839 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,839 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((ldv_module_refcounter == 1 && !((ldv_func_arg1 + ldv_func_arg1) % 18446744073709551616 == 0)) && tmp / 256 <= 0) && \result <= 1) && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && 1 <= tmp) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && tmp___0 == 0) && ldv_retval_0 == 0) && \result == 1) && 1 <= \result - InvariantResult [Line: 6156]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6376]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_state_variable_1 == 0) && ldv_retval_0 == 0 - InvariantResult [Line: 6167]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 - InvariantResult [Line: 6359]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6167]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 6101]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 - InvariantResult [Line: 5913]: Loop Invariant [2021-12-28 04:12:58,841 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,841 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,841 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,844 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,844 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,844 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-28 04:12:58,844 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,844 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-28 04:12:58,844 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((ldv_module_refcounter == 1 && !((#memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) % 18446744073709551616 == 0)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]][16 + #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]]) && ldv_retval_0 == 0 - InvariantResult [Line: 5929]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6393]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_state_variable_0 == 1) && ldv_retval_0 == 0 - InvariantResult [Line: 6106]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 && ldv_retval_0 == 0 RESULT: Ultimate proved your program to be correct! [2021-12-28 04:12:58,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE