./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-16 04:14:26,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 04:14:26,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 04:14:26,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 04:14:26,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 04:14:26,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 04:14:26,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 04:14:26,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 04:14:26,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 04:14:26,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 04:14:26,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 04:14:26,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 04:14:26,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 04:14:26,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 04:14:26,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 04:14:26,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 04:14:26,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 04:14:26,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 04:14:26,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 04:14:26,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 04:14:26,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 04:14:26,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 04:14:26,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 04:14:26,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 04:14:26,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 04:14:26,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 04:14:26,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 04:14:26,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 04:14:26,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 04:14:26,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 04:14:26,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 04:14:26,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 04:14:26,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 04:14:26,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 04:14:26,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 04:14:26,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 04:14:26,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 04:14:26,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 04:14:26,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 04:14:26,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 04:14:26,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 04:14:26,661 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-16 04:14:26,686 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 04:14:26,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 04:14:26,687 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 04:14:26,687 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 04:14:26,688 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 04:14:26,688 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 04:14:26,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 04:14:26,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 04:14:26,689 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 04:14:26,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 04:14:26,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 04:14:26,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 04:14:26,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 04:14:26,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 04:14:26,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 04:14:26,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 04:14:26,691 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 04:14:26,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 04:14:26,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 04:14:26,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 04:14:26,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 04:14:26,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 04:14:26,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 04:14:26,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 04:14:26,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 04:14:26,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 04:14:26,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 04:14:26,693 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 04:14:26,693 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 04:14:26,693 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 04:14:26,693 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 04:14:26,693 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-16 04:14:26,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 04:14:26,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 04:14:26,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 04:14:26,935 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 04:14:26,935 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 04:14:26,936 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-16 04:14:26,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3e47d348/fbdfd853e3f540e3801bbd1a7629ca69/FLAGd6bb9ace0 [2021-12-16 04:14:27,523 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 04:14:27,523 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-16 04:14:27,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3e47d348/fbdfd853e3f540e3801bbd1a7629ca69/FLAGd6bb9ace0 [2021-12-16 04:14:28,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3e47d348/fbdfd853e3f540e3801bbd1a7629ca69 [2021-12-16 04:14:28,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 04:14:28,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 04:14:28,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 04:14:28,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 04:14:28,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 04:14:28,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:14:28" (1/1) ... [2021-12-16 04:14:28,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405ce438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:28, skipping insertion in model container [2021-12-16 04:14:28,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:14:28" (1/1) ... [2021-12-16 04:14:28,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 04:14:28,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 04:14:28,647 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-16 04:14:28,719 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 04:14:28,746 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 04:14:28,891 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-16 04:14:28,901 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 04:14:28,930 INFO L208 MainTranslator]: Completed translation [2021-12-16 04:14:28,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:28 WrapperNode [2021-12-16 04:14:28,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 04:14:28,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 04:14:28,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 04:14:28,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 04:14:28,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:28" (1/1) ... [2021-12-16 04:14:28,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:28" (1/1) ... [2021-12-16 04:14:29,002 INFO L137 Inliner]: procedures = 68, calls = 170, calls flagged for inlining = 22, calls inlined = 15, statements flattened = 343 [2021-12-16 04:14:29,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 04:14:29,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 04:14:29,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 04:14:29,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 04:14:29,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:28" (1/1) ... [2021-12-16 04:14:29,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:28" (1/1) ... [2021-12-16 04:14:29,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:28" (1/1) ... [2021-12-16 04:14:29,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:28" (1/1) ... [2021-12-16 04:14:29,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:28" (1/1) ... [2021-12-16 04:14:29,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:28" (1/1) ... [2021-12-16 04:14:29,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:28" (1/1) ... [2021-12-16 04:14:29,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 04:14:29,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 04:14:29,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 04:14:29,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 04:14:29,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:28" (1/1) ... [2021-12-16 04:14:29,114 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 04:14:29,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 04:14:29,138 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-16 04:14:29,145 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-16 04:14:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 04:14:29,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 04:14:29,166 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-16 04:14:29,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-16 04:14:29,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 04:14:29,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-16 04:14:29,166 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-16 04:14:29,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 04:14:29,166 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2021-12-16 04:14:29,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2021-12-16 04:14:29,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 04:14:29,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-16 04:14:29,167 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-12-16 04:14:29,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-12-16 04:14:29,167 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2021-12-16 04:14:29,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2021-12-16 04:14:29,167 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-16 04:14:29,167 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-16 04:14:29,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 04:14:29,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 04:14:29,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 04:14:29,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 04:14:29,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2021-12-16 04:14:29,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2021-12-16 04:14:29,383 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 04:14:29,384 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 04:14:29,520 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-16 04:14:29,706 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 04:14:29,713 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 04:14:29,713 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-16 04:14:29,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:14:29 BoogieIcfgContainer [2021-12-16 04:14:29,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 04:14:29,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 04:14:29,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 04:14:29,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 04:14:29,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:14:28" (1/3) ... [2021-12-16 04:14:29,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676a4c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:14:29, skipping insertion in model container [2021-12-16 04:14:29,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:28" (2/3) ... [2021-12-16 04:14:29,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676a4c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:14:29, skipping insertion in model container [2021-12-16 04:14:29,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:14:29" (3/3) ... [2021-12-16 04:14:29,723 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-16 04:14:29,727 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 04:14:29,728 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 04:14:29,776 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 04:14:29,783 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-16 04:14:29,784 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 04:14:29,810 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-16 04:14:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-16 04:14:29,819 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 04:14:29,820 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-16 04:14:29,821 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 04:14:29,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 04:14:29,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1422532354, now seen corresponding path program 1 times [2021-12-16 04:14:29,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 04:14:29,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880436258] [2021-12-16 04:14:29,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:29,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 04:14:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 04:14:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 04:14:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 04:14:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 04:14:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,345 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-16 04:14:30,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 04:14:30,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880436258] [2021-12-16 04:14:30,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880436258] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 04:14:30,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 04:14:30,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 04:14:30,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311431291] [2021-12-16 04:14:30,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 04:14:30,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 04:14:30,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 04:14:30,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 04:14:30,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 04:14:30,385 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-16 04:14:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 04:14:30,544 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2021-12-16 04:14:30,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 04:14:30,546 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-16 04:14:30,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 04:14:30,557 INFO L225 Difference]: With dead ends: 181 [2021-12-16 04:14:30,557 INFO L226 Difference]: Without dead ends: 85 [2021-12-16 04:14:30,562 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-16 04:14:30,568 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-16 04:14:30,573 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-16 04:14:30,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-16 04:14:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2021-12-16 04:14:30,614 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-16 04:14:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2021-12-16 04:14:30,621 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 61 [2021-12-16 04:14:30,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 04:14:30,622 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2021-12-16 04:14:30,622 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-16 04:14:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2021-12-16 04:14:30,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-16 04:14:30,629 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 04:14:30,631 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-16 04:14:30,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 04:14:30,632 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 04:14:30,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 04:14:30,633 INFO L85 PathProgramCache]: Analyzing trace with hash 147371386, now seen corresponding path program 1 times [2021-12-16 04:14:30,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 04:14:30,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18768403] [2021-12-16 04:14:30,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:30,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 04:14:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 04:14:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 04:14:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 04:14:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 04:14:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:30,853 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-16 04:14:30,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 04:14:30,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18768403] [2021-12-16 04:14:30,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18768403] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 04:14:30,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 04:14:30,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 04:14:30,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617958938] [2021-12-16 04:14:30,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 04:14:30,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 04:14:30,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 04:14:30,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 04:14:30,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 04:14:30,856 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-16 04:14:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 04:14:30,978 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2021-12-16 04:14:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 04:14:30,979 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-16 04:14:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 04:14:30,980 INFO L225 Difference]: With dead ends: 179 [2021-12-16 04:14:30,980 INFO L226 Difference]: Without dead ends: 128 [2021-12-16 04:14:30,981 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-16 04:14:30,982 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 98 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 04:14:30,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 376 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 04:14:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-16 04:14:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2021-12-16 04:14:30,998 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-16 04:14:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 161 transitions. [2021-12-16 04:14:31,001 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 161 transitions. Word has length 61 [2021-12-16 04:14:31,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 04:14:31,001 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 161 transitions. [2021-12-16 04:14:31,002 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-16 04:14:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 161 transitions. [2021-12-16 04:14:31,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-16 04:14:31,004 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 04:14:31,005 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-16 04:14:31,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 04:14:31,006 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 04:14:31,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 04:14:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash 668155054, now seen corresponding path program 1 times [2021-12-16 04:14:31,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 04:14:31,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245728917] [2021-12-16 04:14:31,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:31,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 04:14:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 04:14:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 04:14:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 04:14:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 04:14:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,157 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-16 04:14:31,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 04:14:31,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245728917] [2021-12-16 04:14:31,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245728917] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 04:14:31,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 04:14:31,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 04:14:31,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921055644] [2021-12-16 04:14:31,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 04:14:31,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 04:14:31,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 04:14:31,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 04:14:31,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 04:14:31,159 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-16 04:14:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 04:14:31,263 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2021-12-16 04:14:31,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 04:14:31,264 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-16 04:14:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 04:14:31,266 INFO L225 Difference]: With dead ends: 135 [2021-12-16 04:14:31,266 INFO L226 Difference]: Without dead ends: 130 [2021-12-16 04:14:31,267 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-16 04:14:31,268 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.1s IncrementalHoareTripleChecker+Time [2021-12-16 04:14:31,268 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.1s Time] [2021-12-16 04:14:31,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-16 04:14:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2021-12-16 04:14:31,275 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-16 04:14:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 160 transitions. [2021-12-16 04:14:31,276 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 160 transitions. Word has length 64 [2021-12-16 04:14:31,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 04:14:31,276 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 160 transitions. [2021-12-16 04:14:31,277 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-16 04:14:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 160 transitions. [2021-12-16 04:14:31,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-16 04:14:31,277 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 04:14:31,278 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-16 04:14:31,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 04:14:31,278 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 04:14:31,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 04:14:31,278 INFO L85 PathProgramCache]: Analyzing trace with hash 725413356, now seen corresponding path program 1 times [2021-12-16 04:14:31,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 04:14:31,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801067520] [2021-12-16 04:14:31,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:31,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 04:14:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 04:14:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 04:14:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 04:14:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 04:14:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,409 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-16 04:14:31,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 04:14:31,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801067520] [2021-12-16 04:14:31,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801067520] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 04:14:31,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 04:14:31,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 04:14:31,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166234321] [2021-12-16 04:14:31,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 04:14:31,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 04:14:31,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 04:14:31,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 04:14:31,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 04:14:31,411 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-16 04:14:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 04:14:31,542 INFO L93 Difference]: Finished difference Result 304 states and 419 transitions. [2021-12-16 04:14:31,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 04:14:31,552 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-16 04:14:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 04:14:31,555 INFO L225 Difference]: With dead ends: 304 [2021-12-16 04:14:31,555 INFO L226 Difference]: Without dead ends: 209 [2021-12-16 04:14:31,558 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-16 04:14:31,559 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 115 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 04:14:31,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 362 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 04:14:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-16 04:14:31,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 201. [2021-12-16 04:14:31,577 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-16 04:14:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 273 transitions. [2021-12-16 04:14:31,578 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 273 transitions. Word has length 64 [2021-12-16 04:14:31,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 04:14:31,581 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 273 transitions. [2021-12-16 04:14:31,581 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-16 04:14:31,581 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 273 transitions. [2021-12-16 04:14:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-16 04:14:31,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 04:14:31,582 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-16 04:14:31,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 04:14:31,583 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 04:14:31,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 04:14:31,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1104607523, now seen corresponding path program 1 times [2021-12-16 04:14:31,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 04:14:31,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163961952] [2021-12-16 04:14:31,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:31,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 04:14:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 04:14:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 04:14:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 04:14:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 04:14:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,741 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-16 04:14:31,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 04:14:31,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163961952] [2021-12-16 04:14:31,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163961952] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 04:14:31,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 04:14:31,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 04:14:31,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210091037] [2021-12-16 04:14:31,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 04:14:31,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 04:14:31,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 04:14:31,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 04:14:31,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 04:14:31,743 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-16 04:14:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 04:14:31,837 INFO L93 Difference]: Finished difference Result 443 states and 613 transitions. [2021-12-16 04:14:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 04:14:31,838 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-16 04:14:31,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 04:14:31,839 INFO L225 Difference]: With dead ends: 443 [2021-12-16 04:14:31,839 INFO L226 Difference]: Without dead ends: 272 [2021-12-16 04:14:31,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-12-16 04:14:31,841 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 104 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 04:14:31,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 248 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 04:14:31,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-12-16 04:14:31,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 261. [2021-12-16 04:14:31,850 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-16 04:14:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 357 transitions. [2021-12-16 04:14:31,851 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 357 transitions. Word has length 70 [2021-12-16 04:14:31,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 04:14:31,864 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 357 transitions. [2021-12-16 04:14:31,864 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-16 04:14:31,864 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 357 transitions. [2021-12-16 04:14:31,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-16 04:14:31,865 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 04:14:31,865 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-16 04:14:31,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 04:14:31,865 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 04:14:31,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 04:14:31,866 INFO L85 PathProgramCache]: Analyzing trace with hash -49701621, now seen corresponding path program 1 times [2021-12-16 04:14:31,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 04:14:31,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233941566] [2021-12-16 04:14:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:31,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 04:14:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 04:14:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 04:14:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 04:14:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-16 04:14:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,111 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-16 04:14:32,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 04:14:32,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233941566] [2021-12-16 04:14:32,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233941566] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 04:14:32,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548247293] [2021-12-16 04:14:32,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:32,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 04:14:32,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 04:14:32,113 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-16 04:14:32,114 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-16 04:14:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 04:14:32,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 04:14:32,442 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-16 04:14:32,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 04:14:32,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548247293] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 04:14:32,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 04:14:32,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2021-12-16 04:14:32,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608480605] [2021-12-16 04:14:32,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 04:14:32,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 04:14:32,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 04:14:32,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 04:14:32,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-16 04:14:32,445 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-16 04:14:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 04:14:32,469 INFO L93 Difference]: Finished difference Result 504 states and 696 transitions. [2021-12-16 04:14:32,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 04:14:32,469 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-16 04:14:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 04:14:32,472 INFO L225 Difference]: With dead ends: 504 [2021-12-16 04:14:32,472 INFO L226 Difference]: Without dead ends: 262 [2021-12-16 04:14:32,472 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-16 04:14:32,473 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-16 04:14:32,473 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-16 04:14:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-12-16 04:14:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2021-12-16 04:14:32,480 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-16 04:14:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 358 transitions. [2021-12-16 04:14:32,481 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 358 transitions. Word has length 81 [2021-12-16 04:14:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 04:14:32,481 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 358 transitions. [2021-12-16 04:14:32,481 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-16 04:14:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 358 transitions. [2021-12-16 04:14:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-16 04:14:32,482 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 04:14:32,483 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-16 04:14:32,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-16 04:14:32,686 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-16 04:14:32,686 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 04:14:32,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 04:14:32,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1260616323, now seen corresponding path program 1 times [2021-12-16 04:14:32,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 04:14:32,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879870387] [2021-12-16 04:14:32,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:32,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 04:14:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 04:14:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 04:14:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 04:14:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 04:14:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:32,921 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-16 04:14:32,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 04:14:32,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879870387] [2021-12-16 04:14:32,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879870387] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 04:14:32,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871757910] [2021-12-16 04:14:32,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:32,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 04:14:32,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 04:14:32,923 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-16 04:14:32,924 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-16 04:14:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:33,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 04:14:33,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 04:14:33,264 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-16 04:14:33,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 04:14:33,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871757910] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 04:14:33,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 04:14:33,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2021-12-16 04:14:33,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936575670] [2021-12-16 04:14:33,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 04:14:33,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 04:14:33,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 04:14:33,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 04:14:33,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-16 04:14:33,267 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-16 04:14:33,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 04:14:33,310 INFO L93 Difference]: Finished difference Result 825 states and 1152 transitions. [2021-12-16 04:14:33,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 04:14:33,311 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-16 04:14:33,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 04:14:33,313 INFO L225 Difference]: With dead ends: 825 [2021-12-16 04:14:33,314 INFO L226 Difference]: Without dead ends: 594 [2021-12-16 04:14:33,315 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-16 04:14:33,315 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-16 04:14:33,316 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-16 04:14:33,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-12-16 04:14:33,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 268. [2021-12-16 04:14:33,329 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-16 04:14:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 362 transitions. [2021-12-16 04:14:33,330 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 362 transitions. Word has length 83 [2021-12-16 04:14:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 04:14:33,331 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 362 transitions. [2021-12-16 04:14:33,331 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-16 04:14:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 362 transitions. [2021-12-16 04:14:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-16 04:14:33,332 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 04:14:33,332 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-16 04:14:33,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-16 04:14:33,547 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-16 04:14:33,547 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 04:14:33,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 04:14:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1940674693, now seen corresponding path program 1 times [2021-12-16 04:14:33,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 04:14:33,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608128359] [2021-12-16 04:14:33,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:33,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 04:14:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:33,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 04:14:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:33,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:33,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:33,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 04:14:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:33,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:33,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:33,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 04:14:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:33,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 04:14:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:33,666 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-16 04:14:33,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 04:14:33,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608128359] [2021-12-16 04:14:33,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608128359] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 04:14:33,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165034193] [2021-12-16 04:14:33,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:33,667 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 04:14:33,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 04:14:33,669 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-16 04:14:33,670 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-16 04:14:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:33,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 04:14:33,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 04:14:33,937 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-16 04:14:33,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 04:14:33,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165034193] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 04:14:33,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 04:14:33,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-16 04:14:33,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235745810] [2021-12-16 04:14:33,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 04:14:33,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 04:14:33,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 04:14:33,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 04:14:33,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 04:14:33,939 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-16 04:14:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 04:14:33,955 INFO L93 Difference]: Finished difference Result 643 states and 888 transitions. [2021-12-16 04:14:33,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 04:14:33,956 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-16 04:14:33,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 04:14:33,959 INFO L225 Difference]: With dead ends: 643 [2021-12-16 04:14:33,959 INFO L226 Difference]: Without dead ends: 406 [2021-12-16 04:14:33,960 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-16 04:14:33,960 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-16 04:14:33,961 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-16 04:14:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-12-16 04:14:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 255. [2021-12-16 04:14:33,970 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-16 04:14:33,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 345 transitions. [2021-12-16 04:14:33,971 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 345 transitions. Word has length 83 [2021-12-16 04:14:33,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 04:14:33,972 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 345 transitions. [2021-12-16 04:14:33,972 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-16 04:14:33,972 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 345 transitions. [2021-12-16 04:14:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-16 04:14:33,973 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 04:14:33,973 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-16 04:14:33,993 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-16 04:14:34,195 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-16 04:14:34,196 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 04:14:34,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 04:14:34,196 INFO L85 PathProgramCache]: Analyzing trace with hash 587922057, now seen corresponding path program 1 times [2021-12-16 04:14:34,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 04:14:34,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120792784] [2021-12-16 04:14:34,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:34,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 04:14:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 04:14:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 04:14:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 04:14:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 04:14:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,334 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-16 04:14:34,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 04:14:34,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120792784] [2021-12-16 04:14:34,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120792784] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 04:14:34,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 04:14:34,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 04:14:34,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643437734] [2021-12-16 04:14:34,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 04:14:34,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 04:14:34,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 04:14:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 04:14:34,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 04:14:34,336 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-16 04:14:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 04:14:34,492 INFO L93 Difference]: Finished difference Result 384 states and 524 transitions. [2021-12-16 04:14:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 04:14:34,492 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-16 04:14:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 04:14:34,494 INFO L225 Difference]: With dead ends: 384 [2021-12-16 04:14:34,494 INFO L226 Difference]: Without dead ends: 381 [2021-12-16 04:14:34,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-16 04:14:34,495 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 137 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 04:14:34,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 622 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 04:14:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-12-16 04:14:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 374. [2021-12-16 04:14:34,506 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-16 04:14:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 514 transitions. [2021-12-16 04:14:34,508 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 514 transitions. Word has length 85 [2021-12-16 04:14:34,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 04:14:34,509 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 514 transitions. [2021-12-16 04:14:34,509 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-16 04:14:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 514 transitions. [2021-12-16 04:14:34,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-16 04:14:34,510 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 04:14:34,511 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-16 04:14:34,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 04:14:34,511 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 04:14:34,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 04:14:34,512 INFO L85 PathProgramCache]: Analyzing trace with hash 138660115, now seen corresponding path program 1 times [2021-12-16 04:14:34,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 04:14:34,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61609625] [2021-12-16 04:14:34,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:34,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 04:14:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 04:14:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 04:14:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 04:14:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 04:14:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,624 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-16 04:14:34,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 04:14:34,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61609625] [2021-12-16 04:14:34,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61609625] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 04:14:34,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 04:14:34,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 04:14:34,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046178477] [2021-12-16 04:14:34,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 04:14:34,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 04:14:34,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 04:14:34,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 04:14:34,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 04:14:34,627 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-16 04:14:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 04:14:34,708 INFO L93 Difference]: Finished difference Result 773 states and 1076 transitions. [2021-12-16 04:14:34,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 04:14:34,708 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-16 04:14:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 04:14:34,711 INFO L225 Difference]: With dead ends: 773 [2021-12-16 04:14:34,711 INFO L226 Difference]: Without dead ends: 525 [2021-12-16 04:14:34,712 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-16 04:14:34,712 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 65 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 04:14:34,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 545 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 04:14:34,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-12-16 04:14:34,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 374. [2021-12-16 04:14:34,726 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-16 04:14:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 510 transitions. [2021-12-16 04:14:34,728 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 510 transitions. Word has length 92 [2021-12-16 04:14:34,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 04:14:34,729 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 510 transitions. [2021-12-16 04:14:34,729 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-16 04:14:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 510 transitions. [2021-12-16 04:14:34,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-16 04:14:34,730 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 04:14:34,730 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-16 04:14:34,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 04:14:34,731 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 04:14:34,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 04:14:34,731 INFO L85 PathProgramCache]: Analyzing trace with hash -882408239, now seen corresponding path program 1 times [2021-12-16 04:14:34,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 04:14:34,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77175111] [2021-12-16 04:14:34,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:34,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 04:14:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 04:14:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 04:14:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 04:14:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 04:14:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:34,887 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-16 04:14:34,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 04:14:34,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77175111] [2021-12-16 04:14:34,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77175111] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 04:14:34,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259345098] [2021-12-16 04:14:34,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:34,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 04:14:34,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 04:14:34,889 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-16 04:14:34,890 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-16 04:14:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:35,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-16 04:14:35,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 04:14:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-16 04:14:35,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 04:14:35,423 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-16 04:14:35,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259345098] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-16 04:14:35,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-16 04:14:35,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 6] total 14 [2021-12-16 04:14:35,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660935609] [2021-12-16 04:14:35,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 04:14:35,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 04:14:35,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 04:14:35,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 04:14:35,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-12-16 04:14:35,425 INFO L87 Difference]: Start difference. First operand 374 states and 510 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 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-16 04:14:35,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 04:14:35,477 INFO L93 Difference]: Finished difference Result 940 states and 1311 transitions. [2021-12-16 04:14:35,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 04:14:35,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 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-16 04:14:35,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 04:14:35,480 INFO L225 Difference]: With dead ends: 940 [2021-12-16 04:14:35,480 INFO L226 Difference]: Without dead ends: 692 [2021-12-16 04:14:35,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-12-16 04:14:35,482 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 221 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 04:14:35,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 468 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 04:14:35,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-12-16 04:14:35,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 374. [2021-12-16 04:14:35,495 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-16 04:14:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 506 transitions. [2021-12-16 04:14:35,497 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 506 transitions. Word has length 92 [2021-12-16 04:14:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 04:14:35,497 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 506 transitions. [2021-12-16 04:14:35,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 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-16 04:14:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 506 transitions. [2021-12-16 04:14:35,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-16 04:14:35,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 04:14:35,501 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-16 04:14:35,523 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-16 04:14:35,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 04:14:35,715 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 04:14:35,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 04:14:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2027716343, now seen corresponding path program 1 times [2021-12-16 04:14:35,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 04:14:35,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745952524] [2021-12-16 04:14:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:35,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 04:14:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:35,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 04:14:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:35,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:35,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:35,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 04:14:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:35,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:35,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:35,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 04:14:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:35,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 04:14:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:35,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 04:14:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:35,880 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-16 04:14:35,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 04:14:35,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745952524] [2021-12-16 04:14:35,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745952524] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 04:14:35,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949202114] [2021-12-16 04:14:35,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:35,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 04:14:35,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 04:14:35,882 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-16 04:14:35,883 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-16 04:14:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:36,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 04:14:36,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 04:14:36,251 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-16 04:14:36,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 04:14:36,450 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-16 04:14:36,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949202114] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 04:14:36,451 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 04:14:36,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2021-12-16 04:14:36,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570401453] [2021-12-16 04:14:36,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 04:14:36,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 04:14:36,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 04:14:36,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 04:14:36,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-12-16 04:14:36,452 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-16 04:14:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 04:14:36,772 INFO L93 Difference]: Finished difference Result 739 states and 1006 transitions. [2021-12-16 04:14:36,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 04:14:36,773 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-16 04:14:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 04:14:36,774 INFO L225 Difference]: With dead ends: 739 [2021-12-16 04:14:36,774 INFO L226 Difference]: Without dead ends: 381 [2021-12-16 04:14:36,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2021-12-16 04:14:36,776 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 64 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 04:14:36,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 576 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 04:14:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-12-16 04:14:36,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2021-12-16 04:14:36,787 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-16 04:14:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 513 transitions. [2021-12-16 04:14:36,788 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 513 transitions. Word has length 99 [2021-12-16 04:14:36,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 04:14:36,789 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 513 transitions. [2021-12-16 04:14:36,789 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-16 04:14:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 513 transitions. [2021-12-16 04:14:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-16 04:14:36,790 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 04:14:36,790 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-16 04:14:36,808 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-16 04:14:36,999 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,SelfDestructingSolverStorable11 [2021-12-16 04:14:37,000 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 04:14:37,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 04:14:37,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1894269569, now seen corresponding path program 2 times [2021-12-16 04:14:37,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 04:14:37,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876164431] [2021-12-16 04:14:37,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:37,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 04:14:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 04:14:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 04:14:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 04:14:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 04:14:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 04:14:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,168 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-16 04:14:37,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 04:14:37,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876164431] [2021-12-16 04:14:37,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876164431] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 04:14:37,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 04:14:37,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 04:14:37,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536528125] [2021-12-16 04:14:37,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 04:14:37,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 04:14:37,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 04:14:37,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 04:14:37,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-16 04:14:37,170 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-16 04:14:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 04:14:37,361 INFO L93 Difference]: Finished difference Result 964 states and 1323 transitions. [2021-12-16 04:14:37,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 04:14:37,361 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-16 04:14:37,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 04:14:37,364 INFO L225 Difference]: With dead ends: 964 [2021-12-16 04:14:37,364 INFO L226 Difference]: Without dead ends: 617 [2021-12-16 04:14:37,365 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-16 04:14:37,366 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 82 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 04:14:37,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 716 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 04:14:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-12-16 04:14:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 393. [2021-12-16 04:14:37,382 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-16 04:14:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 525 transitions. [2021-12-16 04:14:37,383 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 525 transitions. Word has length 105 [2021-12-16 04:14:37,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 04:14:37,384 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 525 transitions. [2021-12-16 04:14:37,384 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-16 04:14:37,384 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 525 transitions. [2021-12-16 04:14:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-16 04:14:37,385 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 04:14:37,385 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-16 04:14:37,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 04:14:37,385 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 04:14:37,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 04:14:37,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1192669695, now seen corresponding path program 1 times [2021-12-16 04:14:37,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 04:14:37,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525403722] [2021-12-16 04:14:37,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:37,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 04:14:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 04:14:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 04:14:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:37,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 04:14:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:38,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 04:14:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:38,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 04:14:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-16 04:14:38,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 04:14:38,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525403722] [2021-12-16 04:14:38,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525403722] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 04:14:38,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232895451] [2021-12-16 04:14:38,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:38,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 04:14:38,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 04:14:38,403 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-16 04:14:38,405 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-16 04:14:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:38,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-16 04:14:38,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 04:14:38,960 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 04:14:38,961 INFO L388 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-16 04:14:38,975 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 04:14:38,976 INFO L388 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-16 04:14:39,092 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-16 04:14:39,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 04:14:39,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232895451] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 04:14:39,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 04:14:39,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [21] total 26 [2021-12-16 04:14:39,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177111830] [2021-12-16 04:14:39,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 04:14:39,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 04:14:39,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 04:14:39,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 04:14:39,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2021-12-16 04:14:39,095 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-16 04:14:39,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 04:14:39,264 INFO L93 Difference]: Finished difference Result 870 states and 1171 transitions. [2021-12-16 04:14:39,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 04:14:39,265 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-16 04:14:39,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 04:14:39,267 INFO L225 Difference]: With dead ends: 870 [2021-12-16 04:14:39,267 INFO L226 Difference]: Without dead ends: 602 [2021-12-16 04:14:39,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2021-12-16 04:14:39,269 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 204 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-16 04:14:39,269 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-16 04:14:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2021-12-16 04:14:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 284. [2021-12-16 04:14:39,281 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-16 04:14:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 370 transitions. [2021-12-16 04:14:39,282 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 370 transitions. Word has length 105 [2021-12-16 04:14:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 04:14:39,282 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 370 transitions. [2021-12-16 04:14:39,282 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-16 04:14:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 370 transitions. [2021-12-16 04:14:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-16 04:14:39,283 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 04:14:39,284 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-16 04:14:39,305 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-16 04:14:39,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 04:14:39,499 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 04:14:39,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 04:14:39,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1062893161, now seen corresponding path program 1 times [2021-12-16 04:14:39,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 04:14:39,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054840004] [2021-12-16 04:14:39,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:39,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 04:14:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 04:14:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 04:14:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 04:14:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 04:14:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 04:14:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,672 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-16 04:14:39,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 04:14:39,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054840004] [2021-12-16 04:14:39,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054840004] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 04:14:39,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 04:14:39,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 04:14:39,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002893857] [2021-12-16 04:14:39,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 04:14:39,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 04:14:39,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 04:14:39,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 04:14:39,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-16 04:14:39,674 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-16 04:14:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 04:14:39,820 INFO L93 Difference]: Finished difference Result 286 states and 371 transitions. [2021-12-16 04:14:39,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 04:14:39,821 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-16 04:14:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 04:14:39,822 INFO L225 Difference]: With dead ends: 286 [2021-12-16 04:14:39,822 INFO L226 Difference]: Without dead ends: 279 [2021-12-16 04:14:39,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-12-16 04:14:39,823 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 236 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 04:14:39,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 281 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 04:14:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-16 04:14:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2021-12-16 04:14:39,834 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-16 04:14:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 361 transitions. [2021-12-16 04:14:39,835 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 361 transitions. Word has length 107 [2021-12-16 04:14:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 04:14:39,836 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 361 transitions. [2021-12-16 04:14:39,836 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-16 04:14:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 361 transitions. [2021-12-16 04:14:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-16 04:14:39,837 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 04:14:39,837 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-16 04:14:39,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 04:14:39,838 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 04:14:39,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 04:14:39,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1411237866, now seen corresponding path program 1 times [2021-12-16 04:14:39,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 04:14:39,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264948362] [2021-12-16 04:14:39,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:39,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 04:14:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 04:14:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-16 04:14:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 04:14:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 04:14:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 04:14:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-16 04:14:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 04:14:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:39,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-16 04:14:39,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 04:14:39,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264948362] [2021-12-16 04:14:39,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264948362] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 04:14:39,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132350048] [2021-12-16 04:14:39,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 04:14:39,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 04:14:39,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 04:14:39,991 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 04:14:39,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-16 04:14:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 04:14:40,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 04:14:40,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 04:14:40,369 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-16 04:14:40,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 04:14:40,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132350048] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 04:14:40,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 04:14:40,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2021-12-16 04:14:40,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104045120] [2021-12-16 04:14:40,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 04:14:40,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 04:14:40,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 04:14:40,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 04:14:40,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 04:14:40,371 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-16 04:14:40,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 04:14:40,402 INFO L93 Difference]: Finished difference Result 279 states and 361 transitions. [2021-12-16 04:14:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 04:14:40,402 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-16 04:14:40,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 04:14:40,403 INFO L225 Difference]: With dead ends: 279 [2021-12-16 04:14:40,403 INFO L226 Difference]: Without dead ends: 0 [2021-12-16 04:14:40,403 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-16 04:14:40,404 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-16 04:14:40,404 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-16 04:14:40,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-16 04:14:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-16 04:14:40,405 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-16 04:14:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-16 04:14:40,406 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2021-12-16 04:14:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 04:14:40,406 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 04:14:40,406 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-16 04:14:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-16 04:14:40,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-16 04:14:40,408 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 04:14:40,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-16 04:14:40,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 04:14:40,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-16 04:14:42,544 INFO L858 garLoopResultBuilder]: For program point ldv_init_zallocFINAL(lines 5894 5904) no Hoare annotation was computed. [2021-12-16 04:14:42,544 INFO L854 garLoopResultBuilder]: At program point L5899(line 5899) the Hoare annotation is: (or (= |#memory_int| |old(#memory_int)|) (not (= ~ldv_state_variable_1~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= ~ldv_module_refcounter~0 1))) [2021-12-16 04:14:42,544 INFO L858 garLoopResultBuilder]: For program point L5899-1(line 5899) no Hoare annotation was computed. [2021-12-16 04:14:42,544 INFO L861 garLoopResultBuilder]: At program point L5901(line 5901) the Hoare annotation is: true [2021-12-16 04:14:42,545 INFO L858 garLoopResultBuilder]: For program point ldv_init_zallocEXIT(lines 5894 5904) no Hoare annotation was computed. [2021-12-16 04:14:42,545 INFO L858 garLoopResultBuilder]: For program point L5901-1(line 5901) no Hoare annotation was computed. [2021-12-16 04:14:42,545 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_retval_0~0 0)) (not (= ~ldv_module_refcounter~0 1)) (and (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))) [2021-12-16 04:14:42,545 INFO L858 garLoopResultBuilder]: For program point L5858-2(lines 5857 5859) no Hoare annotation was computed. [2021-12-16 04:14:42,545 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5857 5859) the Hoare annotation is: true [2021-12-16 04:14:42,545 INFO L858 garLoopResultBuilder]: For program point L5858(line 5858) no Hoare annotation was computed. [2021-12-16 04:14:42,545 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5857 5859) no Hoare annotation was computed. [2021-12-16 04:14:42,545 INFO L858 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 6260 6266) no Hoare annotation was computed. [2021-12-16 04:14:42,545 INFO L861 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 6260 6266) the Hoare annotation is: true [2021-12-16 04:14:42,545 INFO L858 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6264) no Hoare annotation was computed. [2021-12-16 04:14:42,545 INFO L858 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 6260 6266) no Hoare annotation was computed. [2021-12-16 04:14:42,546 INFO L858 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5929 5935) no Hoare annotation was computed. [2021-12-16 04:14:42,546 INFO L861 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5929 5935) the Hoare annotation is: true [2021-12-16 04:14:42,546 INFO L858 garLoopResultBuilder]: For program point L6113-2(lines 6113 6116) no Hoare annotation was computed. [2021-12-16 04:14:42,546 INFO L858 garLoopResultBuilder]: For program point L6113(lines 6113 6116) no Hoare annotation was computed. [2021-12-16 04:14:42,546 INFO L854 garLoopResultBuilder]: At program point L6394(lines 6393 6395) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0) (= ~ldv_state_variable_0~0 1)) [2021-12-16 04:14:42,546 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-16 04:14:42,546 INFO L858 garLoopResultBuilder]: For program point L6204(lines 6204 6209) no Hoare annotation was computed. [2021-12-16 04:14:42,546 INFO L854 garLoopResultBuilder]: At program point L6328(lines 6314 6330) the Hoare annotation is: (let ((.cse7 (+ |~#pppox_protos~0.offset| (* |ULTIMATE.start_pppox_create_~protocol#1| 8)))) (let ((.cse5 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse7)) (.cse6 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse7) 16))) (let ((.cse3 (select (select |#memory_$Pointer$.offset| .cse5) .cse6)) (.cse4 (select (select |#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse0 (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse4)) (.cse1 (= ~ldv_retval_0~0 0)) (.cse2 (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse3))) (or (and (= |ULTIMATE.start_ldv_try_module_get_#res#1| 0) .cse0 (= ~ldv_module_refcounter~0 1) .cse1 .cse2) (and (<= 2 ~ldv_module_refcounter~0) (not (= 0 |ULTIMATE.start_ldv_try_module_get_#res#1|)) .cse0 .cse1 (not (= 0 (mod (+ .cse3 .cse4) 18446744073709551616))) .cse2 (<= ~ldv_module_refcounter~0 2))))))) [2021-12-16 04:14:42,547 INFO L858 garLoopResultBuilder]: For program point L6320(lines 6320 6325) no Hoare annotation was computed. [2021-12-16 04:14:42,547 INFO L854 garLoopResultBuilder]: At program point L6221(lines 6167 6242) the Hoare annotation is: (= ~ldv_module_refcounter~0 1) [2021-12-16 04:14:42,547 INFO L858 garLoopResultBuilder]: For program point L6180(lines 6180 6236) no Hoare annotation was computed. [2021-12-16 04:14:42,547 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-16 04:14:42,547 INFO L858 garLoopResultBuilder]: For program point L6362(lines 6362 6365) no Hoare annotation was computed. [2021-12-16 04:14:42,547 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-16 04:14:42,548 INFO L861 garLoopResultBuilder]: At program point L6362-1(lines 6359 6368) the Hoare annotation is: true [2021-12-16 04:14:42,548 INFO L854 garLoopResultBuilder]: At program point L6255(line 6255) the Hoare annotation is: (let ((.cse4 (+ |~#pppox_protos~0.offset| (* |ULTIMATE.start_pppox_create_~protocol#1| 8)))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4) 16))) (let ((.cse0 (select (select |#memory_$Pointer$.base| .cse2) .cse3)) (.cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3))) (and (not (= 0 (mod (+ |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.offset| |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.base|) 18446744073709551616))) (= |ULTIMATE.start_pppox_create_~tmp___0~3#1| 0) (<= 2 ~ldv_module_refcounter~0) (not (= 0 |ULTIMATE.start_ldv_try_module_get_#res#1|)) (< 0 (mod |ULTIMATE.start_pppox_create_~tmp~8#1| 256)) (< 0 (mod |ULTIMATE.start_ldv_try_module_get_5_#res#1| 256)) (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0) (= ~ldv_retval_0~0 0) (not (= 0 (mod (+ .cse1 .cse0) 18446744073709551616))) (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1) (<= ~ldv_module_refcounter~0 2))))) [2021-12-16 04:14:42,548 INFO L854 garLoopResultBuilder]: At program point L6255-1(lines 6252 6258) the Hoare annotation is: (let ((.cse4 (+ |~#pppox_protos~0.offset| (* |ULTIMATE.start_pppox_create_~protocol#1| 8)))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4) 16))) (let ((.cse0 (select (select |#memory_$Pointer$.base| .cse2) .cse3)) (.cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3))) (and (not (= 0 (mod (+ |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.offset| |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.base|) 18446744073709551616))) (= |ULTIMATE.start_pppox_create_~tmp___0~3#1| 0) (not (= 0 |ULTIMATE.start_ldv_try_module_get_#res#1|)) (< 0 (mod |ULTIMATE.start_pppox_create_~tmp~8#1| 256)) (< 0 (mod |ULTIMATE.start_ldv_try_module_get_5_#res#1| 256)) (= ~ldv_module_refcounter~0 1) (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0) (= ~ldv_retval_0~0 0) (not (= 0 (mod (+ .cse1 .cse0) 18446744073709551616))) (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1))))) [2021-12-16 04:14:42,548 INFO L858 garLoopResultBuilder]: For program point L6214(lines 6214 6218) no Hoare annotation was computed. [2021-12-16 04:14:42,548 INFO L858 garLoopResultBuilder]: For program point L6181(line 6181) no Hoare annotation was computed. [2021-12-16 04:14:42,548 INFO L858 garLoopResultBuilder]: For program point L6214-2(lines 6212 6224) no Hoare annotation was computed. [2021-12-16 04:14:42,549 INFO L854 garLoopResultBuilder]: At program point L6363(line 6363) the Hoare annotation is: false [2021-12-16 04:14:42,549 INFO L854 garLoopResultBuilder]: At program point L6173(line 6173) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-12-16 04:14:42,549 INFO L858 garLoopResultBuilder]: For program point L6173-1(line 6173) no Hoare annotation was computed. [2021-12-16 04:14:42,549 INFO L858 garLoopResultBuilder]: For program point L6182(lines 6182 6197) no Hoare annotation was computed. [2021-12-16 04:14:42,549 INFO L854 garLoopResultBuilder]: At program point L6174(line 6174) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-12-16 04:14:42,549 INFO L854 garLoopResultBuilder]: At program point L5918(lines 5913 5920) the Hoare annotation is: (let ((.cse4 (+ |~#pppox_protos~0.offset| (* |ULTIMATE.start_pppox_create_~protocol#1| 8)))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4) 16))) (let ((.cse0 (select (select |#memory_$Pointer$.base| .cse2) .cse3)) (.cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3))) (and (= ~ldv_module_refcounter~0 1) (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0) (= ~ldv_retval_0~0 0) (not (= 0 (mod (+ .cse1 .cse0) 18446744073709551616))) (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1))))) [2021-12-16 04:14:42,549 INFO L858 garLoopResultBuilder]: For program point L6174-1(line 6174) no Hoare annotation was computed. [2021-12-16 04:14:42,550 INFO L858 garLoopResultBuilder]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2021-12-16 04:14:42,550 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-16 04:14:42,550 INFO L858 garLoopResultBuilder]: For program point L6199(line 6199) no Hoare annotation was computed. [2021-12-16 04:14:42,550 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-16 04:14:42,550 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-16 04:14:42,550 INFO L854 garLoopResultBuilder]: At program point L6249(lines 6244 6251) the Hoare annotation is: (let ((.cse7 (+ |~#pppox_protos~0.offset| (* |ULTIMATE.start_pppox_create_~protocol#1| 8)))) (let ((.cse5 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse7)) (.cse6 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse7) 16))) (let ((.cse2 (select (select |#memory_$Pointer$.offset| .cse5) .cse6)) (.cse3 (select (select |#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse0 (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse3)) (.cse1 (= ~ldv_retval_0~0 0)) (.cse4 (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse2))) (or (and (<= 2 ~ldv_module_refcounter~0) (not (= 0 |ULTIMATE.start_ldv_try_module_get_#res#1|)) (< 0 (mod |ULTIMATE.start_ldv_try_module_get_5_#res#1| 256)) .cse0 .cse1 (not (= 0 (mod (+ .cse2 .cse3) 18446744073709551616))) .cse4 (<= ~ldv_module_refcounter~0 2)) (and (= |ULTIMATE.start_ldv_try_module_get_#res#1| 0) (= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 0) .cse0 (= ~ldv_module_refcounter~0 1) .cse1 .cse4)))))) [2021-12-16 04:14:42,551 INFO L858 garLoopResultBuilder]: For program point L6117(lines 6117 6130) no Hoare annotation was computed. [2021-12-16 04:14:42,551 INFO L861 garLoopResultBuilder]: At program point L6241(lines 6156 6243) the Hoare annotation is: true [2021-12-16 04:14:42,551 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-16 04:14:42,551 INFO L858 garLoopResultBuilder]: For program point L6200(lines 6200 6232) no Hoare annotation was computed. [2021-12-16 04:14:42,551 INFO L858 garLoopResultBuilder]: For program point L6192(line 6192) no Hoare annotation was computed. [2021-12-16 04:14:42,551 INFO L858 garLoopResultBuilder]: For program point L6184(lines 6184 6194) no Hoare annotation was computed. [2021-12-16 04:14:42,551 INFO L854 garLoopResultBuilder]: At program point L6143(lines 6138 6145) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0) (= ~ldv_state_variable_0~0 1)) [2021-12-16 04:14:42,552 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-16 04:14:42,552 INFO L858 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-12-16 04:14:42,552 INFO L858 garLoopResultBuilder]: For program point L6234(line 6234) no Hoare annotation was computed. [2021-12-16 04:14:42,552 INFO L858 garLoopResultBuilder]: For program point L6168-1(line 6168) no Hoare annotation was computed. [2021-12-16 04:14:42,552 INFO L854 garLoopResultBuilder]: At program point L6168(line 6168) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-12-16 04:14:42,552 INFO L861 garLoopResultBuilder]: At program point L6193(line 6193) the Hoare annotation is: true [2021-12-16 04:14:42,552 INFO L858 garLoopResultBuilder]: For program point L6185(line 6185) no Hoare annotation was computed. [2021-12-16 04:14:42,553 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-16 04:14:42,553 INFO L861 garLoopResultBuilder]: At program point L6235(line 6235) the Hoare annotation is: true [2021-12-16 04:14:42,553 INFO L858 garLoopResultBuilder]: For program point L6202(lines 6202 6229) no Hoare annotation was computed. [2021-12-16 04:14:42,553 INFO L858 garLoopResultBuilder]: For program point L6227(line 6227) no Hoare annotation was computed. [2021-12-16 04:14:42,553 INFO L858 garLoopResultBuilder]: For program point L6318(lines 6318 6327) no Hoare annotation was computed. [2021-12-16 04:14:42,553 INFO L858 garLoopResultBuilder]: For program point L6186(lines 6186 6190) no Hoare annotation was computed. [2021-12-16 04:14:42,553 INFO L858 garLoopResultBuilder]: For program point L6211(line 6211) no Hoare annotation was computed. [2021-12-16 04:14:42,553 INFO L858 garLoopResultBuilder]: For program point L6203(line 6203) no Hoare annotation was computed. [2021-12-16 04:14:42,554 INFO L854 garLoopResultBuilder]: At program point L6170(line 6170) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-12-16 04:14:42,554 INFO L858 garLoopResultBuilder]: For program point L6170-1(line 6170) no Hoare annotation was computed. [2021-12-16 04:14:42,554 INFO L861 garLoopResultBuilder]: At program point L6228(line 6228) the Hoare annotation is: true [2021-12-16 04:14:42,554 INFO L858 garLoopResultBuilder]: For program point L6121-2(lines 6119 6130) no Hoare annotation was computed. [2021-12-16 04:14:42,554 INFO L858 garLoopResultBuilder]: For program point L6121(lines 6121 6125) no Hoare annotation was computed. [2021-12-16 04:14:42,554 INFO L854 garLoopResultBuilder]: At program point L6377(lines 6376 6378) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2021-12-16 04:14:42,554 INFO L858 garLoopResultBuilder]: For program point L6212(lines 6212 6225) no Hoare annotation was computed. [2021-12-16 04:14:42,555 INFO L858 garLoopResultBuilder]: For program point L6334(lines 6334 6341) no Hoare annotation was computed. [2021-12-16 04:14:42,555 INFO L858 garLoopResultBuilder]: For program point L6335-1(lines 6335 6338) no Hoare annotation was computed. [2021-12-16 04:14:42,555 INFO L858 garLoopResultBuilder]: For program point L6335(lines 6335 6338) no Hoare annotation was computed. [2021-12-16 04:14:42,555 INFO L854 garLoopResultBuilder]: At program point L6336(line 6336) the Hoare annotation is: (or (not (<= 2 |old(~ldv_module_refcounter~0)|)) (not (= ~ldv_retval_0~0 0)) (not (<= |old(~ldv_module_refcounter~0)| 2))) [2021-12-16 04:14:42,555 INFO L858 garLoopResultBuilder]: For program point L6334-2(lines 6331 6344) no Hoare annotation was computed. [2021-12-16 04:14:42,555 INFO L854 garLoopResultBuilder]: At program point ldv_module_putENTRY(lines 6331 6344) the Hoare annotation is: (or (not (<= 2 |old(~ldv_module_refcounter~0)|)) (= ~ldv_module_refcounter~0 |old(~ldv_module_refcounter~0)|) (not (= ~ldv_retval_0~0 0)) (not (<= |old(~ldv_module_refcounter~0)| 2))) [2021-12-16 04:14:42,555 INFO L858 garLoopResultBuilder]: For program point ldv_module_putEXIT(lines 6331 6344) no Hoare annotation was computed. [2021-12-16 04:14:42,556 INFO L858 garLoopResultBuilder]: For program point ldv_memsetFINAL(lines 5905 5912) no Hoare annotation was computed. [2021-12-16 04:14:42,556 INFO L861 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-12-16 04:14:42,556 INFO L858 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-12-16 04:14:42,556 INFO L854 garLoopResultBuilder]: At program point ldv_memsetENTRY(lines 5905 5912) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~ldv_retval_0~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))) [2021-12-16 04:14:42,556 INFO L858 garLoopResultBuilder]: For program point ldv_memsetEXIT(lines 5905 5912) no Hoare annotation was computed. [2021-12-16 04:14:42,556 INFO L854 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (or (= |#memory_int| |old(#memory_int)|) (not (= ~ldv_state_variable_1~0 0)) (not (= ~ldv_retval_0~0 0)) (not (= ~ldv_module_refcounter~0 1))) [2021-12-16 04:14:42,556 INFO L858 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2021-12-16 04:14:42,556 INFO L858 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2021-12-16 04:14:42,560 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 04:14:42,561 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 04:14:42,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,571 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,571 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,571 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,576 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,589 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,589 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,589 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,589 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,589 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,590 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,590 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,591 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,591 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,591 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,591 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,591 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,591 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,596 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,596 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,596 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,596 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,596 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:14:42 BoogieIcfgContainer [2021-12-16 04:14:42,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 04:14:42,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 04:14:42,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 04:14:42,602 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 04:14:42,602 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:14:29" (3/4) ... [2021-12-16 04:14:42,614 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-16 04:14:42,619 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2021-12-16 04:14:42,619 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2021-12-16 04:14:42,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2021-12-16 04:14:42,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2021-12-16 04:14:42,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-16 04:14:42,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2021-12-16 04:14:42,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2021-12-16 04:14:42,627 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2021-12-16 04:14:42,627 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-12-16 04:14:42,628 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-16 04:14:42,628 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-16 04:14:42,666 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == (ldv_func_arg1 + ldv_func_arg1) % 18446744073709551616) && tmp___0 == 0) && !(0 == \result)) && 0 < tmp % 256) && 0 < \result % 256) && ldv_module_refcounter == 1) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && ldv_retval_0 == 0) && !(0 == (#memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) % 18446744073709551616)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16] [2021-12-16 04:14:42,667 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 0 && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && ldv_module_refcounter == 1) && ldv_retval_0 == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) || ((((((2 <= ldv_module_refcounter && !(0 == \result)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && ldv_retval_0 == 0) && !(0 == (#memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) % 18446744073709551616)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && ldv_module_refcounter <= 2) [2021-12-16 04:14:42,668 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((2 <= ldv_module_refcounter && !(0 == \result)) && 0 < \result % 256) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && ldv_retval_0 == 0) && !(0 == (#memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) % 18446744073709551616)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && ldv_module_refcounter <= 2) || (((((\result == 0 && \result == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && ldv_module_refcounter == 1) && ldv_retval_0 == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) [2021-12-16 04:14:42,707 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 04:14:42,707 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 04:14:42,708 INFO L158 Benchmark]: Toolchain (without parser) took 14697.83ms. Allocated memory was 104.9MB in the beginning and 323.0MB in the end (delta: 218.1MB). Free memory was 59.1MB in the beginning and 222.3MB in the end (delta: -163.2MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2021-12-16 04:14:42,708 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory was 84.3MB in the beginning and 84.2MB in the end (delta: 76.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 04:14:42,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 921.29ms. Allocated memory was 104.9MB in the beginning and 155.2MB in the end (delta: 50.3MB). Free memory was 58.9MB in the beginning and 81.1MB in the end (delta: -22.2MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2021-12-16 04:14:42,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.71ms. Allocated memory is still 155.2MB. Free memory was 81.1MB in the beginning and 77.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 04:14:42,709 INFO L158 Benchmark]: Boogie Preprocessor took 93.47ms. Allocated memory is still 155.2MB. Free memory was 77.8MB in the beginning and 107.9MB in the end (delta: -30.0MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2021-12-16 04:14:42,709 INFO L158 Benchmark]: RCFGBuilder took 608.25ms. Allocated memory is still 155.2MB. Free memory was 107.9MB in the beginning and 92.6MB in the end (delta: 15.3MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2021-12-16 04:14:42,709 INFO L158 Benchmark]: TraceAbstraction took 12883.97ms. Allocated memory was 155.2MB in the beginning and 323.0MB in the end (delta: 167.8MB). Free memory was 92.0MB in the beginning and 235.0MB in the end (delta: -143.0MB). Peak memory consumption was 177.3MB. Max. memory is 16.1GB. [2021-12-16 04:14:42,710 INFO L158 Benchmark]: Witness Printer took 105.49ms. Allocated memory is still 323.0MB. Free memory was 235.0MB in the beginning and 222.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-16 04:14:42,717 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.16ms. Allocated memory is still 104.9MB. Free memory was 84.3MB in the beginning and 84.2MB in the end (delta: 76.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 921.29ms. Allocated memory was 104.9MB in the beginning and 155.2MB in the end (delta: 50.3MB). Free memory was 58.9MB in the beginning and 81.1MB in the end (delta: -22.2MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.71ms. Allocated memory is still 155.2MB. Free memory was 81.1MB in the beginning and 77.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.47ms. Allocated memory is still 155.2MB. Free memory was 77.8MB in the beginning and 107.9MB in the end (delta: -30.0MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * RCFGBuilder took 608.25ms. Allocated memory is still 155.2MB. Free memory was 107.9MB in the beginning and 92.6MB in the end (delta: 15.3MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12883.97ms. Allocated memory was 155.2MB in the beginning and 323.0MB in the end (delta: 167.8MB). Free memory was 92.0MB in the beginning and 235.0MB in the end (delta: -143.0MB). Peak memory consumption was 177.3MB. Max. memory is 16.1GB. * Witness Printer took 105.49ms. Allocated memory is still 323.0MB. Free memory was 235.0MB in the beginning and 222.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. 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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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 * 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.8s, OverallIterations: 16, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1836 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1823 mSDsluCounter, 7026 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5054 mSDsCounter, 344 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 995 IncrementalHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 344 mSolverCounterUnsat, 1972 mSDtfsCounter, 995 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1259 GetRequests, 1089 SyntacticMatches, 5 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=13, InterpolantAutomatonStates: 103, 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, 244 NumberOfFragments, 968 HoareAnnotationTreeSize, 171 FomulaSimplifications, 24468 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 35 FomulaSimplificationsInter, 47586 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 2031 NumberOfCodeBlocks, 2031 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2197 ConstructedInterpolants, 0 QuantifiedInterpolants, 5403 SizeOfPredicates, 47 NumberOfNonLiveVariables, 6100 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 910/962 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-16 04:14:42,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,741 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((2 <= ldv_module_refcounter && !(0 == \result)) && 0 < \result % 256) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && ldv_retval_0 == 0) && !(0 == (#memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) % 18446744073709551616)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && ldv_module_refcounter <= 2) || (((((\result == 0 && \result == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && ldv_module_refcounter == 1) && ldv_retval_0 == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) - 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_retval_0 == 0) && ldv_state_variable_0 == 1 - InvariantResult [Line: 6314]: Loop Invariant [2021-12-16 04:14:42,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,748 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((\result == 0 && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && ldv_module_refcounter == 1) && ldv_retval_0 == 0) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) || ((((((2 <= ldv_module_refcounter && !(0 == \result)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && ldv_retval_0 == 0) && !(0 == (#memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) % 18446744073709551616)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && ldv_module_refcounter <= 2) - InvariantResult [Line: 6252]: Loop Invariant [2021-12-16 04:14:42,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((!(0 == (ldv_func_arg1 + ldv_func_arg1) % 18446744073709551616) && tmp___0 == 0) && !(0 == \result)) && 0 < tmp % 256) && 0 < \result % 256) && ldv_module_refcounter == 1) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && ldv_retval_0 == 0) && !(0 == (#memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) % 18446744073709551616)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16] - 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_state_variable_1 == 0 && ldv_module_refcounter == 1) && 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-16 04:14:42,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-16 04:14:42,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-16 04:14:42,764 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][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) && ldv_retval_0 == 0) && !(0 == (#memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16] + #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16]) % 18446744073709551616)) && module == #memory_$Pointer$[#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8]][#memory_$Pointer$[pppox_protos][pppox_protos + protocol * 8] + 16] - InvariantResult [Line: 5929]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6393]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1 && ldv_retval_0 == 0) && ldv_state_variable_0 == 1 - 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-16 04:14:42,789 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